{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:EDCPWQPUO6FO7KJYJ7UCPZNRVQ","short_pith_number":"pith:EDCPWQPU","schema_version":"1.0","canonical_sha256":"20c4fb41f4778aefa9384fe827e5b1ac0cb36dfbedc5824e4a914218acffb847","source":{"kind":"arxiv","id":"quant-ph/9511026","version":1},"attestation_state":"computed","paper":{"title":"Quantum measurements and the Abelian Stabilizer Problem","license":"","headline":"A quantum algorithm solves the Abelian stabilizer problem in polynomial time, covering factoring and discrete logarithm.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A.Yu.Kitaev (L.D.Landau Institute for Theoretical Physics, Moscow)","submitted_at":"1995-11-20T20:39:33Z","abstract_excerpt":"We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a unitary operator. Another application of this procedure is a polynomial quantum Fourier transform algorithm for an arbitrary finite Abelian group. The paper also contains a rather detailed introduction to the theory of quantum computation."},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"quant-ph/9511026","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-11-20T20:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"fa185c89991489a57118af967fca74940d69c844b1c8d31a6963faf277e4c763","abstract_canon_sha256":"b74975f8f3ce0120af5e418a3f1ae905fc923dddf1f39446eb4b68635dbe15a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:03.526065Z","signature_b64":"hnB88YxtbN7guKw5FV4Iw5VyKkiz5+nFGESSvFyAXeYlPDTYxR2jt81J3xf6bv7WL/1VcDd7J+/YNQMdFlWvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20c4fb41f4778aefa9384fe827e5b1ac0cb36dfbedc5824e4a914218acffb847","last_reissued_at":"2026-07-04T14:47:03.525645Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:03.525645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum measurements and the Abelian Stabilizer Problem","license":"","headline":"A quantum algorithm solves the Abelian stabilizer problem in polynomial time, covering factoring and discrete logarithm.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A.Yu.Kitaev (L.D.Landau Institute for Theoretical Physics, Moscow)","submitted_at":"1995-11-20T20:39:33Z","abstract_excerpt":"We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a unitary operator. Another application of this procedure is a polynomial quantum Fourier transform algorithm for an arbitrary finite Abelian group. The paper also contains a rather detailed introduction to the theory of quantum computation."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The group action (or the function whose stabilizer is sought) can be implemented as an efficient quantum circuit realizing the corresponding unitary operator.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Kitaev presents a polynomial quantum algorithm for the Abelian stabilizer problem based on measuring eigenvalues of unitary operators, generalizing Shor's factoring and discrete-log algorithms.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A quantum algorithm solves the Abelian stabilizer problem in polynomial time, covering factoring and discrete logarithm.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4177f06e7d59b5b5fed412ba821b7d1db659b1f9762e90f772c4bb5604bee31d"},"source":{"id":"quant-ph/9511026","kind":"arxiv","version":1},"verdict":{"id":"185009bc-4285-4b3e-ab70-340eee4e978f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T05:03:44.059564Z","strongest_claim":"We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm.","one_line_summary":"Kitaev presents a polynomial quantum algorithm for the Abelian stabilizer problem based on measuring eigenvalues of unitary operators, generalizing Shor's factoring and discrete-log algorithms.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The group action (or the function whose stabilizer is sought) can be implemented as an efficient quantum circuit realizing the corresponding unitary operator.","pith_extraction_headline":"A quantum algorithm solves the Abelian stabilizer problem in polynomial time, covering factoring and discrete logarithm."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9511026/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":16,"sample":[{"doi":"","year":1982,"title":"Quantum mechanical Hamiltonian models of Tu ring machines","work_id":"a256f939-6742-4be5-acde-7c9d3859a159","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"Reversible logic and quantum computers","work_id":"635876e5-ce2f-46c0-8d19-262288427b4e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"Quantum mechanical computers","work_id":"2c781a02-e4f7-48a7-8e7d-89cbb7c3c442","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"Quantum theory, the Church-Turing princip le and the universal quantum computer","work_id":"694267f2-cae1-4c38-b054-30d03d1ae2d7","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1989,"title":"Quantum computational networks","work_id":"f3cd17dd-674c-4b1a-be60-869f32a001ca","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"f5ba4ff3a496a975a4fb69a6d75ca13582174f1223d9473193ba9f250f0bec84","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"91cc3ecd0b470423f41a28207f1450a66e165d18ff24f3bd81462895af52a30c"},"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":"quant-ph/9511026","created_at":"2026-07-04T14:47:03.525718+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9511026v1","created_at":"2026-07-04T14:47:03.525718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9511026","created_at":"2026-07-04T14:47:03.525718+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDCPWQPUO6FO","created_at":"2026-07-04T14:47:03.525718+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDCPWQPUO6FO7KJY","created_at":"2026-07-04T14:47:03.525718+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDCPWQPU","created_at":"2026-07-04T14:47:03.525718+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":80,"internal_anchor_count":80,"sample":[{"citing_arxiv_id":"2607.08220","citing_title":"Quantum linear solvers for quantum chemistry: prospects of exponential quantum advantage","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2607.08047","citing_title":"Nuclear Many-Body Systems as Benchmarks for Quantum Computing","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07554","citing_title":"RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26941","citing_title":"Perturbatively Corrected Linear Response Selected Configuration Interaction","ref_index":91,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27358","citing_title":"Cultivating logical catalysts for fault-tolerant dyadic phase rotations","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"2606.23262","citing_title":"Tuning Quantum MPS","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2606.22071","citing_title":"Hardware-native quantum phase estimation with circuit QED","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20176","citing_title":"Quantum-Accelerated Self-Consistent Field: A Hybrid Algorithm","ref_index":84,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19239","citing_title":"Quantum-Classical Auxiliary-Field Quantum Monte Carlo at the Edge of Practicability","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11843","citing_title":"Quantum iterative approach to the Traveling Salesman Problem","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07084","citing_title":"Projector Quantum Variational Ansatz","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2606.06919","citing_title":"Scalable Quantum Algorithms for Gutzwiller Projection","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2606.06070","citing_title":"Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2606.01589","citing_title":"Towards Heisenberg Scaling: Measurement-Efficient Non-Orthogonal Quantum Eigensolver","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2606.01426","citing_title":"Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods","ref_index":188,"is_internal_anchor":true},{"citing_arxiv_id":"2605.30967","citing_title":"Evaluating higher-order product formulae for molecular ground-state energy estimation","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.24824","citing_title":"Point-group symmetry analysis of many-electron wavefunctions on a quantum computer","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28952","citing_title":"A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2605.29774","citing_title":"Quantum algorithms for density functional theory with minimal readout","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22980","citing_title":"Automatic De-Quantization of Quantum Programs Using Constant Propagation","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06949","citing_title":"Quantum Data Fitting Algorithm for Non-sparse Matrices","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2208.13557","citing_title":"Controlled Gate Networks: Theory and Application to Eigenvalue Estimation","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2310.04255","citing_title":"From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2401.15829","citing_title":"Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2409.00433","citing_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ","json":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ.json","graph_json":"https://pith.science/api/pith-number/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/graph.json","events_json":"https://pith.science/api/pith-number/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/events.json","paper":"https://pith.science/paper/EDCPWQPU"},"agent_actions":{"view_html":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ","download_json":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ.json","view_paper":"https://pith.science/paper/EDCPWQPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9511026&json=true","fetch_graph":"https://pith.science/api/pith-number/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/action/storage_attestation","attest_author":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/action/author_attestation","sign_citation":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/action/citation_signature","submit_replication":"https://pith.science/pith/EDCPWQPUO6FO7KJYJ7UCPZNRVQ/action/replication_record"}},"created_at":"2026-07-04T14:47:03.525718+00:00","updated_at":"2026-07-04T14:47:03.525718+00:00"}