{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4ZOUU4GQESM677SLI7MAPJKDO7","short_pith_number":"pith:4ZOUU4GQ","schema_version":"1.0","canonical_sha256":"e65d4a70d02499effe4b47d807a54377fdbc3656a129e4339d982dd3c63579eb","source":{"kind":"arxiv","id":"2407.12768","version":2},"attestation_state":"computed","paper":{"title":"A polynomial-time classical algorithm for noisy quantum circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math-ph","math.IT","math.MP","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Chao Yin, Norman Y. Yao, Thomas Schuster, Xun Gao","submitted_at":"2024-07-17T17:48:39Z","abstract_excerpt":"We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the computational basis). Our approach is based upon the intuition that noise exponentially damps non-local correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by only keeping track of the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in qu"},"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":"2407.12768","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-17T17:48:39Z","cross_cats_sorted":["cs.CC","cs.IT","math-ph","math.IT","math.MP","physics.atom-ph"],"title_canon_sha256":"3ecf8bc0fa6460af1d9f7a96e03d83e92aa67db73791492a1bfa06c783e4eaa6","abstract_canon_sha256":"25e4964b258e9907e1fc5ec736730e4aa550f8594673530e3844b6febaf28247"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:01.262852Z","signature_b64":"s/MfakBDygUCVBNm29qQ/bRXwO1oSyNroLqM1mDLwqnxgaNGbW34SIX9lSylhhCQrLnggzVOnnlAbRlQ1WOrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e65d4a70d02499effe4b47d807a54377fdbc3656a129e4339d982dd3c63579eb","last_reissued_at":"2026-07-05T09:20:01.262398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:01.262398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomial-time classical algorithm for noisy quantum circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math-ph","math.IT","math.MP","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Chao Yin, Norman Y. Yao, Thomas Schuster, Xun Gao","submitted_at":"2024-07-17T17:48:39Z","abstract_excerpt":"We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the computational basis). Our approach is based upon the intuition that noise exponentially damps non-local correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by only keeping track of the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12768","kind":"arxiv","version":2},"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/2407.12768/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":"2407.12768","created_at":"2026-07-05T09:20:01.262464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12768v2","created_at":"2026-07-05T09:20:01.262464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12768","created_at":"2026-07-05T09:20:01.262464+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZOUU4GQESM6","created_at":"2026-07-05T09:20:01.262464+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZOUU4GQESM677SL","created_at":"2026-07-05T09:20:01.262464+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZOUU4GQ","created_at":"2026-07-05T09:20:01.262464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.09512","citing_title":"Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2507.21883","citing_title":"Sampling (noisy) quantum circuits through randomized rounding","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27074","citing_title":"Long-lived local quantum coherences from hydrodynamic large deviations","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19889","citing_title":"Quantum-to-Classical Computability Transition via Negative Markov Chains","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7","json":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7.json","graph_json":"https://pith.science/api/pith-number/4ZOUU4GQESM677SLI7MAPJKDO7/graph.json","events_json":"https://pith.science/api/pith-number/4ZOUU4GQESM677SLI7MAPJKDO7/events.json","paper":"https://pith.science/paper/4ZOUU4GQ"},"agent_actions":{"view_html":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7","download_json":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7.json","view_paper":"https://pith.science/paper/4ZOUU4GQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12768&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZOUU4GQESM677SLI7MAPJKDO7/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZOUU4GQESM677SLI7MAPJKDO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7/action/storage_attestation","attest_author":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7/action/author_attestation","sign_citation":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7/action/citation_signature","submit_replication":"https://pith.science/pith/4ZOUU4GQESM677SLI7MAPJKDO7/action/replication_record"}},"created_at":"2026-07-05T09:20:01.262464+00:00","updated_at":"2026-07-05T09:20:01.262464+00:00"}