{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MBRO4PVH3V3F7CBPF7IVSIRHQ4","short_pith_number":"pith:MBRO4PVH","schema_version":"1.0","canonical_sha256":"6062ee3ea7dd765f882f2fd1592227873fad699c1c4dcf78d098315d48dc3355","source":{"kind":"arxiv","id":"2106.16235","version":2},"attestation_state":"computed","paper":{"title":"Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Bryan A. O'Gorman, David R. Reichman, Joonho Lee, Nicholas C. Rubin, Ryan Babbush, William J. Huggins","submitted_at":"2021-06-30T17:43:47Z","abstract_excerpt":"Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to these problems. However, they can be severely biased when controlling the fermionic sign problem using constraints, as is necessary for scalability. Here we propose an approach that combines constrained QMC with quantum computing tools to reduce such biases. We experimentally implement our scheme using up to 16 qubits in order to unbias constrained QMC calcula"},"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":"2106.16235","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-30T17:43:47Z","cross_cats_sorted":["physics.chem-ph"],"title_canon_sha256":"2ae1d07a4429729a2bdf959ce9717bbc65eaf9aa68952d188073028181be8e21","abstract_canon_sha256":"56555dce24eb0e6142fc6eb90e3ec24399ebd9d0f3409613ee428d1707ce33b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:25.003048Z","signature_b64":"MVZwcJvZFMcWRwdRWovijHKRTQkXJ11I5m3LOCXnBXC6wNie6MDQ1iSSegy/5/CgCoFt/6zKK0EvALPKTEmcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6062ee3ea7dd765f882f2fd1592227873fad699c1c4dcf78d098315d48dc3355","last_reissued_at":"2026-07-05T04:11:25.002635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:25.002635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Bryan A. O'Gorman, David R. Reichman, Joonho Lee, Nicholas C. Rubin, Ryan Babbush, William J. Huggins","submitted_at":"2021-06-30T17:43:47Z","abstract_excerpt":"Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to these problems. However, they can be severely biased when controlling the fermionic sign problem using constraints, as is necessary for scalability. Here we propose an approach that combines constrained QMC with quantum computing tools to reduce such biases. We experimentally implement our scheme using up to 16 qubits in order to unbias constrained QMC calcula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.16235","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/2106.16235/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":"2106.16235","created_at":"2026-07-05T04:11:25.002696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.16235v2","created_at":"2026-07-05T04:11:25.002696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.16235","created_at":"2026-07-05T04:11:25.002696+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBRO4PVH3V3F","created_at":"2026-07-05T04:11:25.002696+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBRO4PVH3V3F7CBP","created_at":"2026-07-05T04:11:25.002696+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBRO4PVH","created_at":"2026-07-05T04:11:25.002696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22801","citing_title":"Optimization by VarQITE on Adaptive Variational Quantum Kolmogorov-Arnold Network","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4","json":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4.json","graph_json":"https://pith.science/api/pith-number/MBRO4PVH3V3F7CBPF7IVSIRHQ4/graph.json","events_json":"https://pith.science/api/pith-number/MBRO4PVH3V3F7CBPF7IVSIRHQ4/events.json","paper":"https://pith.science/paper/MBRO4PVH"},"agent_actions":{"view_html":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4","download_json":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4.json","view_paper":"https://pith.science/paper/MBRO4PVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.16235&json=true","fetch_graph":"https://pith.science/api/pith-number/MBRO4PVH3V3F7CBPF7IVSIRHQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/MBRO4PVH3V3F7CBPF7IVSIRHQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4/action/storage_attestation","attest_author":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4/action/author_attestation","sign_citation":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4/action/citation_signature","submit_replication":"https://pith.science/pith/MBRO4PVH3V3F7CBPF7IVSIRHQ4/action/replication_record"}},"created_at":"2026-07-05T04:11:25.002696+00:00","updated_at":"2026-07-05T04:11:25.002696+00:00"}