Validity condition for high-fidelity Digitized Quantum Annealing
arXiv:2406.16385 · doi:10.1103/PhysRevA.111.022618
Abstract
Digitizing an adiabatic evolution is a strategy able to combine the good performance of gate-based quantum processors with the advantages of adiabatic algorithms, providing then a hybrid model for efficient quantum information processing. In this work we develop validity conditions for high fidelity digital adiabatic tasks. To this end, we assume a digitizing process based on the Suzuki-Trotter decomposition, which allows us to introduce a Digitized Adiabatic Theorem. As consequence of this theorem, we show that the performance of such a hybrid model is limited by the fundamental constraints on the adiabatic theorem validity, even in ideal quantum processors. We argue how our approach predicts the existence of intrinsic non-adiabatic errors reported by R. Barends et al., Nature 534, 222 (2016) through an empirical study of digital annealing. In addition, our approach allows us to explain the existence of a scaling of the number of Suzuki-Trotter blocks for the optimal digital circuit with respect to the optimal adiabatic total evolution time, as reported by G. B. Mbeng et al., Phys. Rev. B 100, 224201 (2019) through robust numerical analysis of digital annealing. We illustrate our results through two examples of digitized adiabatic algorithms, namely, the two-qubits exact-cover problem and the three-qubits adiabatic factorization of the number 21.
10 pages and 4 figures. Accepted for publication in Phys. Rev. A
References in corpus (27)
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Hamiltonian Simulation by Qubitization
- Quantum Computation as Geometry
- A Theory of Trotter Error
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Digitized adiabatic quantum computing with a superconducting circuit
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- Bounds for the adiabatic approximation with applications to quantum computation
- Coherent quantum annealing in a programmable 2000-qubit Ising chain
- Continuous Symmetry Breaking in a Two-dimensional Rydberg Array
- Error corrected quantum annealing with hundreds of qubits
- Consistency of the Adiabatic Theorem
- Experimental implementation of an adiabatic quantum optimization algorithm
- A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
- Quantum Speedup by Quantum Annealing
- Quantum Adiabatic Brachistochrone
- Quantitative conditions do not guarantee the validity of the adiabatic approximation
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
- Tunneling and speedup in quantum optimization for permutation-symmetric problems
- Continuous Symmetry Breaking in a Trapped-Ion Spin Chain
- Self-healing of Trotter error in digital adiabatic state preparation
- Optimal working point in digitized quantum annealing
- Diabatic Quantum Annealing for the Frustrated Ring Model
- Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
- Validation of Quantum Adiabaticity through Non-Inertial Frames and Its Trapped-Ion Realization