{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BMYZSKMDF7EUWNIGF4YREZ3N45","short_pith_number":"pith:BMYZSKMD","schema_version":"1.0","canonical_sha256":"0b319929832fc94b35062f3112676de77cd0ad9d23903f51a1aa09e19ea7712f","source":{"kind":"arxiv","id":"2506.20658","version":2},"attestation_state":"computed","paper":{"title":"A Framework for Quantum Advantage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhinav Kandala, Alexandre Dauphin, Ali Javadi-Abhari, Antonio D. Corcoles, Antonio Mezzacapo, Borja Peropadre, Christa Zoufal, Christopher Porter, Constantin Dalyac, Jay M. Gambetta, John Watrous, Loic Henriet, Mourad Beji, Olivia Lanes, Sarah Sheldon","submitted_at":"2025-06-25T17:53:35Z","abstract_excerpt":"As quantum computing approaches the threshold where certain tasks demonstrably outpace their classical machines, the need for a precise, clear, consensus-driven definition of quantum advantage becomes essential. Rapid progress in the field has blurred this term across companies, architectures, and application domains. Here, we aim to articulate an operational definition for quantum advantage that is both platform-agnostic and empirically verifiable. Building on this framework, we highlight the algorithmic families most likely to achieve early advantage. Finally, we outline our vision for the n"},"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":"2506.20658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-25T17:53:35Z","cross_cats_sorted":[],"title_canon_sha256":"a0075bb0768352137e81a453ce9c72a98f97885d22f866a933699da10624eb41","abstract_canon_sha256":"4207c37810791206a37f5fb398968a19f24f09eaf454f2ac1f8bd59802bbbe8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:56.221914Z","signature_b64":"bM/uD57e/jDMddZNDGzP8cSb2hFLagV2TFDC6EKy7u5QxOUgKwc9v73npoyprWt41ByV59ebDjAyJT5NALLwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b319929832fc94b35062f3112676de77cd0ad9d23903f51a1aa09e19ea7712f","last_reissued_at":"2026-07-05T11:36:56.221355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:56.221355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Quantum Advantage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhinav Kandala, Alexandre Dauphin, Ali Javadi-Abhari, Antonio D. Corcoles, Antonio Mezzacapo, Borja Peropadre, Christa Zoufal, Christopher Porter, Constantin Dalyac, Jay M. Gambetta, John Watrous, Loic Henriet, Mourad Beji, Olivia Lanes, Sarah Sheldon","submitted_at":"2025-06-25T17:53:35Z","abstract_excerpt":"As quantum computing approaches the threshold where certain tasks demonstrably outpace their classical machines, the need for a precise, clear, consensus-driven definition of quantum advantage becomes essential. Rapid progress in the field has blurred this term across companies, architectures, and application domains. Here, we aim to articulate an operational definition for quantum advantage that is both platform-agnostic and empirically verifiable. Building on this framework, we highlight the algorithmic families most likely to achieve early advantage. Finally, we outline our vision for the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20658","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/2506.20658/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":"2506.20658","created_at":"2026-07-05T11:36:56.221418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20658v2","created_at":"2026-07-05T11:36:56.221418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20658","created_at":"2026-07-05T11:36:56.221418+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMYZSKMDF7EU","created_at":"2026-07-05T11:36:56.221418+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMYZSKMDF7EUWNIG","created_at":"2026-07-05T11:36:56.221418+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMYZSKMD","created_at":"2026-07-05T11:36:56.221418+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14325","citing_title":"Toward Covert Quantum Computing","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21276","citing_title":"Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10997","citing_title":"Reliable high-accuracy error mitigation for utility-scale quantum circuits","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2509.03952","citing_title":"Quantum-inspired dynamical models on quantum and classical annealers","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2510.06337","citing_title":"Recent quantum runtime (dis)advantages","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25162","citing_title":"Experimental Workflows for Combinatorial Optimization: Towards Quantum Advantage","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21908","citing_title":"Efficient Classical Simulation of Heuristic Peaked Quantum Circuits","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45","json":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45.json","graph_json":"https://pith.science/api/pith-number/BMYZSKMDF7EUWNIGF4YREZ3N45/graph.json","events_json":"https://pith.science/api/pith-number/BMYZSKMDF7EUWNIGF4YREZ3N45/events.json","paper":"https://pith.science/paper/BMYZSKMD"},"agent_actions":{"view_html":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45","download_json":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45.json","view_paper":"https://pith.science/paper/BMYZSKMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20658&json=true","fetch_graph":"https://pith.science/api/pith-number/BMYZSKMDF7EUWNIGF4YREZ3N45/graph.json","fetch_events":"https://pith.science/api/pith-number/BMYZSKMDF7EUWNIGF4YREZ3N45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45/action/storage_attestation","attest_author":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45/action/author_attestation","sign_citation":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45/action/citation_signature","submit_replication":"https://pith.science/pith/BMYZSKMDF7EUWNIGF4YREZ3N45/action/replication_record"}},"created_at":"2026-07-05T11:36:56.221418+00:00","updated_at":"2026-07-05T11:36:56.221418+00:00"}