Eigenstates of an operating quantum computer: hypersensitivity to static imperfections

2001/12/21 by Giuliano Benenti, Giulio Casati, Simone Montangero +1 · 1 citation
Computer Science · Physics and Astronomy · #Advanced Thermodynamics and Statistical Mechanics #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #cond-mat #nlin.CD #quant-ph

paper · pdf · doi:10.1140/epjd/e2002-00127-x

published as Eur. Phys. J. D 20 (2002) 293 · revtex, 4 pages, 4 figures

arxiv created 2001/12/21 · openalex publication_date 2002/08/01 · arxiv updated 2009/11/30 · openalex created_date 2020/11/23 · openalex updated_date 2026/07/28

Abstract

We study the properties of eigenstates of an operating quantum computer which simulates the dynamical evolution in the regime of quantum chaos. Even if the quantum algorithm is polynomial in number of qubits n_q, it is shown that the ideal eigenstates become mixed and strongly modified by static imperfections above a certain threshold which drops exponentially with n_q. Above this threshold the quantum eigenstate entropy grows linearly with n_q but the computation remains reliable during a time scale which is polynomial in the imperfection strength and in n_q.

Cited by

• Effects of imperfections for Shor’s factorization algorithm

Related

• Statistical properties of eigenvalues for an operating quantum computer with static imperfections
• Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
• Quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations
• Effects of decoherence and imperfections for quantum algorithms
• Efficient quantum computing insensitive to phase errors