{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JG5VSLWZ3KHIIXPOTVDIRQRKUN","short_pith_number":"pith:JG5VSLWZ","schema_version":"1.0","canonical_sha256":"49bb592ed9da8e845dee9d4688c22aa3662523dfc11fa9c20fee1a5778fc7a01","source":{"kind":"arxiv","id":"1304.0741","version":1},"attestation_state":"computed","paper":{"title":"Faster Phase Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Matthew B. Hastings, Michael Freedman","submitted_at":"2013-04-02T19:13:00Z","abstract_excerpt":"We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine its scaling in circuit depth and width. We show that the use of purely random measurements requires a number of measurements that is optimal up to constant factors, albeit at the cost of exponential classical post-processing; the method can also be used to improve classical signal processing. We then develop a quantum algorithm for phase estimation that yie"},"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":"1304.0741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-02T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"a32731beae9086739f6ae1f052aa9da87bad3f2d6ee44de1fbc7202b47281c55","abstract_canon_sha256":"989e720d84ad51d282744a4aa6ec19004b082d49fa042dcf10b980ee128a6736"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:24.401752Z","signature_b64":"oqc2r4y+EY8exNqXV4pMGquAVSeIwlIWoizLLV5IZCMusuEmS/rJU5UBT48FA8xZN0SpNc2lSMj65Ojd80/TBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49bb592ed9da8e845dee9d4688c22aa3662523dfc11fa9c20fee1a5778fc7a01","last_reissued_at":"2026-05-18T03:17:24.401191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:24.401191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Phase Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Matthew B. Hastings, Michael Freedman","submitted_at":"2013-04-02T19:13:00Z","abstract_excerpt":"We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine its scaling in circuit depth and width. We show that the use of purely random measurements requires a number of measurements that is optimal up to constant factors, albeit at the cost of exponential classical post-processing; the method can also be used to improve classical signal processing. We then develop a quantum algorithm for phase estimation that yie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0741","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":""},"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":"1304.0741","created_at":"2026-05-18T03:17:24.401279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0741v1","created_at":"2026-05-18T03:17:24.401279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0741","created_at":"2026-05-18T03:17:24.401279+00:00"},{"alias_kind":"pith_short_12","alias_value":"JG5VSLWZ3KHI","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JG5VSLWZ3KHIIXPO","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JG5VSLWZ","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24578","citing_title":"Hybrid Path-Sums for Hybrid Quantum Programs","ref_index":85,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN","json":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN.json","graph_json":"https://pith.science/api/pith-number/JG5VSLWZ3KHIIXPOTVDIRQRKUN/graph.json","events_json":"https://pith.science/api/pith-number/JG5VSLWZ3KHIIXPOTVDIRQRKUN/events.json","paper":"https://pith.science/paper/JG5VSLWZ"},"agent_actions":{"view_html":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN","download_json":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN.json","view_paper":"https://pith.science/paper/JG5VSLWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0741&json=true","fetch_graph":"https://pith.science/api/pith-number/JG5VSLWZ3KHIIXPOTVDIRQRKUN/graph.json","fetch_events":"https://pith.science/api/pith-number/JG5VSLWZ3KHIIXPOTVDIRQRKUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN/action/storage_attestation","attest_author":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN/action/author_attestation","sign_citation":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN/action/citation_signature","submit_replication":"https://pith.science/pith/JG5VSLWZ3KHIIXPOTVDIRQRKUN/action/replication_record"}},"created_at":"2026-05-18T03:17:24.401279+00:00","updated_at":"2026-05-18T03:17:24.401279+00:00"}