Comment on "Stable Quantum Computation of Unstable Classical Chaos"
Lajos Diosi
Abstract
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.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado