Efficient Quantum Computing of Complex Dynamics

2001/07/06 by Giuliano Benenti, Giulio Casati, Simone Montangero +1 · 97 citations
Computer Science · Physics and Astronomy · #Algorithm #Computational science #Computer science #Noise (video) #Parallel Computing and Optimization Techniques #Phase space #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum computer #Quantum error correction #Quantum gate #Quantum mechanics #Qubit #Sawtooth wave #Scale (ratio) #Statistical physics #cond-mat #nlin.CD #quant-ph

paper · pdf · doi:10.1103/physrevlett.87.227901

published in Physical Review Letters 87(22), 227901 (American Physical Society) · revtex, 4 pages, 3 figures

arxiv created 2001/07/06 · openalex publication_date 2001/11/09 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

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.

Citations

• Quantum computing

Cited by

• A purely Quantum Generative Modeling through Unitary Scrambling and Collapse
• Dissipative decoherence in the Grover algorithm

Related

• Quantum Computing and Information Extraction for Dynamical Quantum Systems
• Dynamical localization simulated on a few qubits quantum computer
• Quantum computing of quantum chaos in the kicked rotator model
• Quantum Computation of a Complex System : the Kicked Harper Model
• Noise-Resilient Quantum Dynamics Using Symmetry-Preserving Ansatzes