Quantum Chaos is Quantum.

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.