Quantum Chaos is Quantum.
ORAL
Abstract
It is well known that a quantum circuit on n-qubits composed of Clifford gates with the addition of k T-gates can be simulated on a classical computer by an algorithm scaling polynomially in n and an exponentially in k. Our work in this direction focused on finding the number of non-Clifford resources needed to simulate quantum chaos. Can quantum chaos be efficiently simulated on a classical computer? In other words, how many non-Clifford resources are required to simulate quantum chaotic bahavior? We proved that Θ(n) non-Clifford resources are necessary to access full quantum chaotic behavior, and this reflects the impossibility of simulating quantum chaos on a classical computer: quantum chaos is quantum.
*The work was supported in part by College of Science and Mathematics Dean’s Doctoral Research Fellowship through fellowship support from Oracle, project ID R20000000025727.We acknowledge support from NSF award number 2014000.
–
Publication: Leone, L., Oliviero, S. F., Zhou, Y., & Hamma, A. (2021). Quantum Chaos is Quantum. Quantum, 5, 453. https://doi.org/10.22331/q-2021-05-04-453
Salvatore F.E. Oliviero, Lorenzo Leone, Alioscia Hamma, Transitions in entanglement complexity in random quantum circuits by measurements, Physics Letters A, Volume 418, 2021, 127721, ISSN 0375-9601, https://doi.org/10.1016/j.physleta.2021.127721.
Presenters
-
Salvatore Francesco Emanuele Oliviero
- University of Massachusetts Boston