{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YVXBP4CAGYNKM4WMVTFRAUTC2K","short_pith_number":"pith:YVXBP4CA","schema_version":"1.0","canonical_sha256":"c56e17f040361aa672ccaccb105262d29a14e450f792b5d6fcd3e7539006b1ea","source":{"kind":"arxiv","id":"2110.05708","version":2},"attestation_state":"computed","paper":{"title":"Nearly optimal quantum algorithm for generating the ground state of a free quantum field theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Dominic W. Berry, Gavin K. Brennen, Mohsen Bagherimehrab, Yuval R. Sanders","submitted_at":"2021-10-12T02:48:46Z","abstract_excerpt":"We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for ground-state generation, overcomes the ground-state-generation bottleneck of the prior approach and is optimal up to a polylogarithmic factor. Specifically, we establish two quantum algorithms -- Fourier-based and wavelet-based -- to generate the ground state of a free massive scalar bosonic QFT with gate complexity quasilinear in the number of discretized-QFT mode"},"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":"2110.05708","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-12T02:48:46Z","cross_cats_sorted":[],"title_canon_sha256":"29838e3f3a51aa037600bd5478e7e96d49aacea8b7649a359ec0ca103fb15ce3","abstract_canon_sha256":"615af6a7336ba5e4cb3bd71b5345a9f827719a8c5f21119b9855199bafc8b304"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:08.920878Z","signature_b64":"zuVYfSk9ZBfbiFlXKqwJCKvMxkg0ceLgLt9rl9yxwIkFfRvaoorcdrL/vKylu7hWZtIvv2jgrhsz1l9aEAFIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56e17f040361aa672ccaccb105262d29a14e450f792b5d6fcd3e7539006b1ea","last_reissued_at":"2026-07-05T04:36:08.920450Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:08.920450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly optimal quantum algorithm for generating the ground state of a free quantum field theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barry C. Sanders, Dominic W. Berry, Gavin K. Brennen, Mohsen Bagherimehrab, Yuval R. Sanders","submitted_at":"2021-10-12T02:48:46Z","abstract_excerpt":"We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for ground-state generation, overcomes the ground-state-generation bottleneck of the prior approach and is optimal up to a polylogarithmic factor. Specifically, we establish two quantum algorithms -- Fourier-based and wavelet-based -- to generate the ground state of a free massive scalar bosonic QFT with gate complexity quasilinear in the number of discretized-QFT mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05708","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/2110.05708/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":"2110.05708","created_at":"2026-07-05T04:36:08.920506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.05708v2","created_at":"2026-07-05T04:36:08.920506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05708","created_at":"2026-07-05T04:36:08.920506+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVXBP4CAGYNK","created_at":"2026-07-05T04:36:08.920506+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVXBP4CAGYNKM4WM","created_at":"2026-07-05T04:36:08.920506+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVXBP4CA","created_at":"2026-07-05T04:36:08.920506+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04861","citing_title":"Quantum algorithm for solving differential equations using SLAC derivatives","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04861","citing_title":"Quantum algorithm for solving differential equations using SLAC derivatives","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K","json":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K.json","graph_json":"https://pith.science/api/pith-number/YVXBP4CAGYNKM4WMVTFRAUTC2K/graph.json","events_json":"https://pith.science/api/pith-number/YVXBP4CAGYNKM4WMVTFRAUTC2K/events.json","paper":"https://pith.science/paper/YVXBP4CA"},"agent_actions":{"view_html":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K","download_json":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K.json","view_paper":"https://pith.science/paper/YVXBP4CA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.05708&json=true","fetch_graph":"https://pith.science/api/pith-number/YVXBP4CAGYNKM4WMVTFRAUTC2K/graph.json","fetch_events":"https://pith.science/api/pith-number/YVXBP4CAGYNKM4WMVTFRAUTC2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K/action/storage_attestation","attest_author":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K/action/author_attestation","sign_citation":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K/action/citation_signature","submit_replication":"https://pith.science/pith/YVXBP4CAGYNKM4WMVTFRAUTC2K/action/replication_record"}},"created_at":"2026-07-05T04:36:08.920506+00:00","updated_at":"2026-07-05T04:36:08.920506+00:00"}