Non-Markovian decoherence in the adiabatic quantum search algorithm

Abstract

We consider an adiabatic quantum algorithm (Grover's search routine) weakly coupled to a rather general environment, i.e., without using the Markov approximation. Markovian errors generally require high-energy excitations (of the reservoir) and tend to destroy the scalability of the adiabatic quantum algorithm. We find that, under appropriate conditions (such as low temperatures), the low-energy (i.e., non-Markovian) modes of the bath are most important. Hence the scalability of the adiabatic quantum algorithm depends on the infra-red behavior of the environment: a reasonably small coupling to the three-dimensional electromagnetic field does not destroy the scaling behavior, whereas phonons or localized degrees of freedom can be problematic. PACS: 03.67.Pp, 03.67.Lx, 03.67.-a, 03.65.Yz.

References in corpus (6)

• Non-Markovian generalization of the Lindblad theory of open quantum systems
• Adiabatic approximation in open quantum systems
• Genuine quantum trajectories for non-Markovian processes
• Noise resistance of adiabatic quantum computation using random matrix theory
• Adiabatic quantum algorithms as quantum phase transitions: first versus second order
• The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis

Cited by in corpus (33)

• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Decoherence in adiabatic quantum computation
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Towards Fault Tolerant Adiabatic Quantum Computation
• First Order Quantum Phase Transition in Adiabatic Quantum Computation
• Thermally assisted adiabatic quantum computation
• Decoherence in adiabatic quantum computation
• Role of Single Qubit Decoherence Time in Adiabatic Quantum Computation
• Unification and limitations of error suppression techniques for adiabatic quantum computing
• Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
• MAX 2-SAT with up to 108 qubits
• Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
• Decoherence in the dynamical quantum phase transition of the transverse Ising chain
• Landau-Zener Transitions in an Adiabatic Quantum Computer
• Relaxation vs. adiabatic quantum steady state preparation: which wins?
• High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
• Analog Nature of Quantum Adiabatic Unstructured Search
• Adiabatic Quantum Search in Open Systems
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
• Effects of dissipation in an adiabatic quantum search algorithm
• Adiabatic quantum optimization in presence of discrete noise: Reducing the problem dimensionality
• The adiabatic theorem in the presence of noise
• Decoherence induced deformation of the ground state in adiabatic quantum computation
• Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
• Dynamical quantum phase transitions
• Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
• Tsallis relative $\alpha$ entropy of coherence dynamics in Grover's search algorithm
• Decoherence in a dynamical quantum phase transition
• Implementation of many-qubit Grover search with trapped ultracold ions
• Hilbert Space Average Method and adiabatic quantum search
• Investigating the Performance of an Adiabatic Quantum Optimization Processor
• Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
• Energy Spectrum and Exact Cover in an Extended Quantum Ising Model