{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N3X3OEPVM5QTWXUI3IFKMVP632","short_pith_number":"pith:N3X3OEPV","schema_version":"1.0","canonical_sha256":"6eefb711f567613b5e88da0aa655fede9e8d2ac7eea7387344cacc09cdbf2639","source":{"kind":"arxiv","id":"1706.03786","version":4},"attestation_state":"computed","paper":{"title":"Anticoncentration theorems for schemes showing a quantum speedup","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Dominik Hangleiter, Jens Eisert, Juan Bermejo-Vega, Martin Schwarz","submitted_at":"2017-06-12T18:01:12Z","abstract_excerpt":"One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantum computers, a state of affairs dubbed quantum speedup, or sometimes \"quantum computational supremacy\". The known schemes heavily rely on mathematical assumptions that are plausible but unproven, prominently results on anticoncentration of random prescriptions. In this work, we aim at closing the gap by proving two anticoncentration theorems and accompanying hardness results, one for circuit-based schemes, "},"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":"1706.03786","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-06-12T18:01:12Z","cross_cats_sorted":["cond-mat.stat-mech","math-ph","math.MP"],"title_canon_sha256":"83779c3b67e922da8c43a20dca2fe7a03613f3e0819b238a34abe418ad96cc1d","abstract_canon_sha256":"a05df0d7daf2670f0d323bd72aee2940f5ad57ffa720684c9ff4d4d8a65ad9a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:10.373118Z","signature_b64":"jbnbO8fkVJK/YJFGPA3bF3VwockEtJT86WAE00g6lGs/eAU0YFdJJo3iZPzjUZvCcDTySqyWKOvXdfyygs4kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eefb711f567613b5e88da0aa655fede9e8d2ac7eea7387344cacc09cdbf2639","last_reissued_at":"2026-05-18T00:15:10.372354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:10.372354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anticoncentration theorems for schemes showing a quantum speedup","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Dominik Hangleiter, Jens Eisert, Juan Bermejo-Vega, Martin Schwarz","submitted_at":"2017-06-12T18:01:12Z","abstract_excerpt":"One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantum computers, a state of affairs dubbed quantum speedup, or sometimes \"quantum computational supremacy\". The known schemes heavily rely on mathematical assumptions that are plausible but unproven, prominently results on anticoncentration of random prescriptions. In this work, we aim at closing the gap by proving two anticoncentration theorems and accompanying hardness results, one for circuit-based schemes, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03786","kind":"arxiv","version":4},"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":"1706.03786","created_at":"2026-05-18T00:15:10.372480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03786v4","created_at":"2026-05-18T00:15:10.372480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03786","created_at":"2026-05-18T00:15:10.372480+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3X3OEPVM5QT","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3X3OEPVM5QTWXUI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3X3OEPV","created_at":"2026-05-18T12:31:31.346846+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/N3X3OEPVM5QTWXUI3IFKMVP632","json":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632.json","graph_json":"https://pith.science/api/pith-number/N3X3OEPVM5QTWXUI3IFKMVP632/graph.json","events_json":"https://pith.science/api/pith-number/N3X3OEPVM5QTWXUI3IFKMVP632/events.json","paper":"https://pith.science/paper/N3X3OEPV"},"agent_actions":{"view_html":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632","download_json":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632.json","view_paper":"https://pith.science/paper/N3X3OEPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03786&json=true","fetch_graph":"https://pith.science/api/pith-number/N3X3OEPVM5QTWXUI3IFKMVP632/graph.json","fetch_events":"https://pith.science/api/pith-number/N3X3OEPVM5QTWXUI3IFKMVP632/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632/action/storage_attestation","attest_author":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632/action/author_attestation","sign_citation":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632/action/citation_signature","submit_replication":"https://pith.science/pith/N3X3OEPVM5QTWXUI3IFKMVP632/action/replication_record"}},"created_at":"2026-05-18T00:15:10.372480+00:00","updated_at":"2026-05-18T00:15:10.372480+00:00"}