Noise resistance of adiabatic quantum computation using random matrix theory

2004/09/20 by Jérémie Roland, Jeremie Roland, Nicolas J. Cerf · 6 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.1103/physreva.71.032330

published as Phys. Rev. A 71, 032330 (2005) · 9 pages, 3 figures

arxiv created 2004/09/20 · openalex publication_date 2005/03/21 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 about 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.

Citations

• Fiber‐Optic Communication Systems
• Quantum Computation and Decision Trees
• Quantum Search by Local Adiabatic Evolution

Cited by

• Norm Inequality for Perturbed Quantum Evolutions and Its Application to Grover's Algorithm
• Complex instruction set computing architecture for performing accurate quantum Z rotations with less magic
• Investigating the Performance of an Adiabatic Quantum Optimization\n Processor
• Internal consistency of fault-tolerant quantum error correction in light of rigorous derivations of the quantum Markovian limit
• Quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation

Related

• A polynomial-time classical algorithm for noisy quantum circuits
• Stochastic quantum adiabatic algorithm with fractional Brownian motion
• Stochastic Liouville equation approach for the effect of noise in quantum computations
• Thermal Noise on Adiabatic Quantum Computation
• Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs