2001/06/26 by Tomaž Prosen, Tomaz Prosen, Marko Znidaric +1 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computation #Computer science #Mathematics #Open quantum system #Operator (biology) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Fourier transform #Quantum Information and Cryptography #Quantum algorithm #Quantum chaos and dynamical systems #Quantum computer #Quantum dynamics #Quantum error correction #Quantum mechanics #Quantum operation #Quantum phase estimation algorithm #Quantum process #Qubit #Stability (learning theory) #Statistical physics #nlin.CD #quant-ph
paper · pdf · doi:10.1088/0305-4470/34/47/103
published as J.Phys.A 34, L681 (2001) · 4 pages, 5 eps figures (3 color)
arxiv created 2001/06/26 · openalex publication_date 2001/11/21 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We consider the stability of a general quantum algorithm (QA) with respect to a fixed but unknown residual interaction between qubits, and show a surprising fact, namely that the average fidelity of quantum computation increases on decreasing the average time correlation function of the perturbing operator in sequences of consecutive quantum gates. Our thinking is applied to the quantum Fourier transformation, where an alternative `less regular' QA is devised, which is qualitatively more robust against static random residual n -qubit interaction.