Noise resistance of adiabatic quantum computation using random matrix theory

Abstract

Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as well as adiabatic quantum algorithms. Unfortunately, very little is known today on the behavior of these Hamiltonian algorithms in the presence of noise. Here, we perform a fully analytical study of the resistance to noise of these algorithms using perturbation theory combined with a theoretical noise model based on random matrices drawn from the Gaussian Orthogonal Ensemble, whose elements vary in time and form a stationary random process.

9 pages, 3 figures

References in corpus (6)

• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum Computation and Decision Trees
• Quantum Search by Local Adiabatic Evolution
• Robustness of adiabatic quantum computation
• Effects of Noisy Oracle on Search Algorithm Complexity
• Quantum circuit implementation of the Hamiltonian versions of Grover's algorithm

Cited by in corpus (69)

• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Adiabatic Quantum Computation in Open Systems
• A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
• Decoherence in adiabatic quantum computation
• Error correcting codes for adiabatic quantum computation
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Internal Consistency of Fault-Tolerant Quantum Error Correction in Light of Rigorous Derivations of the Quantum Markovian Limit
• Towards Fault Tolerant Adiabatic Quantum Computation
• The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
• First Order Quantum Phase Transition in Adiabatic Quantum Computation
• Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
• Robust quantum optimizer with full connectivity
• Decoherence in a scalable adiabatic quantum computer
• Role of Single Qubit Decoherence Time in Adiabatic Quantum Computation
• Quantum Computing Assisted Deep Learning for Fault Detection and Diagnosis in Industrial Process Systems
• MAX 2-SAT with up to 108 qubits
• Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
• Robustness of adiabatic passage trough a quantum phase transition
• Optimal quantum spatial search on random temporal networks
• Observation of the ground-state-geometric phase in a Heisenberg XY model
• Robustness of the adiabatic quantum search
• Non-Markovian decoherence in the adiabatic quantum search algorithm
• Quantum computation in continuous time using dynamic invariants
• Performance of two different quantum annealing correction codes
• Scaling of running time of quantum adiabatic algorithm for propositional satisfiability
• The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
• Mean Field Analysis of Quantum Annealing Correction
• Effect of Local Minima on Adiabatic Quantum Optimization
• Quantum Computation Beyond the Circuit Model
• Landau-Zener Transitions in an Adiabatic Quantum Computer
• Real-Time Krylov Theory for Quantum Computing Algorithms
• Scalable Superconducting Architecture for Adiabatic Quantum Computation
• High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
• Analog Nature of Quantum Adiabatic Unstructured Search
• Quantum spatial search on graphs subject to dynamical noise
• Adiabatic Quantum Search in Open Systems
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
• Adiabatic passage in the presence of noise
• Variationally Scheduled Quantum Simulation
• Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization
• Error suppression in adiabatic quantum computing with qubit ensembles
• Adiabatic quantum optimization in presence of discrete noise: Reducing the problem dimensionality
• Signatures of Open and Noisy Quantum Systems in Single-Qubit Quantum Annealing
• The adiabatic theorem in the presence of noise
• A Statistical Theory of Designed Quantum Transport Across Disordered Networks
• Decoherence induced deformation of the ground state in adiabatic quantum computation
• Theorem on the existence of a nonzero energy gap in adiabatic quantum computation
• Vertices cannot be hidden from quantum spatial search for almost all random graphs
• VanQver: The Variational and Adiabatically Navigated Quantum Eigensolver
• Quantum annealing with twisted fields
• Sensitivity of quantum speedup by quantum annealing to a noisy oracle
• Rotationally invariant bipartite states and bound entanglement
• The relationship between minimum gap and success probability in adiabatic quantum computing
• Noise enhanced performance of adiabatic quantum computing by lifting degeneracies
• Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
• Robust Diabatic Quantum Search by Landau-Zener-Stückelberg Oscillations
• Dilution of error in digital Hamiltonian simulation
• The Detectability Lemma and Quantum Gap Amplification
• Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis
• Eigenlevel statistics of the quantum adiabatic algorithm
• Investigating the Performance of an Adiabatic Quantum Optimization Processor
• Threshold theorem in isolated quantum dynamics with stochastic control errors
• Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
• Development of research network on Quantum Annealing Computation and Information using Google Scholar data
• Decoherence of quantum gates based on Aharonov-Anandan phases in a multistep scheme
• Energy Spectrum and Exact Cover in an Extended Quantum Ising Model
• Hardware-efficient quantum annealing with error mitigation via classical shadow
• Control limit for the quantum state preparation under stochastic control errors
• Adiabatic Quantum Computing