{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:6NZ4AQUBVMCEVYWOUNEF3VMBC6","short_pith_number":"pith:6NZ4AQUB","schema_version":"1.0","canonical_sha256":"f373c04281ab044ae2cea3485dd5811784206f52f118e83bd8533c58b08a3c62","source":{"kind":"arxiv","id":"quant-ph/9703054","version":1},"attestation_state":"computed","paper":{"title":"Simulation of Many-Body Fermi Systems on a Universal Quantum Computer","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel S. Abrams (1), Massachusetts Institute of Technology), Massachusetts Institute of Technology (2) Department of Mechanical Engineering, Seth Lloyd (2) ((1) Department of Physics","submitted_at":"1997-03-28T20:03:47Z","abstract_excerpt":"We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail."},"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":"quant-ph/9703054","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-03-28T20:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"139d7eb32ec94e3ab35574f53c062f2b13c7b1b7f83efb87a294e600acdb3169","abstract_canon_sha256":"57271d6231a8722e764a49c8d222c3711e0d8742e769b92617466ca0a28ffde4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:06:28.882182Z","signature_b64":"7D9lXm+GbSHsq4WchiI94Q/Qt73VzJi1XZ9xLGlsDYtFl7wsg3Dy35yFga7tHH+6gU7jyRxyKBWstY6lUOUADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f373c04281ab044ae2cea3485dd5811784206f52f118e83bd8533c58b08a3c62","last_reissued_at":"2026-07-04T16:06:28.881757Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:06:28.881757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulation of Many-Body Fermi Systems on a Universal Quantum Computer","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel S. Abrams (1), Massachusetts Institute of Technology), Massachusetts Institute of Technology (2) Department of Mechanical Engineering, Seth Lloyd (2) ((1) Department of Physics","submitted_at":"1997-03-28T20:03:47Z","abstract_excerpt":"We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9703054","kind":"arxiv","version":1},"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/quant-ph/9703054/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":"quant-ph/9703054","created_at":"2026-07-04T16:06:28.881808+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9703054v1","created_at":"2026-07-04T16:06:28.881808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9703054","created_at":"2026-07-04T16:06:28.881808+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NZ4AQUBVMCE","created_at":"2026-07-04T16:06:28.881808+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NZ4AQUBVMCEVYWO","created_at":"2026-07-04T16:06:28.881808+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NZ4AQUB","created_at":"2026-07-04T16:06:28.881808+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6","json":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6.json","graph_json":"https://pith.science/api/pith-number/6NZ4AQUBVMCEVYWOUNEF3VMBC6/graph.json","events_json":"https://pith.science/api/pith-number/6NZ4AQUBVMCEVYWOUNEF3VMBC6/events.json","paper":"https://pith.science/paper/6NZ4AQUB"},"agent_actions":{"view_html":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6","download_json":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6.json","view_paper":"https://pith.science/paper/6NZ4AQUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9703054&json=true","fetch_graph":"https://pith.science/api/pith-number/6NZ4AQUBVMCEVYWOUNEF3VMBC6/graph.json","fetch_events":"https://pith.science/api/pith-number/6NZ4AQUBVMCEVYWOUNEF3VMBC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6/action/storage_attestation","attest_author":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6/action/author_attestation","sign_citation":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6/action/citation_signature","submit_replication":"https://pith.science/pith/6NZ4AQUBVMCEVYWOUNEF3VMBC6/action/replication_record"}},"created_at":"2026-07-04T16:06:28.881808+00:00","updated_at":"2026-07-04T16:06:28.881808+00:00"}