{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7NC5J62X73BJTOBLP3LW34APHJ","short_pith_number":"pith:7NC5J62X","schema_version":"1.0","canonical_sha256":"fb45d4fb57fec299b82b7ed76df00f3a56471652a5d666b0c3b3ddf9371ac9d7","source":{"kind":"arxiv","id":"2305.04908","version":3},"attestation_state":"computed","paper":{"title":"Tight Bounds for Quantum Phase Estimation and Related Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Nikhil S. Mande, Ronald de Wolf","submitted_at":"2023-05-08T17:46:01Z","abstract_excerpt":"Phase estimation, due to Kitaev [arXiv'95], is one of the most fundamental subroutines in quantum computing. In the basic scenario, one is given black-box access to a unitary $U$, and an eigenstate $\\lvert \\psi \\rangle$ of $U$ with unknown eigenvalue $e^{i\\theta}$, and the task is to estimate the eigenphase $\\theta$ within $\\pm\\delta$, with high probability. The cost of an algorithm for us is the number of applications of $U$ and $U^{-1}$.\n  We tightly characterize the cost of several variants of phase estimation where we are no longer given an eigenstate, but are required to estimate the maxi"},"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":"2305.04908","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-08T17:46:01Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0b93f06ec44ba9af03d5a466d631d084753191f92e99ff316e1c7e5ecde4fd4e","abstract_canon_sha256":"e746d3e83dfbd555aa4be2f04cf2718217141680ef626c0d32d6c06c134a8908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:06.974646Z","signature_b64":"YbfTKQKiVk2UmJLOd5jzFW67uiDiYoo/ZGmqjkuYbDWgyfq24uMe5eh4NAtib53KLQh3jhZ2GZRSH5W+W39SAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb45d4fb57fec299b82b7ed76df00f3a56471652a5d666b0c3b3ddf9371ac9d7","last_reissued_at":"2026-06-11T01:09:06.973601Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:06.973601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Quantum Phase Estimation and Related Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Nikhil S. Mande, Ronald de Wolf","submitted_at":"2023-05-08T17:46:01Z","abstract_excerpt":"Phase estimation, due to Kitaev [arXiv'95], is one of the most fundamental subroutines in quantum computing. In the basic scenario, one is given black-box access to a unitary $U$, and an eigenstate $\\lvert \\psi \\rangle$ of $U$ with unknown eigenvalue $e^{i\\theta}$, and the task is to estimate the eigenphase $\\theta$ within $\\pm\\delta$, with high probability. The cost of an algorithm for us is the number of applications of $U$ and $U^{-1}$.\n  We tightly characterize the cost of several variants of phase estimation where we are no longer given an eigenstate, but are required to estimate the maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04908","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/2305.04908/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":"2305.04908","created_at":"2026-06-11T01:09:06.973750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04908v3","created_at":"2026-06-11T01:09:06.973750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04908","created_at":"2026-06-11T01:09:06.973750+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NC5J62X73BJ","created_at":"2026-06-11T01:09:06.973750+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NC5J62X73BJTOBL","created_at":"2026-06-11T01:09:06.973750+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NC5J62X","created_at":"2026-06-11T01:09:06.973750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.16195","citing_title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16195","citing_title":"Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems","ref_index":113,"is_internal_anchor":true},{"citing_arxiv_id":"2604.11381","citing_title":"Improved quasiparticle nuclear Hamiltonians for quantum computing","ref_index":92,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ","json":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ.json","graph_json":"https://pith.science/api/pith-number/7NC5J62X73BJTOBLP3LW34APHJ/graph.json","events_json":"https://pith.science/api/pith-number/7NC5J62X73BJTOBLP3LW34APHJ/events.json","paper":"https://pith.science/paper/7NC5J62X"},"agent_actions":{"view_html":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ","download_json":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ.json","view_paper":"https://pith.science/paper/7NC5J62X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04908&json=true","fetch_graph":"https://pith.science/api/pith-number/7NC5J62X73BJTOBLP3LW34APHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7NC5J62X73BJTOBLP3LW34APHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ/action/storage_attestation","attest_author":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ/action/author_attestation","sign_citation":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ/action/citation_signature","submit_replication":"https://pith.science/pith/7NC5J62X73BJTOBLP3LW34APHJ/action/replication_record"}},"created_at":"2026-06-11T01:09:06.973750+00:00","updated_at":"2026-06-11T01:09:06.973750+00:00"}