Inferring the Dynamics of Ground-State Evolution of Quantum Annealers

To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer, which then returns a user-specified number of low-energy solutions. It would be useful to know what happens in the quantum processor during the anneal process so that one could design better algorithms or suggest improvements to the hardware. However, existing quantum annealers are not able to directly extract such information from the processor. Hence, in this work we propose to use advanced features of the newest annealer generation, the D-Wave 2000Q, to indirectly infer information about the dynamics of the ground-state during the anneal process. Specifically, D-Wave 2000Q allows the user to customize the anneal schedule, that is, the schedule with which the anneal fraction is changed from the start to the end of the anneal. Using this feature, we design a set of modified anneal schedules whose outputs can be used to generate information about the states of the system at user-defined time points during a standard anneal. With this process, called "slicing", we obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves. We use our technique to obtain a variety of insights into the annealer such as how the ground state evolves during the annealing, when individual bits in an evolving solution flip during the anneal process and when they stabilize, and we introduce an approximate technique to determine the freeze-out point of the system as well as of individual qubits.

[1]  M. Benedetti,et al.  Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning , 2015, 1510.07611.

[2]  Eleanor G. Rieffel,et al.  Thermalization, Freeze-out, and Noise: Deciphering Experimental Quantum Annealers , 2017, 1703.03902.

[3]  Hristo Djidjev,et al.  Optimizing the Spin Reversal Transform on the D-Wave 2000Q , 2019, 2019 IEEE International Conference on Rebooting Computing (ICRC).

[4]  Hristo Djidjev,et al.  Solving large minimum vertex cover problems on a quantum annealer , 2019, CF.

[5]  Hristo Djidjev,et al.  Finding Maximum Cliques on the D-Wave Quantum Annealer , 2018, Journal of Signal Processing Systems.

[6]  E. Rieffel,et al.  Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers , 2018, Physical Review Applied.

[7]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[8]  Hristo Djidjev,et al.  Peering Into the Anneal Process of a Quantum Annealer , 2019, 2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT).

[9]  Hristo Djidjev,et al.  Solving Large Maximum Clique Problems on a Quantum Annealer , 2019, QTOP@NetSys.

[10]  Daniel A. Lidar,et al.  Dynamics of reverse annealing for the fully connected p -spin model , 2018, Physical Review A.

[11]  Hristo Djidjev,et al.  Advanced anneal paths for improved quantum annealing , 2020, 2020 IEEE International Conference on Quantum Computing and Engineering (QCE).

[12]  M. Amin Searching for quantum speedup in quasistatic quantum annealers , 2015, 1503.04216.

[13]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[14]  G. Passarelli,et al.  Improving quantum annealing of the ferromagnetic p -spin model through pausing , 2019, Physical Review B.