{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QAG3FFWYF6SLK3CMIA3CCP5LIE","short_pith_number":"pith:QAG3FFWY","schema_version":"1.0","canonical_sha256":"800db296d82fa4b56c4c4036213fab4113898e0bffc0d97fb5719f7ba2350c90","source":{"kind":"arxiv","id":"2011.03494","version":3},"attestation_state":"computed","paper":{"title":"Even more efficient quantum computations of chemistry through tensor hypercontraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Dominic W. Berry, Jarrod R. McClean, Joonho Lee, Nathan Wiebe, Ryan Babbush, William J. Huggins","submitted_at":"2020-11-06T18:03:29Z","abstract_excerpt":"We describe quantum circuits with only $\\widetilde{\\cal O}(N)$ Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of $N$ arbitrary (e.g., molecular) orbitals. With ${\\cal O}(\\lambda / \\epsilon)$ repetitions of these circuits one can use phase estimation to sample in the molecular eigenbasis, where $\\lambda$ is the 1-norm of Hamiltonian coefficients and $\\epsilon$ is the target precision. This is the lowest complexity that has been shown for quantum computations of chemistry within an arbitrary basis. Furthermore, up to logarithmic factors, this matche"},"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":"2011.03494","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-06T18:03:29Z","cross_cats_sorted":["physics.chem-ph"],"title_canon_sha256":"0389dff947f2c0fa8af83ac4dad5d9222eed86532931a9d6b033c41556b812b4","abstract_canon_sha256":"3282429712cbff5dfe5ea894be31f0c601d83a09af4f5ba58c4b2629b4112909"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:23.725535Z","signature_b64":"v3Ea/Abz50R/G4oH5bDlRoVshZVzuRq/oFTh9xAbKVN/m8TZ1YDSdLLnpaVoNhmXHS6jQPMNsLrcosqvRWW4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"800db296d82fa4b56c4c4036213fab4113898e0bffc0d97fb5719f7ba2350c90","last_reissued_at":"2026-07-05T03:41:23.725099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:23.725099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even more efficient quantum computations of chemistry through tensor hypercontraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Dominic W. Berry, Jarrod R. McClean, Joonho Lee, Nathan Wiebe, Ryan Babbush, William J. Huggins","submitted_at":"2020-11-06T18:03:29Z","abstract_excerpt":"We describe quantum circuits with only $\\widetilde{\\cal O}(N)$ Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of $N$ arbitrary (e.g., molecular) orbitals. With ${\\cal O}(\\lambda / \\epsilon)$ repetitions of these circuits one can use phase estimation to sample in the molecular eigenbasis, where $\\lambda$ is the 1-norm of Hamiltonian coefficients and $\\epsilon$ is the target precision. This is the lowest complexity that has been shown for quantum computations of chemistry within an arbitrary basis. Furthermore, up to logarithmic factors, this matche"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03494","kind":"arxiv","version":3},"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/2011.03494/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":"2011.03494","created_at":"2026-07-05T03:41:23.725151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.03494v3","created_at":"2026-07-05T03:41:23.725151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03494","created_at":"2026-07-05T03:41:23.725151+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAG3FFWYF6SL","created_at":"2026-07-05T03:41:23.725151+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAG3FFWYF6SLK3CM","created_at":"2026-07-05T03:41:23.725151+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAG3FFWY","created_at":"2026-07-05T03:41:23.725151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05479","citing_title":"Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE","json":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE.json","graph_json":"https://pith.science/api/pith-number/QAG3FFWYF6SLK3CMIA3CCP5LIE/graph.json","events_json":"https://pith.science/api/pith-number/QAG3FFWYF6SLK3CMIA3CCP5LIE/events.json","paper":"https://pith.science/paper/QAG3FFWY"},"agent_actions":{"view_html":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE","download_json":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE.json","view_paper":"https://pith.science/paper/QAG3FFWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.03494&json=true","fetch_graph":"https://pith.science/api/pith-number/QAG3FFWYF6SLK3CMIA3CCP5LIE/graph.json","fetch_events":"https://pith.science/api/pith-number/QAG3FFWYF6SLK3CMIA3CCP5LIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE/action/storage_attestation","attest_author":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE/action/author_attestation","sign_citation":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE/action/citation_signature","submit_replication":"https://pith.science/pith/QAG3FFWYF6SLK3CMIA3CCP5LIE/action/replication_record"}},"created_at":"2026-07-05T03:41:23.725151+00:00","updated_at":"2026-07-05T03:41:23.725151+00:00"}