{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CBPHLAHT5I2GXANGL6AE6ZVLV4","short_pith_number":"pith:CBPHLAHT","schema_version":"1.0","canonical_sha256":"105e7580f3ea346b81a65f804f66abaf38ca111abfb3d44e9cc2da18e5c64eae","source":{"kind":"arxiv","id":"2510.19928","version":2},"attestation_state":"computed","paper":{"title":"Mind the gaps: The fraught road to quantum advantage","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Jens Eisert, John Preskill","submitted_at":"2025-10-22T18:00:19Z","abstract_excerpt":"Quantum computing is advancing rapidly, yet substantial gaps separate today's noisy intermediate-scale quantum (NISQ) devices from tomorrow's fault-tolerant application-scale quantum (FASQ) machines. We identify four related hurdles along the road ahead: (i) from error mitigation to active error detection and correction, (ii) from rudimentary error correction to scalable fault tolerance, (iii) from early heuristics to mature, verifiable algorithms, and (iv) from exploratory simulators to credible advantage in quantum simulation. Targeting these transitions will accelerate progress toward broad"},"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":"2510.19928","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-22T18:00:19Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"6db19ea3ecaebff148b4964de0f7fee3cd90c271ba9183ccc6a005161e82533a","abstract_canon_sha256":"0c6d260171b341e335861998e24b2e651fac5d5c1e30a69548d8998a74981bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:30.067120Z","signature_b64":"FuCEa1Xzm8UI6Q5GtGaTJ3DPysfNjbSlj1YrBc38sUs4Wtm4C2lR6tg7BubE+LfYfsQfDttiuMQT9g0/KS2fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"105e7580f3ea346b81a65f804f66abaf38ca111abfb3d44e9cc2da18e5c64eae","last_reissued_at":"2026-05-18T01:46:30.063800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:30.063800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mind the gaps: The fraught road to quantum advantage","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Jens Eisert, John Preskill","submitted_at":"2025-10-22T18:00:19Z","abstract_excerpt":"Quantum computing is advancing rapidly, yet substantial gaps separate today's noisy intermediate-scale quantum (NISQ) devices from tomorrow's fault-tolerant application-scale quantum (FASQ) machines. We identify four related hurdles along the road ahead: (i) from error mitigation to active error detection and correction, (ii) from rudimentary error correction to scalable fault tolerance, (iii) from early heuristics to mature, verifiable algorithms, and (iv) from exploratory simulators to credible advantage in quantum simulation. Targeting these transitions will accelerate progress toward broad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.19928","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":"2510.19928","created_at":"2026-05-18T01:46:30.063993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.19928v2","created_at":"2026-05-18T01:46:30.063993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.19928","created_at":"2026-05-18T01:46:30.063993+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBPHLAHT5I2G","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBPHLAHT5I2GXANG","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBPHLAHT","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":16,"internal_anchor_count":16,"sample":[{"citing_arxiv_id":"2603.24237","citing_title":"Correlated Atom Loss as a Resource for Quantum Error Correction","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2603.25582","citing_title":"A unified quantum computing quantum Monte Carlo framework through structured state preparation","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03445","citing_title":"Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03564","citing_title":"Quantum Vault: Secure Token Authentication Without Classical State Information Benchmarked on IBMQ","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25424","citing_title":"A graph-aware bounded distance decoder for all stabilizer codes","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25631","citing_title":"Local tensor-train surrogates for quantum learning models","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24973","citing_title":"Approximate Sparse State Preparation with the Grover-Rudolph Algorithm","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01367","citing_title":"From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2604.12576","citing_title":"Detecting entanglement from few partial transpose moments and their decay via weight enumerators","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05627","citing_title":"Loss-aware state space geometry for quantum variational algorithms","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05036","citing_title":"Efficient simulation of noisy IQP circuits with amplitude-damping noise","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2604.13812","citing_title":"AlphaCNOT: Learning CNOT Minimization with Model-Based Planning","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15626","citing_title":"Bridge the Gap between Classical and Quantum Neural Networks with Residual Connections","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19319","citing_title":"An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics","ref_index":97,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02389","citing_title":"Rethinking How to Act: Action-Space Engineering for Reinforcement Learning-Based Circuit Routing in Distributed Quantum Systems","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02565","citing_title":"Sample-Based Quantum Diagonalization with Amplitude Amplification","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4","json":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4.json","graph_json":"https://pith.science/api/pith-number/CBPHLAHT5I2GXANGL6AE6ZVLV4/graph.json","events_json":"https://pith.science/api/pith-number/CBPHLAHT5I2GXANGL6AE6ZVLV4/events.json","paper":"https://pith.science/paper/CBPHLAHT"},"agent_actions":{"view_html":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4","download_json":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4.json","view_paper":"https://pith.science/paper/CBPHLAHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.19928&json=true","fetch_graph":"https://pith.science/api/pith-number/CBPHLAHT5I2GXANGL6AE6ZVLV4/graph.json","fetch_events":"https://pith.science/api/pith-number/CBPHLAHT5I2GXANGL6AE6ZVLV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4/action/storage_attestation","attest_author":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4/action/author_attestation","sign_citation":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4/action/citation_signature","submit_replication":"https://pith.science/pith/CBPHLAHT5I2GXANGL6AE6ZVLV4/action/replication_record"}},"created_at":"2026-05-18T01:46:30.063993+00:00","updated_at":"2026-05-18T01:46:30.063993+00:00"}