{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XFVFTGRRVRZNW4IKXRPG4GG57E","short_pith_number":"pith:XFVFTGRR","schema_version":"1.0","canonical_sha256":"b96a599a31ac72db710abc5e6e18ddf922244cc1e3487bdab3ec167559c6deca","source":{"kind":"arxiv","id":"2005.11539","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant quantum speedup from constant depth quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Damian Markham, Joe Ghalbouni, Joseph Dgheim, Rawad Mezher","submitted_at":"2020-05-23T13:53:27Z","abstract_excerpt":"A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can be done efficiently quantumly, but are not possible efficiently classically, assuming strongly held conjectures in complexity theory. A feature dubbed quantum speedup. However, the effect of noise on these proposals is not well understood in general, and in certain cases it is known that simple noise can destroy the quantum speedup.\n  Here we develop a fault"},"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":"2005.11539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-23T13:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"4d1091ad4d374ab791edbbb102f69f32dda441f39378290d3c8fdb226685f845","abstract_canon_sha256":"3343426b98bd438d8600dd8957222a7ede818edaf00692428595668f73909f2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:10.625241Z","signature_b64":"XDIhAPrPL9y/ZnjXMA6MduKcMqq22yr1vsh5rNpFNrGYK4qnXj/4LcLnJnab0lJjiWrZUcA3MdKj5gwLcIviDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96a599a31ac72db710abc5e6e18ddf922244cc1e3487bdab3ec167559c6deca","last_reissued_at":"2026-07-05T01:37:10.624785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:10.624785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant quantum speedup from constant depth quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Damian Markham, Joe Ghalbouni, Joseph Dgheim, Rawad Mezher","submitted_at":"2020-05-23T13:53:27Z","abstract_excerpt":"A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can be done efficiently quantumly, but are not possible efficiently classically, assuming strongly held conjectures in complexity theory. A feature dubbed quantum speedup. However, the effect of noise on these proposals is not well understood in general, and in certain cases it is known that simple noise can destroy the quantum speedup.\n  Here we develop a fault"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.11539","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/2005.11539/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":"2005.11539","created_at":"2026-07-05T01:37:10.624849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.11539v2","created_at":"2026-07-05T01:37:10.624849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.11539","created_at":"2026-07-05T01:37:10.624849+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFVFTGRRVRZN","created_at":"2026-07-05T01:37:10.624849+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFVFTGRRVRZNW4IK","created_at":"2026-07-05T01:37:10.624849+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFVFTGRR","created_at":"2026-07-05T01:37:10.624849+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E","json":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E.json","graph_json":"https://pith.science/api/pith-number/XFVFTGRRVRZNW4IKXRPG4GG57E/graph.json","events_json":"https://pith.science/api/pith-number/XFVFTGRRVRZNW4IKXRPG4GG57E/events.json","paper":"https://pith.science/paper/XFVFTGRR"},"agent_actions":{"view_html":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E","download_json":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E.json","view_paper":"https://pith.science/paper/XFVFTGRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.11539&json=true","fetch_graph":"https://pith.science/api/pith-number/XFVFTGRRVRZNW4IKXRPG4GG57E/graph.json","fetch_events":"https://pith.science/api/pith-number/XFVFTGRRVRZNW4IKXRPG4GG57E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E/action/storage_attestation","attest_author":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E/action/author_attestation","sign_citation":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E/action/citation_signature","submit_replication":"https://pith.science/pith/XFVFTGRRVRZNW4IKXRPG4GG57E/action/replication_record"}},"created_at":"2026-07-05T01:37:10.624849+00:00","updated_at":"2026-07-05T01:37:10.624849+00:00"}