{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YVNGJLZDUQSLQ6QETE74POJ7EU","short_pith_number":"pith:YVNGJLZD","schema_version":"1.0","canonical_sha256":"c55a64af23a424b87a04993fc7b93f25129938d948b23f2453658b5569e4f6a2","source":{"kind":"arxiv","id":"2105.02859","version":5},"attestation_state":"computed","paper":{"title":"A Grand Unification of Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew K. Tan, Isaac L. Chuang, John M. Martyn, Zane M. Rossi","submitted_at":"2021-05-06T17:46:33Z","abstract_excerpt":"Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, which appear as subroutines for large families of composite quantum algorithms. A number of these quantum algorithms were recently tied together by a novel technique known as the quantum singular value transformation (QSVT), which enables one to perform a polynomial transformation of the singular values of a linear operator embedded in a unitary matr"},"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":"2105.02859","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-05-06T17:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"3282174a289cb0f60cbb32a5d5d2d253aba665bf2f6d83a615b6a8d948705b95","abstract_canon_sha256":"3c21b895fc385502f63fa6a4a25e289cf28fdb833946d62e737ffe89b9d77866"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:58.995981Z","signature_b64":"b3p4MheVT59vI1Oa0wlsN3exFXRcqOCWV5c5+BxHfZ1goCPmxpTofV4w0DtnDEpnKDXi7Vr2+rtPrOMHOvkTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c55a64af23a424b87a04993fc7b93f25129938d948b23f2453658b5569e4f6a2","last_reissued_at":"2026-07-05T03:39:58.995512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:58.995512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Grand Unification of Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew K. Tan, Isaac L. Chuang, John M. Martyn, Zane M. Rossi","submitted_at":"2021-05-06T17:46:33Z","abstract_excerpt":"Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, which appear as subroutines for large families of composite quantum algorithms. A number of these quantum algorithms were recently tied together by a novel technique known as the quantum singular value transformation (QSVT), which enables one to perform a polynomial transformation of the singular values of a linear operator embedded in a unitary matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.02859","kind":"arxiv","version":5},"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/2105.02859/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":"2105.02859","created_at":"2026-07-05T03:39:58.995568+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.02859v5","created_at":"2026-07-05T03:39:58.995568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.02859","created_at":"2026-07-05T03:39:58.995568+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVNGJLZDUQSL","created_at":"2026-07-05T03:39:58.995568+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVNGJLZDUQSLQ6QE","created_at":"2026-07-05T03:39:58.995568+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVNGJLZD","created_at":"2026-07-05T03:39:58.995568+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.07691","citing_title":"Faster quantum linear system solver beyond the condition number","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2607.05873","citing_title":"Fixing Divergence in Carleman Linearization via Analytical Continuation","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29687","citing_title":"A Machine-Verified Proof of a Quantum-Optimization Conjecture","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2410.02332","citing_title":"Polynomial time constructive decision algorithm for multivariable quantum signal processing","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10768","citing_title":"Unitaria: Quantum Linear Algebra via Block Encodings","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU","json":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU.json","graph_json":"https://pith.science/api/pith-number/YVNGJLZDUQSLQ6QETE74POJ7EU/graph.json","events_json":"https://pith.science/api/pith-number/YVNGJLZDUQSLQ6QETE74POJ7EU/events.json","paper":"https://pith.science/paper/YVNGJLZD"},"agent_actions":{"view_html":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU","download_json":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU.json","view_paper":"https://pith.science/paper/YVNGJLZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.02859&json=true","fetch_graph":"https://pith.science/api/pith-number/YVNGJLZDUQSLQ6QETE74POJ7EU/graph.json","fetch_events":"https://pith.science/api/pith-number/YVNGJLZDUQSLQ6QETE74POJ7EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU/action/storage_attestation","attest_author":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU/action/author_attestation","sign_citation":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU/action/citation_signature","submit_replication":"https://pith.science/pith/YVNGJLZDUQSLQ6QETE74POJ7EU/action/replication_record"}},"created_at":"2026-07-05T03:39:58.995568+00:00","updated_at":"2026-07-05T03:39:58.995568+00:00"}