{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OZ3NPIUVENC6XYAZE2YBYRUREL","short_pith_number":"pith:OZ3NPIUV","schema_version":"1.0","canonical_sha256":"7676d7a2952345ebe01926b01c469122e3b4793664cb2b5524b85b1859764c77","source":{"kind":"arxiv","id":"2304.02241","version":1},"attestation_state":"computed","paper":{"title":"A Note on Quantum Phase Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yao-Ting Lin","submitted_at":"2023-04-05T06:05:42Z","abstract_excerpt":"In this work, we study the phase estimation problem. We show an alternative, simpler and self-contained proof of query lower bounds. Technically, compared to the previous proofs [NW99, Bes05], our proof is considerably elementary. Specifically, our proof consists of basic linear algebra without using the knowledge of Boolean function analysis and adversary methods. Qualitatively, our bound is tight in the low success probability regime and offers a more fine-grained trade-off. In particular, we prove that for any $\\epsilon > 0, p \\geq 0$, every algorithm requires at least $\\Omega(p/{\\epsilon})"},"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":"2304.02241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-04-05T06:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"d06525e08d13eb016cb2b03ad3dfe13ebfc31d41d25400571b6ca8f57e400ad0","abstract_canon_sha256":"1e33a798cca2d903038693dede2d466daa0dfaa24cb7f705b8c119fdfa969bf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:23.601963Z","signature_b64":"JPF38jYt8V35I/q9Y24iw6mIluXyqukyFiBh1i3vQ/PvgMN3o6f6kcghMROSn0ub6kmZ3TPrAjGydtVMxXW9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7676d7a2952345ebe01926b01c469122e3b4793664cb2b5524b85b1859764c77","last_reissued_at":"2026-07-05T05:58:23.601526Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:23.601526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Quantum Phase Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yao-Ting Lin","submitted_at":"2023-04-05T06:05:42Z","abstract_excerpt":"In this work, we study the phase estimation problem. We show an alternative, simpler and self-contained proof of query lower bounds. Technically, compared to the previous proofs [NW99, Bes05], our proof is considerably elementary. Specifically, our proof consists of basic linear algebra without using the knowledge of Boolean function analysis and adversary methods. Qualitatively, our bound is tight in the low success probability regime and offers a more fine-grained trade-off. In particular, we prove that for any $\\epsilon > 0, p \\geq 0$, every algorithm requires at least $\\Omega(p/{\\epsilon})"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.02241","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/2304.02241/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":"2304.02241","created_at":"2026-07-05T05:58:23.601600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.02241v1","created_at":"2026-07-05T05:58:23.601600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.02241","created_at":"2026-07-05T05:58:23.601600+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZ3NPIUVENC6","created_at":"2026-07-05T05:58:23.601600+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZ3NPIUVENC6XYAZ","created_at":"2026-07-05T05:58:23.601600+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZ3NPIUV","created_at":"2026-07-05T05:58:23.601600+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/OZ3NPIUVENC6XYAZE2YBYRUREL","json":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL.json","graph_json":"https://pith.science/api/pith-number/OZ3NPIUVENC6XYAZE2YBYRUREL/graph.json","events_json":"https://pith.science/api/pith-number/OZ3NPIUVENC6XYAZE2YBYRUREL/events.json","paper":"https://pith.science/paper/OZ3NPIUV"},"agent_actions":{"view_html":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL","download_json":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL.json","view_paper":"https://pith.science/paper/OZ3NPIUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.02241&json=true","fetch_graph":"https://pith.science/api/pith-number/OZ3NPIUVENC6XYAZE2YBYRUREL/graph.json","fetch_events":"https://pith.science/api/pith-number/OZ3NPIUVENC6XYAZE2YBYRUREL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL/action/storage_attestation","attest_author":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL/action/author_attestation","sign_citation":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL/action/citation_signature","submit_replication":"https://pith.science/pith/OZ3NPIUVENC6XYAZE2YBYRUREL/action/replication_record"}},"created_at":"2026-07-05T05:58:23.601600+00:00","updated_at":"2026-07-05T05:58:23.601600+00:00"}