{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CHKRJYFNT6JPPAFQKY6NCKXTCJ","short_pith_number":"pith:CHKRJYFN","schema_version":"1.0","canonical_sha256":"11d514e0ad9f92f780b0563cd12af31245fa8ec2694b43038d75f913085d2b18","source":{"kind":"arxiv","id":"2012.09238","version":4},"attestation_state":"computed","paper":{"title":"Early fault-tolerant simulations of the Hubbard model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl T. Campbell","submitted_at":"2020-12-16T20:07:54Z","abstract_excerpt":"Simulation of the Hubbard model is a leading candidate for the first useful applications of a fault-tolerant quantum computer. A recent study of quantum algorithms for early simulations of the Hubbard model [Kivlichan \\textit{et al.} Quantum 4 296 (2019)] found that the lowest resource costs were achieved by split-operator Trotterization combined with the fast-fermionic Fourier transform (FFFT) on an $L \\times L$ lattice with length $L=2^k$. On lattices with length $L \\neq 2^k$, Givens rotations can be used instead of the FFFT but lead to considerably higher resource costs. We present a new an"},"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":"2012.09238","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-16T20:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"7bad13b029839844cf2bec143081ad297a66cff5a839c5224cbc370ace32485f","abstract_canon_sha256":"283dbbbcc21525b30301647ccdec50311eb9e9579c2db01e394a7a23b3d4ba66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:43.243728Z","signature_b64":"yQ/Z8cAPZVT5Gm0R1fdEE588YFOR55kZphDdNBhFMCsebwQVoOzBP6V4eCi2Pcc0QbTIj/rjznePMoXQ6Ay3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11d514e0ad9f92f780b0563cd12af31245fa8ec2694b43038d75f913085d2b18","last_reissued_at":"2026-07-05T08:47:43.243296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:43.243296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Early fault-tolerant simulations of the Hubbard model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl T. Campbell","submitted_at":"2020-12-16T20:07:54Z","abstract_excerpt":"Simulation of the Hubbard model is a leading candidate for the first useful applications of a fault-tolerant quantum computer. A recent study of quantum algorithms for early simulations of the Hubbard model [Kivlichan \\textit{et al.} Quantum 4 296 (2019)] found that the lowest resource costs were achieved by split-operator Trotterization combined with the fast-fermionic Fourier transform (FFFT) on an $L \\times L$ lattice with length $L=2^k$. On lattices with length $L \\neq 2^k$, Givens rotations can be used instead of the FFFT but lead to considerably higher resource costs. We present a new an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09238","kind":"arxiv","version":4},"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/2012.09238/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":"2012.09238","created_at":"2026-07-05T08:47:43.243374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.09238v4","created_at":"2026-07-05T08:47:43.243374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09238","created_at":"2026-07-05T08:47:43.243374+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHKRJYFNT6JP","created_at":"2026-07-05T08:47:43.243374+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHKRJYFNT6JPPAFQ","created_at":"2026-07-05T08:47:43.243374+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHKRJYFN","created_at":"2026-07-05T08:47:43.243374+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2411.10406","citing_title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ","json":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ.json","graph_json":"https://pith.science/api/pith-number/CHKRJYFNT6JPPAFQKY6NCKXTCJ/graph.json","events_json":"https://pith.science/api/pith-number/CHKRJYFNT6JPPAFQKY6NCKXTCJ/events.json","paper":"https://pith.science/paper/CHKRJYFN"},"agent_actions":{"view_html":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ","download_json":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ.json","view_paper":"https://pith.science/paper/CHKRJYFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.09238&json=true","fetch_graph":"https://pith.science/api/pith-number/CHKRJYFNT6JPPAFQKY6NCKXTCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CHKRJYFNT6JPPAFQKY6NCKXTCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ/action/storage_attestation","attest_author":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ/action/author_attestation","sign_citation":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ/action/citation_signature","submit_replication":"https://pith.science/pith/CHKRJYFNT6JPPAFQKY6NCKXTCJ/action/replication_record"}},"created_at":"2026-07-05T08:47:43.243374+00:00","updated_at":"2026-07-05T08:47:43.243374+00:00"}