{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5IANDOZZR3JGJ5AV7PSSTMVUZ3","short_pith_number":"pith:5IANDOZZ","schema_version":"1.0","canonical_sha256":"ea00d1bb398ed264f415fbe529b2b4ceed2b5a55a922adbfe5aa30d389945471","source":{"kind":"arxiv","id":"1010.3654","version":2},"attestation_state":"computed","paper":{"title":"Exponential Quantum Speed-ups are Generic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fernando G.S.L. Brandao, Michal Horodecki","submitted_at":"2010-10-18T17:20:31Z","abstract_excerpt":"A central problem in quantum computation is to understand which quantum circuits are useful for exponential speed-ups over classical computation. We address this question in the setting of query complexity and show that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect.\n  We prove the result in two steps. In the first, we show that almost any element of an approximate u"},"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":"1010.3654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-10-18T17:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"73de7de5286915ba34f1337fde284f92556ad8a0336372ab6ee0e9980d69513b","abstract_canon_sha256":"db40186808295462d6443cb76737ad1d77d03de6252c7e043accf73e111ab920"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:52.511276Z","signature_b64":"nXaEwXeusuWQTLB8uHyo6qS47UF2RvhRnoLqOZl0Ye0stsRnI/MtHkpJSm/Oe/OjU9RCA80hMapnWRcgq4kfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea00d1bb398ed264f415fbe529b2b4ceed2b5a55a922adbfe5aa30d389945471","last_reissued_at":"2026-05-18T03:27:52.510511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:52.510511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Quantum Speed-ups are Generic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fernando G.S.L. Brandao, Michal Horodecki","submitted_at":"2010-10-18T17:20:31Z","abstract_excerpt":"A central problem in quantum computation is to understand which quantum circuits are useful for exponential speed-ups over classical computation. We address this question in the setting of query complexity and show that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect.\n  We prove the result in two steps. In the first, we show that almost any element of an approximate u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3654","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":""},"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":"1010.3654","created_at":"2026-05-18T03:27:52.510634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3654v2","created_at":"2026-05-18T03:27:52.510634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3654","created_at":"2026-05-18T03:27:52.510634+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IANDOZZR3JG","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IANDOZZR3JGJ5AV","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IANDOZZ","created_at":"2026-05-18T12:26:04.259169+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/5IANDOZZR3JGJ5AV7PSSTMVUZ3","json":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3.json","graph_json":"https://pith.science/api/pith-number/5IANDOZZR3JGJ5AV7PSSTMVUZ3/graph.json","events_json":"https://pith.science/api/pith-number/5IANDOZZR3JGJ5AV7PSSTMVUZ3/events.json","paper":"https://pith.science/paper/5IANDOZZ"},"agent_actions":{"view_html":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3","download_json":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3.json","view_paper":"https://pith.science/paper/5IANDOZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3654&json=true","fetch_graph":"https://pith.science/api/pith-number/5IANDOZZR3JGJ5AV7PSSTMVUZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/5IANDOZZR3JGJ5AV7PSSTMVUZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3/action/storage_attestation","attest_author":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3/action/author_attestation","sign_citation":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3/action/citation_signature","submit_replication":"https://pith.science/pith/5IANDOZZR3JGJ5AV7PSSTMVUZ3/action/replication_record"}},"created_at":"2026-05-18T03:27:52.510634+00:00","updated_at":"2026-05-18T03:27:52.510634+00:00"}