2021
DOI: 10.22331/q-2021-05-04-453
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Chaos is Quantum

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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

6
57
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
3

Relationship

3
6

Authors

Journals

citations
Cited by 53 publications
(63 citation statements)
references
References 21 publications
(23 reference statements)
6
57
0
Order By: Relevance
“…An explicit measure of magic was recently proposed in [45]. Its relations with quantum chaos was studied in [46]. It would be interesting to better investigate the role of magic in the VQA problems, following [47].…”
Section: Discussion and Outlookmentioning
confidence: 99%
“…An explicit measure of magic was recently proposed in [45]. Its relations with quantum chaos was studied in [46]. It would be interesting to better investigate the role of magic in the VQA problems, following [47].…”
Section: Discussion and Outlookmentioning
confidence: 99%
“…First and foremost, we want to extend the results of the crossover to more structural aspects of the dynamics with the goal of obtaining a quantum KAM theorem. Second, one could systematically study how different spectra behave together with different ensembles of eigenvectors, for instance, interpolating between Clifford and universal resources in a random quantum circuit [79], by doping a stabilizer Hamiltonian with non-Clifford resources such as the T−gates [66]. Another important aspect is that of the locality of the interactions.…”
Section: Discussionmentioning
confidence: 99%
“…Now we consider l−doped Hamiltonians by doping with T−gates, without loss of generality. Using the technique in [66], a lengthy but straightforward calculation gives the following theorem. Theorem 1.…”
Section: Otocsmentioning
confidence: 99%
“…Clifford gates represent an interesting subgroup of the unitary group because they can be efficiently simulated by a classical computer, and yet are still very effective in attaining maximum levels of entanglement [10,[33][34][35]. However, while these gates are easily simulated on classical machines, they are not sufficient for true chaotic behavior in quantum systems [10,33,[35][36][37][38][39]. Including gates outside the Clifford group provides a set that is universal for quantum computation and induces chaotic behavior [24,25,34,40,41].…”
Section: Introductionmentioning
confidence: 99%