{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:54O2WUP5MXMAJI2AISOJWUO4LC","short_pith_number":"pith:54O2WUP5","schema_version":"1.0","canonical_sha256":"ef1dab51fd65d804a340449c9b51dc58aa0c262310f214f8439f34d68c330878","source":{"kind":"arxiv","id":"2105.05018","version":1},"attestation_state":"computed","paper":{"title":"Optimizing the Phase Estimation Algorithm Applied to the Quantum Simulation of Heisenberg-Type Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jean-Fran\\c{c}ois Van Huele, Scott Johnstun","submitted_at":"2021-05-07T21:41:08Z","abstract_excerpt":"The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles under a Heisenberg Hamiltonian. The evolution is performed through both classical simulations of quantum computers and real quantum computers via IBM's Qiskit platform. We also introduce three optimizations to the algorithm: circular, iterative, and Bayesian. We apply these optimizations to our simulations and investigate how the performance improves. We also"},"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":"2105.05018","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-05-07T21:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"5b7ae56f3a69dd2bccf1c48137816d3da09bfc3fa389cbd5bc04477f27fb098d","abstract_canon_sha256":"2ffe9c25aef5e8c8405039ece1fbe4016bd8d447b42ee380b5c17cb29e982e0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:39:27.235679Z","signature_b64":"k9sySVLUH4ToRoT7aZp0dwm4lj85HBpA0Q+ulIIhQRl4TZjwQ7B3LLt4HkQR9a/E2uYzA+ZXOSS355tNsEJaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef1dab51fd65d804a340449c9b51dc58aa0c262310f214f8439f34d68c330878","last_reissued_at":"2026-07-05T02:39:27.235233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:39:27.235233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing the Phase Estimation Algorithm Applied to the Quantum Simulation of Heisenberg-Type Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jean-Fran\\c{c}ois Van Huele, Scott Johnstun","submitted_at":"2021-05-07T21:41:08Z","abstract_excerpt":"The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles under a Heisenberg Hamiltonian. The evolution is performed through both classical simulations of quantum computers and real quantum computers via IBM's Qiskit platform. We also introduce three optimizations to the algorithm: circular, iterative, and Bayesian. We apply these optimizations to our simulations and investigate how the performance improves. We also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.05018","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/2105.05018/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":"2105.05018","created_at":"2026-07-05T02:39:27.235296+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.05018v1","created_at":"2026-07-05T02:39:27.235296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05018","created_at":"2026-07-05T02:39:27.235296+00:00"},{"alias_kind":"pith_short_12","alias_value":"54O2WUP5MXMA","created_at":"2026-07-05T02:39:27.235296+00:00"},{"alias_kind":"pith_short_16","alias_value":"54O2WUP5MXMAJI2A","created_at":"2026-07-05T02:39:27.235296+00:00"},{"alias_kind":"pith_short_8","alias_value":"54O2WUP5","created_at":"2026-07-05T02:39:27.235296+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC","json":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC.json","graph_json":"https://pith.science/api/pith-number/54O2WUP5MXMAJI2AISOJWUO4LC/graph.json","events_json":"https://pith.science/api/pith-number/54O2WUP5MXMAJI2AISOJWUO4LC/events.json","paper":"https://pith.science/paper/54O2WUP5"},"agent_actions":{"view_html":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC","download_json":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC.json","view_paper":"https://pith.science/paper/54O2WUP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.05018&json=true","fetch_graph":"https://pith.science/api/pith-number/54O2WUP5MXMAJI2AISOJWUO4LC/graph.json","fetch_events":"https://pith.science/api/pith-number/54O2WUP5MXMAJI2AISOJWUO4LC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC/action/storage_attestation","attest_author":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC/action/author_attestation","sign_citation":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC/action/citation_signature","submit_replication":"https://pith.science/pith/54O2WUP5MXMAJI2AISOJWUO4LC/action/replication_record"}},"created_at":"2026-07-05T02:39:27.235296+00:00","updated_at":"2026-07-05T02:39:27.235296+00:00"}