{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:673VOAEBYADMGW2GLLN42XG5OJ","short_pith_number":"pith:673VOAEB","schema_version":"1.0","canonical_sha256":"f7f7570081c006c35b465adbcd5cdd7241d20059f3948fc61ad43b218d36b01f","source":{"kind":"arxiv","id":"2011.04149","version":2},"attestation_state":"computed","paper":{"title":"Focus beyond quadratic speedups for error-corrected quantum advantage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Hartmut Neven, Jarrod McClean, Michael Newman, Ryan Babbush, Sergio Boixo","submitted_at":"2020-11-09T02:12:51Z","abstract_excerpt":"In this perspective, we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algorithm with only a small polynomial speedup over the best classical alternative. The challenge is that the computation must finish within a reasonable amount of time while being difficult enough that the small quantum scaling advantage would compensate for the large constant factor overheads associated with error-correction. We compute several examples of such runtimes using state-of-the-art surface code constructions "},"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":"2011.04149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-09T02:12:51Z","cross_cats_sorted":[],"title_canon_sha256":"10c0d13841dd9629fa970865488b7dccd209ec3d404e7b8afffbb2e31ce2ba41","abstract_canon_sha256":"ac0394173d5776aa3ba0515ace0ba54d61f6d859688767b9d047a13c973421d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:10.699005Z","signature_b64":"uOiLcK7708fQc02x6ALY273Pe1ssAKMzMo+98yyYR/r0CVfhtGAOnTcTwGaTv+7/OYbS6e4eJnJw+Xf9cBjtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f7570081c006c35b465adbcd5cdd7241d20059f3948fc61ad43b218d36b01f","last_reissued_at":"2026-07-05T02:29:10.698432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:10.698432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Focus beyond quadratic speedups for error-corrected quantum advantage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Hartmut Neven, Jarrod McClean, Michael Newman, Ryan Babbush, Sergio Boixo","submitted_at":"2020-11-09T02:12:51Z","abstract_excerpt":"In this perspective, we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algorithm with only a small polynomial speedup over the best classical alternative. The challenge is that the computation must finish within a reasonable amount of time while being difficult enough that the small quantum scaling advantage would compensate for the large constant factor overheads associated with error-correction. We compute several examples of such runtimes using state-of-the-art surface code constructions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04149","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/2011.04149/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":"2011.04149","created_at":"2026-07-05T02:29:10.698508+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04149v2","created_at":"2026-07-05T02:29:10.698508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04149","created_at":"2026-07-05T02:29:10.698508+00:00"},{"alias_kind":"pith_short_12","alias_value":"673VOAEBYADM","created_at":"2026-07-05T02:29:10.698508+00:00"},{"alias_kind":"pith_short_16","alias_value":"673VOAEBYADMGW2G","created_at":"2026-07-05T02:29:10.698508+00:00"},{"alias_kind":"pith_short_8","alias_value":"673VOAEB","created_at":"2026-07-05T02:29:10.698508+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ","json":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ.json","graph_json":"https://pith.science/api/pith-number/673VOAEBYADMGW2GLLN42XG5OJ/graph.json","events_json":"https://pith.science/api/pith-number/673VOAEBYADMGW2GLLN42XG5OJ/events.json","paper":"https://pith.science/paper/673VOAEB"},"agent_actions":{"view_html":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ","download_json":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ.json","view_paper":"https://pith.science/paper/673VOAEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04149&json=true","fetch_graph":"https://pith.science/api/pith-number/673VOAEBYADMGW2GLLN42XG5OJ/graph.json","fetch_events":"https://pith.science/api/pith-number/673VOAEBYADMGW2GLLN42XG5OJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ/action/storage_attestation","attest_author":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ/action/author_attestation","sign_citation":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ/action/citation_signature","submit_replication":"https://pith.science/pith/673VOAEBYADMGW2GLLN42XG5OJ/action/replication_record"}},"created_at":"2026-07-05T02:29:10.698508+00:00","updated_at":"2026-07-05T02:29:10.698508+00:00"}