Efficient Quantum Computing of Complex Dynamics

Giuliano Benenti, Giulio Casati, Simone Montangero, and Dima L. Shepelyansky
Phys. Rev. Lett. 87, 227901 – Published 9 November 2001
PDFExport Citation

Abstract

We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics described by the quantum sawtooth map. The numerical study of the effect of static imperfections in the quantum computer hardware shows that the main elements of the phase space structures are accurately reproduced up to a time scale which is polynomial in the number of qubits. The errors generated by these imperfections are more significant than the errors of random noise in gate operations.

  • Received 6 July 2001

DOI:https://doi.org/10.1103/PhysRevLett.87.227901

©2001 American Physical Society

Authors & Affiliations

Giuliano Benenti1,2, Giulio Casati1,2,3, Simone Montangero1,2, and Dima L. Shepelyansky4

  • 1International Center for the Study of Dynamical Systems, Università degli Studi dell'Insubria
  • 2and Istituto Nazionale per la Fisica della Materia, Unità di Como, Via Valleggio 11, 22100 Como, Italy
  • 3Istituto Nazionale di Fisica Nucleare, Sezione di Milano, Via Celoria 16, 20133 Milano, Italy
  • 4Laboratoire de Physique Quantique, UMR 5626 du CNRS, Université Paul Sabatier, 31062 Toulouse Cedex 4, France

References (Subscription Required)

Click to Expand
Issue

Vol. 87, Iss. 22 — 26 November 2001

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×