{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TA4QUWMWQNQNWVHO53GQLLEB3H","short_pith_number":"pith:TA4QUWMW","schema_version":"1.0","canonical_sha256":"98390a59968360db54eeeecd05ac81d9c0c36e7dbf993e11957cf2f098bae044","source":{"kind":"arxiv","id":"2503.05647","version":1},"attestation_state":"computed","paper":{"title":"Phase estimation with partially randomized time evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Schmidhuber, Aram Harrow, Freek Witteveen, Jakob G\\\"unther, Marek Miller, Matthias Christandl","submitted_at":"2025-03-07T18:09:32Z","abstract_excerpt":"Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computational overhead derives from the Hamiltonian simulation subroutine. In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation. We propose new partially randomized Hamiltonian simulation methods in which some terms are kept deterministically and others are randomly sampled. We perform a detailed resource estimate for single-ancilla phase estimation using p"},"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":"2503.05647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-07T18:09:32Z","cross_cats_sorted":[],"title_canon_sha256":"3985e4500936c668603f5b639be6d99633908a55ad1085c4867fb595c72a41a8","abstract_canon_sha256":"9e1ce0510082f349999699202d6619c42a4c51c6d64a99baa033b20958375cbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:43.660513Z","signature_b64":"6IwWFMIxRcE6bTcw//xZg+DTnFlcxkE5gDFT+JAGt66o2vxhoImZJUVr9tRmQWqQBf0SCtUHQFN4KWRzuZC9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98390a59968360db54eeeecd05ac81d9c0c36e7dbf993e11957cf2f098bae044","last_reissued_at":"2026-06-03T01:05:43.660111Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:43.660111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase estimation with partially randomized time evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Schmidhuber, Aram Harrow, Freek Witteveen, Jakob G\\\"unther, Marek Miller, Matthias Christandl","submitted_at":"2025-03-07T18:09:32Z","abstract_excerpt":"Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computational overhead derives from the Hamiltonian simulation subroutine. In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation. We propose new partially randomized Hamiltonian simulation methods in which some terms are kept deterministically and others are randomly sampled. We perform a detailed resource estimate for single-ancilla phase estimation using p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05647","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/2503.05647/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":"2503.05647","created_at":"2026-06-03T01:05:43.660168+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.05647v1","created_at":"2026-06-03T01:05:43.660168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05647","created_at":"2026-06-03T01:05:43.660168+00:00"},{"alias_kind":"pith_short_12","alias_value":"TA4QUWMWQNQN","created_at":"2026-06-03T01:05:43.660168+00:00"},{"alias_kind":"pith_short_16","alias_value":"TA4QUWMWQNQNWVHO","created_at":"2026-06-03T01:05:43.660168+00:00"},{"alias_kind":"pith_short_8","alias_value":"TA4QUWMW","created_at":"2026-06-03T01:05:43.660168+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"2605.00745","citing_title":"Quantum simulation of nanographenes and Trotter error cancellation","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2506.20587","citing_title":"How to use quantum computers for biomolecular free energies","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2508.06236","citing_title":"Space and Time Cost of Continuous Rotations in Surface Codes","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2603.25582","citing_title":"A unified quantum computing quantum Monte Carlo framework through structured state preparation","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00745","citing_title":"Quantum simulation of nanographenes and Trotter error cancellation","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07448","citing_title":"When is randomization advantageous in quantum simulation?","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02565","citing_title":"Sample-Based Quantum Diagonalization with Amplitude Amplification","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H","json":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H.json","graph_json":"https://pith.science/api/pith-number/TA4QUWMWQNQNWVHO53GQLLEB3H/graph.json","events_json":"https://pith.science/api/pith-number/TA4QUWMWQNQNWVHO53GQLLEB3H/events.json","paper":"https://pith.science/paper/TA4QUWMW"},"agent_actions":{"view_html":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H","download_json":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H.json","view_paper":"https://pith.science/paper/TA4QUWMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.05647&json=true","fetch_graph":"https://pith.science/api/pith-number/TA4QUWMWQNQNWVHO53GQLLEB3H/graph.json","fetch_events":"https://pith.science/api/pith-number/TA4QUWMWQNQNWVHO53GQLLEB3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H/action/storage_attestation","attest_author":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H/action/author_attestation","sign_citation":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H/action/citation_signature","submit_replication":"https://pith.science/pith/TA4QUWMWQNQNWVHO53GQLLEB3H/action/replication_record"}},"created_at":"2026-06-03T01:05:43.660168+00:00","updated_at":"2026-06-03T01:05:43.660168+00:00"}