Pith. sign in

REVIEW 5 cited by

Quantum Chaos is Quantum

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.08406 v3 pith:D4LMHYKB submitted 2021-02-16 quant-ph

Quantum Chaos is Quantum

classification quant-ph
keywords quantumchaoscircuitclassicalcliffordcomputergatesaddition
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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 $\text{poly}(N)\exp(k)$[1]. We show that, for a quantum circuit to simulate quantum chaotic behavior, it is both necessary and sufficient that $k=O(N)$. This result implies the impossibility of simulating quantum chaos on a classical computer.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Computational Resources and Conformal Field Theory: Unifying Spins, Bosons, and Fermions

    quant-ph 2026-07 accept novelty 8.0

    A unified Magic Rényi Entropy measure for spins, bosons, and fermions is shown to have a universal critical contribution determined by the Affleck-Ludwig boundary entropy.

  2. Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness

    quant-ph 2026-01 unverdicted novelty 7.0

    A sampling method combining fast Walsh-Hadamard transform and Clifford-preconditioned Monte Carlo reduces Pauli-string sampling cost from O(2^N) to O(N) with sample count independent of N for stabilizer Rényi entropie...

  3. Diffusive Dynamics of Nonstabilizerness

    quant-ph 2026-06 unverdicted novelty 6.0

    In U(1)-symmetric 1D random circuits the stabilizer Rényi entropy gap closes diffusively as 1/t, with the same scaling seen in an energy-conserving Ising chain.

  4. Magic and entanglement in 1+1-dimensional SU(2) lattice gauge theory

    quant-ph 2026-06 unverdicted novelty 5.0

    Tensor network calculation of magic and entanglement in SU(2) lattice gauge theory ground state shows a crossover from magic-rich to less-magic regime at g_star.

  5. Taming Trotter Errors with Quantum Resources

    quant-ph 2026-04 unverdicted novelty 5.0

    Higher entanglement entropy reduces variance of Trotter errors and higher magic reduces kurtosis, making error distributions more robust in quantum simulation.