arXiv:quant-ph/0110019

Comment on "Stable Quantum Computation of Unstable Classical Chaos"

Christof Zalka

Published Oct 2, 2001• 1 citation

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/0110026Physical Review LettersMay 9, 20022 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/0101004Physical Review LettersJun 4, 200143 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 LettersJul 17, 199512 citations

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/9603028Mar 26, 1996127 citations

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/9710014Oct 3, 19971 citation

Reply to Comment on ``Proposal for the Measurement of Bell-Type Correlations from Continuous Variables''

Timothy C. Ralph, William J. Munro

Recently K. Banaszek, I. A. Walmsley, K. Wodkiewicz (quant-ph/0012097) commented on our Proposal for the Measurement of Bell-Type Correlations from Continuous Variables [T. C. Ralph, W. J. Munro, R. E. S. Polkinghorne, Phys. Rev. Lett. 85, 2035 (2000)]. Their comment is based on a blatant misreading and misunderstanding of our letter and as such is simply wrong.

arXiv:quant-ph/0104092Apr 19, 20010 citations