Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0110019

Comment on "Stable Quantum Computation of Unstable Classical Chaos"

Christof Zalka

Published Oct 2, 2001• 7 citations
arXivHTMLPDF

Abstract

This is a 1-page comment on a wrong paper that recently appeared in PRL (Phys. Rev. Lett. 86 (23), 5393 (2001), also quant-ph/0101004). The authors claim to have shown that using a quantum computer gives an "exponential advantage" for simulating and studying classical chaotic systems.
DOI
10.48550/arxiv.quant-ph/0110019

Related papers

Comment on “Stable Quantum Computation of Unstable Classical Chaos”

Lajos Diósi

I think the title and content of the recent Letter by Georgeot and Shepelyanski [PRL 86, 5393 (2001), also quant-ph/0101004)] are not correct. As long as the classical Arnold map is considered, the classical computational algorithm can be made exactly equivalent with the quantum one. The claimed advantage of the Letter's quantum algorithm disappears if we correctly restrict the statistical analysis for the classical Arnold system.

arXiv:quant-ph/0110026•Physical Review Letters•May 9, 2002•4 citations

Stable Quantum Computation of Unstable Classical Chaos

Bertrand Georgeot, Dima L. Shepelyansky

We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with moderate imperfections is able to simulate accurately the unstable chaotic classical nonlinear dynamics for long times. The algorithm can be easily implemented on systems of a few qubits.

arXiv:quant-ph/0101004•Physical Review Letters•Jun 4, 2001•46 citations

Comment on “Exponential Sensitivity and Chaos in Quantum Systems”

Rüdiger Schack

A Comment on the Letter by R. Blümel, Phys. Rev. Lett. 73, 428 (1994). The authors of the Letter offer a Reply.Received 12 August 1994DOI:https://doi.org/10.1103/PhysRevLett.75.581©1995 American Physical Society

Physical Review Letters•Jul 17, 1995•12 citations

Comment on ``Testing integrability with a single bit of quantum information''

Howard M. Wiseman

In quant-ph/0303042, Poulin, Laflamme, Milburn and Paz consider the problem of distinguishing quantum chaos from quantum integrability for dynamics in an $N$-dimensional Hilbert space. They claim that this can be done by deterministic quantum computing with a single bit using $O(\sqrt{N})$ physical resources, compared to O(N) physical resources classically. I point out what seems to be a fatal flaw with their proposal.

arXiv:quant-ph/0305153•May 25, 2003•1 citation

Reply to the comment "quant-ph/9710002"

Luming Duan, Guang‐Can Guo

In the comment, Zanardi and Rasetti argue that several claims in our recent letter (Phys. Rev. Lett. 79, 1953, 1997) are questionable. The reply shows these claims remain true.

arXiv:quant-ph/9710014•Oct 3, 1997•1 citation

Simulations of Many-Body Quantum Systems by a Quantum Computer

Stephen J. Wiesner

We suggest that quantum computers can solve quantum many-body problems that are impracticable to solve on a classical computer.

arXiv:quant-ph/9603028•Mar 26, 1996•237 citations
In quant-ph/0303042, Poulin, Laflamme, Milburn and Paz consider the problem of distinguishing quantum chaos from quantum integrability for dynamics in an NNN-dimensional Hilbert space. They claim that this can be done by deterministic quantum computing with a single bit using O(N)O(\sqrt{N})O(N​) physical resources, compared to O(N) physical resources classically. I point out what seems to be a fatal flaw with their proposal.