{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IXPPCR3FVR2HCI36Z6L4DFWGIS","short_pith_number":"pith:IXPPCR3F","schema_version":"1.0","canonical_sha256":"45def14765ac7471237ecf97c196c644ab7fedcffedac3e62fe3f18ed748a8bb","source":{"kind":"arxiv","id":"2004.04151","version":3},"attestation_state":"computed","paper":{"title":"Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Christopher Monroe, Ming Li, Qingfeng Wang, Yunseong Nam","submitted_at":"2020-04-08T17:59:13Z","abstract_excerpt":"The ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing the power of quantum computers. Here, we address this problem in two aspects. In the fault-tolerant regime, we optimize the $\\rzgate$ and $\\tgate$ gate counts along with the ancilla qubit counts required, assuming the use of a product-formula algorithm for implementation. We obtain a savings ratio of two in the gate counts and a savings ratio of eleven in th"},"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":"2004.04151","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-04-08T17:59:13Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"731ad56d88f5af0add5552b971dd634ba335c65964ce7dfe65a7e70dac7bd0c2","abstract_canon_sha256":"0bedb5c460c1d3b58461db2717098f241bf583877415119130c665fe5979432b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:08.539169Z","signature_b64":"JPNs//S+EF75akSsO8xiN4jWG6oejF6EB+BKn6YHZ1CONubQc97gLs40H67wocW6idn75sp6rH6ZNIUwWWeTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45def14765ac7471237ecf97c196c644ab7fedcffedac3e62fe3f18ed748a8bb","last_reissued_at":"2026-07-05T03:01:08.538616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:08.538616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Christopher Monroe, Ming Li, Qingfeng Wang, Yunseong Nam","submitted_at":"2020-04-08T17:59:13Z","abstract_excerpt":"The ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing the power of quantum computers. Here, we address this problem in two aspects. In the fault-tolerant regime, we optimize the $\\rzgate$ and $\\tgate$ gate counts along with the ancilla qubit counts required, assuming the use of a product-formula algorithm for implementation. We obtain a savings ratio of two in the gate counts and a savings ratio of eleven in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04151","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/2004.04151/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":"2004.04151","created_at":"2026-07-05T03:01:08.538684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.04151v3","created_at":"2026-07-05T03:01:08.538684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04151","created_at":"2026-07-05T03:01:08.538684+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXPPCR3FVR2H","created_at":"2026-07-05T03:01:08.538684+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXPPCR3FVR2HCI36","created_at":"2026-07-05T03:01:08.538684+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXPPCR3F","created_at":"2026-07-05T03:01:08.538684+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07578","citing_title":"Ternary tree transformations are equivalent to linear encodings of the Fock basis","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS","json":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS.json","graph_json":"https://pith.science/api/pith-number/IXPPCR3FVR2HCI36Z6L4DFWGIS/graph.json","events_json":"https://pith.science/api/pith-number/IXPPCR3FVR2HCI36Z6L4DFWGIS/events.json","paper":"https://pith.science/paper/IXPPCR3F"},"agent_actions":{"view_html":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS","download_json":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS.json","view_paper":"https://pith.science/paper/IXPPCR3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.04151&json=true","fetch_graph":"https://pith.science/api/pith-number/IXPPCR3FVR2HCI36Z6L4DFWGIS/graph.json","fetch_events":"https://pith.science/api/pith-number/IXPPCR3FVR2HCI36Z6L4DFWGIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS/action/storage_attestation","attest_author":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS/action/author_attestation","sign_citation":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS/action/citation_signature","submit_replication":"https://pith.science/pith/IXPPCR3FVR2HCI36Z6L4DFWGIS/action/replication_record"}},"created_at":"2026-07-05T03:01:08.538684+00:00","updated_at":"2026-07-05T03:01:08.538684+00:00"}