Eigenstates of Operating Quantum Computer: Hypersensitivity to Static Imperfections

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

revtex, 4 pages, 4 figures

Cited by in corpus (14)

• Dynamics of Loschmidt echoes and fidelity decay
• Asymptotic analysis of high-frequency acoustic modes in rapidly rotating stars
• Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
• Dynamical localization simulated on a few qubits quantum computer
• Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaos
• Imperfection effects for multiple applications of the quantum wavelet transform
• Quantum Computation of a Complex System : the Kicked Harper Model
• Detecting entanglement of random states with an entanglement witness
• Estimation of the Local Density of States on a Quantum Computer
• A model of deterministic detector with dynamical decoherence
• Effects of imperfections for Shor's factorization algorithm
• Fractal Fidelity as a signature of Quantum Chaos
• Impact of dynamics, entanglement, and Markovian noise on the fidelity of few-qubit digital quantum simulation
• Perturbations and chaos in quantum maps