arXiv:2209.00201 · Physical Review A

Effect of quantum statistics on computational power of atomic quantum annealers

Yuchen Luo, Xiaopeng Li

Published Jan 17, 2023• 1 citation

Abstract

Quantum particle statistics fundamentally controls the way particles interact and plays an essential role in determining the properties of the system at low temperature. Here we study how the quantum statistics affects the computational power of quantum annealing. We propose an annealing Hamiltonian describing quantum particles moving on a square lattice and compare the computational performances of the atomic quantum annealers between two statistically different components: spinless fermions and hard-core bosons. In addition, we take an Ising quantum annealer driven by traditional transverse-field quantum fluctuations as a baseline. The potential of our quantum annealers to solve combinatorial optimization problems is demonstrated on random 3-regular graph partitioning. We find that the bosonic quantum annealer outperforms the fermionic case. The superior performance of the bosonic quantum annealer is attributed to larger excitation gaps and the consequent smoother adiabatic transformation of its instantaneous quantum ground states. Along our annealing schedule, the bosonic quantum annealer is less affected by the glass order and explores the Hilbert space more efficiently. Our theoretical finding could shed light on constructing atomic quantum annealers using Rydberg atoms in optical lattices.

DOI: 10.1103/physreva.107.012608

Related papers

Quantum versus Classical Annealing: Insights from Scaling Theory and Results for Spin Glasses on 3-Regular Graphs

Chengwei Liu, Anatoli Polkovnikov, Anders W. Sandvik

We discuss an Ising spin glass where each S=1/2 spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte Carlo simulations to study dynamic scaling at the quantum glass transition. Comparing the dynamic exponent and other critical exponents with those of the classical (temperature-driven) transition, we conclude that quantum annealing is less efficient than classical simulated annealing in bringing the system into the glass phase. Quantum computing based on the quantum annealing paradigm is therefore inferior to classical simulated annealing for this class of problems. We also comment on previous simulations where a parameter is changed with the simulation time, which is very different from the true Hamiltonian dynamics simulated here.

arXiv:1409.7192Physical Review LettersApr 7, 201555 citations

Optimization by quantum annealing: Lessons from hard satisfiability problems

Demian A. Battaglia, Giuseppe E. Santoro, Erio Tosatti

The path integral Monte Carlo simulated quantum annealing algorithm is applied to the optimization of a large hard instance of the random satisfiability problem (N = 10,000). The dynamical behavior of the quantum and the classical annealing are compared, showing important qualitative differences in the way of exploring the complex energy landscape of the combinatorial optimization problem. At variance with the results obtained for the Ising spin glass and for the traveling salesman problem, in the present case the linear-schedule quantum annealing performance is definitely worse than classical annealing. Nevertheless, a quantum cooling protocol based on field-cycling and able to outperform standard classical simulated annealing over short time scales is introduced.

arXiv:cond-mat/0502468Physical Review EJun 29, 2005107 citations

Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass

Layla Hormozi, Ethan Brown, Giuseppe Carleo +1 more

Quantum annealers are computing machines that utilize quantum effects to solve hard optimization problems. Understanding the circumstances under which quantum annealers are more efficient than other optimization methods is a challenging open problem. A clue to this conundrum comes from studying the complexity of quantum annealers. In general, the complexity of a physical system relates to how efficiently the system can be simulated by classical algorithms. One then asks: if some class of quantum annealers are hard to simulate classically, are they also more powerful optimization machines? Here, the authors study quantum annealers belonging to two different complexity classes: the so-called ``stoquastic'' systems, which can be efficiently simulated with classical algorithms, and ``nonstoquastic'' systems, currently with no efficient classical treatment. Applied to a prototypical optimization problem, the authors observe that, on average, the stoquastic systems perform better on easier instances of the problem, while the more complex nonstoquastic annealers show significant advantage when applied to the hardest instances. The authors conjecture that the performance of the nonstoquastic Hamiltonians is closely related to their internal structure during the annealing process and elucidate how properties such as magnetic frustration can play a key role in devising more powerful quantum annealers.

arXiv:1609.06558Physical review. B./Physical review. BMay 15, 201797 citations

Quantum annealing in the transverse Ising model

Tadashi Kadowaki, Hidetoshi Nishimori

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach. The idea is tested by the transverse Ising model, in which the transverse field is a function of time similar to the temperature in the conventional method. The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible. We have solved the time-dependent Schr\"odinger equation numerically for small size systems with various exchange interactions. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum annealing leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule.

arXiv:cond-mat/9804280Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsNov 1, 19982,336 citations

Statistical Analysis of Quantum Annealing

Xinyu Song, Yazhen Wang, Shang Wu +1 more

Quantum computers use quantum resources to carry out computational tasks and may outperform classical computers in solving certain computational problems. Special-purpose quantum computers such as quantum annealers employ quantum adiabatic theorem to solve combinatorial optimization problems. In this paper, we compare classical annealings such as simulated annealing and quantum annealings that are done by the D-Wave machines both theoretically and numerically. We show that if the classical and quantum annealing are characterized by equivalent Ising models, then solving an optimization problem, i.e., finding the minimal energy of each Ising model, by the two annealing procedures, are mathematically identical. For quantum annealing, we also derive the probability lower-bound on successfully solving an optimization problem by measuring the system at the end of the annealing procedure. Moreover, we present the Markov chain Monte Carlo (MCMC) method to realize quantum annealing by classical computers and investigate its statistical properties. In the numerical section, we discuss the discrepancies between the MCMC based annealing approaches and the quantum annealing approach in solving optimization problems.

arXiv:2101.06854Jan 18, 20210 citations

Finite-size scaling in quantum annealing with decoherence

Phillip Weinberg

Quantum annealing represents an essential milestone towards the goal of adiabatic quantum computing. In quantum annealing, the computation involves finding the ground state of a classical Ising-like Hamiltonian realized as interactions between qubits. Quantum fluctuations are introduced to allow the wavefunction of the qubits to explore the energy landscape, the hope being that the wavefunction finds a minimum energy configuration and possibly giving the result of the computation. While quantum annealing likely may not be as powerful as adiabatic quantum computing, it is possible that it may be better at optimization compared to analogous classical algorithms. In physical realizations of quantum annealing, there are still questions as to the role of quantum fluctuations in the operation of a device given the short coherence times of the individual qubits. These questions have consistently posed a serious theoretical challenge making it difficult to verify experimental results. Here we simplify the problem by considering a system of qubits with ferromagnetic interactions, modeling the decoherence effects as classical noise in the transverse-field of each qubit. We compare the calculations to data collected from a system of manufactured qubits produced by D-wave Systems by performing a finite-size scaling analysis that captures the competition between quantum fluctuations of the transverse-field and bit-flip errors from the noise. We argue that on time-scales larger than the single-qubit decoherence time, the device produces the expected quantum fluctuations for the many-body system. Using this finite-size scaling, one can diagnose sources of noise in the system. Hopefully, in the near future, these devices will not only be realizing coherent quantum annealing but will likely be useful as another example of synthetic quantum matter.

Jan 1, 20200 citations