{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:RUTRM6KJBI7KSEJOWQANSI7MAD","short_pith_number":"pith:RUTRM6KJ","schema_version":"1.0","canonical_sha256":"8d271679490a3ea9112eb400d923ec00d2f065a0495fd3c62f0b682ca4d9e566","source":{"kind":"arxiv","id":"cond-mat/0012334","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Fermionic Simulations","license":"","headline":"","cross_cats":["hep-th","quant-ph"],"primary_cat":"cond-mat","authors_text":"E. Knill, G. Ortiz, J.E. Gubernatis, R. Laflamme (Los Alamos National Laboratory)","submitted_at":"2000-12-18T16:48:23Z","abstract_excerpt":"We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on s"},"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":"cond-mat/0012334","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat","submitted_at":"2000-12-18T16:48:23Z","cross_cats_sorted":["hep-th","quant-ph"],"title_canon_sha256":"eaa59dbb548b724db435e1dbedb5dd611abca817e5cd38f25420da50d0dcd796","abstract_canon_sha256":"4a08aa4f58b0f13a0b6a810ab351b6238a70baff6a1f502eb71ef7f6693322d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:37:22.598996Z","signature_b64":"dz2It50LgQK5e/M5BQTkGxnWbFu6c516ycB5QCUA7n27nv1jk3y4lBKgb8gvJYHzOqDQWUOVdpMxmOgzPqn3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d271679490a3ea9112eb400d923ec00d2f065a0495fd3c62f0b682ca4d9e566","last_reissued_at":"2026-07-04T15:37:22.598627Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:37:22.598627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Fermionic Simulations","license":"","headline":"","cross_cats":["hep-th","quant-ph"],"primary_cat":"cond-mat","authors_text":"E. Knill, G. Ortiz, J.E. Gubernatis, R. Laflamme (Los Alamos National Laboratory)","submitted_at":"2000-12-18T16:48:23Z","abstract_excerpt":"We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0012334","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/cond-mat/0012334/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":"cond-mat/0012334","created_at":"2026-07-04T15:37:22.598691+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0012334v1","created_at":"2026-07-04T15:37:22.598691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0012334","created_at":"2026-07-04T15:37:22.598691+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUTRM6KJBI7K","created_at":"2026-07-04T15:37:22.598691+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUTRM6KJBI7KSEJO","created_at":"2026-07-04T15:37:22.598691+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUTRM6KJ","created_at":"2026-07-04T15:37:22.598691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"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":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD","json":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD.json","graph_json":"https://pith.science/api/pith-number/RUTRM6KJBI7KSEJOWQANSI7MAD/graph.json","events_json":"https://pith.science/api/pith-number/RUTRM6KJBI7KSEJOWQANSI7MAD/events.json","paper":"https://pith.science/paper/RUTRM6KJ"},"agent_actions":{"view_html":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD","download_json":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD.json","view_paper":"https://pith.science/paper/RUTRM6KJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0012334&json=true","fetch_graph":"https://pith.science/api/pith-number/RUTRM6KJBI7KSEJOWQANSI7MAD/graph.json","fetch_events":"https://pith.science/api/pith-number/RUTRM6KJBI7KSEJOWQANSI7MAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD/action/storage_attestation","attest_author":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD/action/author_attestation","sign_citation":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD/action/citation_signature","submit_replication":"https://pith.science/pith/RUTRM6KJBI7KSEJOWQANSI7MAD/action/replication_record"}},"created_at":"2026-07-04T15:37:22.598691+00:00","updated_at":"2026-07-04T15:37:22.598691+00:00"}