{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7D673TYQDOBHT2566DSRW6U5VZ","short_pith_number":"pith:7D673TYQ","schema_version":"1.0","canonical_sha256":"f8fdfdcf101b8279ebbef0e51b7a9dae649a8507e4140a764a42172f32b08140","source":{"kind":"arxiv","id":"2310.03011","version":2},"attestation_state":"computed","paper":{"title":"Quantum algorithms: A survey of applications and end-to-end complexities","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Alexander M. Dalzell, Andr\\'as Gily\\'en, Chi-Fang Chen, Connor T. Hann, Emil T. Khabiboulline, Fernando G. S. L. Brand\\~ao, Grant Salton, Mario Berta, Michael J. Kastoryano, Przemyslaw Bienias, Sam McArdle, Samson Wang","submitted_at":"2023-10-04T17:53:55Z","abstract_excerpt":"The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically combine multiple quantum algorithmic primitives into an overall quantum algorithm, which must then incorporate the methods of quantum error correction and fault tolerance to be implemented correctly on quantum hardware. As such, it can be difficult to assess how much a particular application benefits from quantum computing, as the various approaches are often s"},"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":"2310.03011","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-10-04T17:53:55Z","cross_cats_sorted":[],"title_canon_sha256":"cce6e9fa9374a2c7f4e19cd8919349c76d7af7ed257e6a4e6e197fdc0de43ca0","abstract_canon_sha256":"207fb3cd12677272121c86423ce9b3b5ad04fc69c515e16a04196a4a1ec313e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:19.457279Z","signature_b64":"pXiEFyDlpMDZKOXA5IntDsej7pTLG4E6eMaQbD5PxHnY6d0mPUbZyuf/6UrcF2KeKJdSav9G7teEx3bwpuEQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8fdfdcf101b8279ebbef0e51b7a9dae649a8507e4140a764a42172f32b08140","last_reissued_at":"2026-07-05T11:48:19.456817Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:19.456817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithms: A survey of applications and end-to-end complexities","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Alexander M. Dalzell, Andr\\'as Gily\\'en, Chi-Fang Chen, Connor T. Hann, Emil T. Khabiboulline, Fernando G. S. L. Brand\\~ao, Grant Salton, Mario Berta, Michael J. Kastoryano, Przemyslaw Bienias, Sam McArdle, Samson Wang","submitted_at":"2023-10-04T17:53:55Z","abstract_excerpt":"The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically combine multiple quantum algorithmic primitives into an overall quantum algorithm, which must then incorporate the methods of quantum error correction and fault tolerance to be implemented correctly on quantum hardware. As such, it can be difficult to assess how much a particular application benefits from quantum computing, as the various approaches are often s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03011","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/2310.03011/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":"2310.03011","created_at":"2026-07-05T11:48:19.456871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.03011v2","created_at":"2026-07-05T11:48:19.456871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03011","created_at":"2026-07-05T11:48:19.456871+00:00"},{"alias_kind":"pith_short_12","alias_value":"7D673TYQDOBH","created_at":"2026-07-05T11:48:19.456871+00:00"},{"alias_kind":"pith_short_16","alias_value":"7D673TYQDOBHT256","created_at":"2026-07-05T11:48:19.456871+00:00"},{"alias_kind":"pith_short_8","alias_value":"7D673TYQ","created_at":"2026-07-05T11:48:19.456871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26162","citing_title":"Dissipative Quantum Multiplicative Weights with Sampling Feedback: A Classically Hard Primitive Realized via Engineered Open-System Dynamics","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.17158","citing_title":"Fermionic Hamiltonian engineering with local control","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00581","citing_title":"Analog photonic simulator for large-scale transport","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20173","citing_title":"Qiskit Code Migration with LLMs","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04435","citing_title":"QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2502.03962","citing_title":"Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2509.05206","citing_title":"Adiabatic preparation of thermal states and entropy-noise relation on noisy quantum computers","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2510.05221","citing_title":"Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04600","citing_title":"Phase-Stable Hologram Updates for Large-Scale Neutral-Atom Array Reconfiguration","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18533","citing_title":"Hamiltonian dynamics from pure dissipation","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ","json":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ.json","graph_json":"https://pith.science/api/pith-number/7D673TYQDOBHT2566DSRW6U5VZ/graph.json","events_json":"https://pith.science/api/pith-number/7D673TYQDOBHT2566DSRW6U5VZ/events.json","paper":"https://pith.science/paper/7D673TYQ"},"agent_actions":{"view_html":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ","download_json":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ.json","view_paper":"https://pith.science/paper/7D673TYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.03011&json=true","fetch_graph":"https://pith.science/api/pith-number/7D673TYQDOBHT2566DSRW6U5VZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7D673TYQDOBHT2566DSRW6U5VZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ/action/storage_attestation","attest_author":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ/action/author_attestation","sign_citation":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ/action/citation_signature","submit_replication":"https://pith.science/pith/7D673TYQDOBHT2566DSRW6U5VZ/action/replication_record"}},"created_at":"2026-07-05T11:48:19.456871+00:00","updated_at":"2026-07-05T11:48:19.456871+00:00"}