{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:D4LMHYKB6V3Y2LALUTRX3PG7LX","short_pith_number":"pith:D4LMHYKB","schema_version":"1.0","canonical_sha256":"1f16c3e141f5778d2c0ba4e37dbcdf5df477d8a9ef87d82bb6d7e825d6eace00","source":{"kind":"arxiv","id":"2102.08406","version":3},"attestation_state":"computed","paper":{"title":"Quantum Chaos is Quantum","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alioscia Hamma, Lorenzo Leone, Salvatore F. E. Oliviero, You Zhou","submitted_at":"2021-02-16T19:00:06Z","abstract_excerpt":"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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2102.08406","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-02-16T19:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"4b14742788e1f4d0c200cf79604f2c4a4ae0c4d18bda1bcb6c245355e17a7068","abstract_canon_sha256":"b6e7a6c125fea137c5aa31ce7ef9ed6fcdb07d1d0f4394b65d68366c1acb8cd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:36.207969Z","signature_b64":"a6iLO5u1ulA2PznALZCHCwaRRF03knvMeK8zblDWR2DmdFOH5ah2cdCRcDyrwixDav6RphxC5frBhLKHeg5LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f16c3e141f5778d2c0ba4e37dbcdf5df477d8a9ef87d82bb6d7e825d6eace00","last_reissued_at":"2026-07-05T02:37:36.207449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:36.207449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Chaos is Quantum","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alioscia Hamma, Lorenzo Leone, Salvatore F. E. Oliviero, You Zhou","submitted_at":"2021-02-16T19:00:06Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.08406","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.08406/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.08406","created_at":"2026-07-05T02:37:36.207509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.08406v3","created_at":"2026-07-05T02:37:36.207509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.08406","created_at":"2026-07-05T02:37:36.207509+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4LMHYKB6V3Y","created_at":"2026-07-05T02:37:36.207509+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4LMHYKB6V3Y2LAL","created_at":"2026-07-05T02:37:36.207509+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4LMHYKB","created_at":"2026-07-05T02:37:36.207509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05343","citing_title":"Quantum Computational Resources and Conformal Field Theory: Unifying Spins, Bosons, and Fermions","ref_index":104,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13606","citing_title":"Diffusive Dynamics of Nonstabilizerness","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09971","citing_title":"Magic and entanglement in 1+1-dimensional SU(2) lattice gauge theory","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2601.00761","citing_title":"Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13486","citing_title":"Taming Trotter Errors with Quantum Resources","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX","json":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX.json","graph_json":"https://pith.science/api/pith-number/D4LMHYKB6V3Y2LALUTRX3PG7LX/graph.json","events_json":"https://pith.science/api/pith-number/D4LMHYKB6V3Y2LALUTRX3PG7LX/events.json","paper":"https://pith.science/paper/D4LMHYKB"},"agent_actions":{"view_html":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX","download_json":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX.json","view_paper":"https://pith.science/paper/D4LMHYKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.08406&json=true","fetch_graph":"https://pith.science/api/pith-number/D4LMHYKB6V3Y2LALUTRX3PG7LX/graph.json","fetch_events":"https://pith.science/api/pith-number/D4LMHYKB6V3Y2LALUTRX3PG7LX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX/action/storage_attestation","attest_author":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX/action/author_attestation","sign_citation":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX/action/citation_signature","submit_replication":"https://pith.science/pith/D4LMHYKB6V3Y2LALUTRX3PG7LX/action/replication_record"}},"created_at":"2026-07-05T02:37:36.207509+00:00","updated_at":"2026-07-05T02:37:36.207509+00:00"}