{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CKKHMQFRGC2ZQ6YOHPZFG5DYWP","short_pith_number":"pith:CKKHMQFR","schema_version":"1.0","canonical_sha256":"12947640b130b5987b0e3bf2537478b3dd03d2d175070335c66ab8b7ddc1a81a","source":{"kind":"arxiv","id":"2101.12223","version":3},"attestation_state":"computed","paper":{"title":"Fast estimation of outcome probabilities for quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hakop Pashayan, Kamil Korzekwa, Oliver Reardon-Smith, Stephen D. Bartlett","submitted_at":"2021-01-28T19:00:04Z","abstract_excerpt":"We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each other by performing best in different parameter regimes. The $\\tt{Estimate}$ algorithm produces an additive precision estimate of the Born rule probability of a chosen measurement outcome with the only source of run-time inefficiency being a linear dependence on the stabilizer extent (which scales like $\\approx 1.17^t$ for $T$ gates). Our algorithm is state"},"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":"2101.12223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-01-28T19:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"67ac5d6b9beae953868fc19b11c2d6ffd728a8164b11f6b0e0169258514ca0ba","abstract_canon_sha256":"caeaafc65c99da65a95024f368f33b4d78c98fc5284dae49fc1eabb0bd69af0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:25.703170Z","signature_b64":"93rH7r86gZ4d7jYSQCvWfdtnoeo53D7yDTXBZmzP5SuGj8huhz/fUSbYtXS7jzpysVaf0s5rJqLckS9qEHzSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12947640b130b5987b0e3bf2537478b3dd03d2d175070335c66ab8b7ddc1a81a","last_reissued_at":"2026-07-05T04:34:25.702773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:25.702773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast estimation of outcome probabilities for quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hakop Pashayan, Kamil Korzekwa, Oliver Reardon-Smith, Stephen D. Bartlett","submitted_at":"2021-01-28T19:00:04Z","abstract_excerpt":"We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each other by performing best in different parameter regimes. The $\\tt{Estimate}$ algorithm produces an additive precision estimate of the Born rule probability of a chosen measurement outcome with the only source of run-time inefficiency being a linear dependence on the stabilizer extent (which scales like $\\approx 1.17^t$ for $T$ gates). Our algorithm is state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.12223","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/2101.12223/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":"2101.12223","created_at":"2026-07-05T04:34:25.702835+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.12223v3","created_at":"2026-07-05T04:34:25.702835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.12223","created_at":"2026-07-05T04:34:25.702835+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKKHMQFRGC2Z","created_at":"2026-07-05T04:34:25.702835+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKKHMQFRGC2ZQ6YO","created_at":"2026-07-05T04:34:25.702835+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKKHMQFR","created_at":"2026-07-05T04:34:25.702835+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04033","citing_title":"Phase space tableau simulation for quantum computation","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP","json":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP.json","graph_json":"https://pith.science/api/pith-number/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/graph.json","events_json":"https://pith.science/api/pith-number/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/events.json","paper":"https://pith.science/paper/CKKHMQFR"},"agent_actions":{"view_html":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP","download_json":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP.json","view_paper":"https://pith.science/paper/CKKHMQFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.12223&json=true","fetch_graph":"https://pith.science/api/pith-number/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/graph.json","fetch_events":"https://pith.science/api/pith-number/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/action/storage_attestation","attest_author":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/action/author_attestation","sign_citation":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/action/citation_signature","submit_replication":"https://pith.science/pith/CKKHMQFRGC2ZQ6YOHPZFG5DYWP/action/replication_record"}},"created_at":"2026-07-05T04:34:25.702835+00:00","updated_at":"2026-07-05T04:34:25.702835+00:00"}