Year: 2021
Type: article
Abstract: It is well known that a quantum circuit on N qubits composed of Clifford gates with the addition of k non Clifford gates can be simulated on a classical computer by an algorithm scaling as poly ( N ) exp ( k ) \cite{bravyi2016improved}. We show that, for a quantum circuit to simulate quantum chaotic behavior, it is both necessary and sufficient that k = Θ ( N ) . This result implies the impossibility of simulating quantum chaos on a classical computer.
Source: Quantum
Authors: Lorenzo Leone, Salvatore F. E. Oliviero, You Zhou, Alioscia Hamma
Language: Latvian
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $215
Funder: National Science Foundation
OpenAlex ID: W3131645664
