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 nq, it is shown that the ideal eigenstates become mixed and strongly modified by static imperfections above a certain threshold which drops exponentially with nq. Above this threshold the quantum eigenstate entropy grows linearly with nq but the computation remains reliable during a time scale which is polynomial in the imperfection strength and in nq.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received 7 March 2002/ Received in final form 3 May 2002 Published online 19 July 2002
Rights and permissions
About this article
Cite this article
Benenti, G., Casati, G., Montangero, S. et al. Eigenstates of an operating quantum computer: hypersensitivity to static imperfections. Eur. Phys. J. D 20, 293–296 (2002). https://doi.org/10.1140/epjd/e2002-00127-x
Issue Date:
DOI: https://doi.org/10.1140/epjd/e2002-00127-x