Decoherence in adiabatic quantum computation

Abstract

Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time-scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit $T_2$ time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed system setting, remain beneficial in the open system setting. To address the high computational cost of master equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.

21 pages, 12 figures. v2: updated to published version

References in corpus (23)

• Mathematical Foundation of Quantum Annealing
• Bounds for the adiabatic approximation with applications to quantum computation
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Adiabatic approximation in open quantum systems
• Experimental implementation of an adiabatic quantum optimization algorithm
• Quantum Adiabatic Brachistochrone
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Towards Fault Tolerant Adiabatic Quantum Computation
• Consistency Tests of Classical and Quantum Models for a Quantum Annealer
• Phase diagram and critical exponents of a dissipative Ising spin chain in a transverse magnetic field
• Quantum annealing correction for random Ising problems
• Noise resistance of adiabatic quantum computation using random matrix theory
• Decoherence in a scalable adiabatic quantum computer
• Accuracy vs run time in adiabatic quantum search
• Landau-Zener transitions in a two-level system coupled to a finite-temperature harmonic oscillator
• Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
• Algorithm engineering for a quantum annealing platform
• The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
• Comparative Study of the Performance of Quantum Annealing and Simulated Annealing
• Quantum and Classical in Adiabatic Computation
• Computational Role of Collective Tunneling in a Quantum Annealer
• Quantum error suppression with commuting Hamiltonians: Two-local is too local
• Aluminum Hard Mask Technique for the Fabrication of High-Quality Submicron Nb/Al-AlOx/Nb Josephson Junctions

Cited by in corpus (3)

• Shortcuts to adiabaticity for quantum annealing
• Quantum annealing correction at finite temperature: ferromagnetic $p$-spin models
• Creating Quantum Cluster States embedded in ancillary baths