{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:SMR4QIYYQI2Q6UF3AM2QSFSACK","short_pith_number":"pith:SMR4QIYY","schema_version":"1.0","canonical_sha256":"9323c8231882350f50bb033509164012be5997b60df0972e6c3bfb757b7d3a51","source":{"kind":"arxiv","id":"quant-ph/9807006","version":1},"attestation_state":"computed","paper":{"title":"The Heisenberg Representation of Quantum Computers","license":"","headline":"The Heisenberg representation describes quantum computers by tracking the evolution of operators rather than states.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"1998-07-01T19:34:39Z","abstract_excerpt":"Since Shor's discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers - the difficulty of describing them on classical computers - also makes it difficult to describe and understand precisely what can be done with them. A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations. States used in error correction and certain communication protocols can"},"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/9807006","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1998-07-01T19:34:39Z","cross_cats_sorted":[],"title_canon_sha256":"c316c5489c72d8f4571a297f41edb669bdec506912651e36755daa57870999cc","abstract_canon_sha256":"6ac87f296acf1f5fad37770744df1e12815d024f359c32d9e8310ae716520e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:48:09.338034Z","signature_b64":"TIBoRY6djZ/iWHM1ux+B28HunWZjy1S18IoFCYvYW8cmXeX39hcoe70iWG/A6tMiFYxDTm4flpMC9qtBLCdMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9323c8231882350f50bb033509164012be5997b60df0972e6c3bfb757b7d3a51","last_reissued_at":"2026-07-04T15:48:09.337668Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:48:09.337668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Heisenberg Representation of Quantum Computers","license":"","headline":"The Heisenberg representation describes quantum computers by tracking the evolution of operators rather than states.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Gottesman","submitted_at":"1998-07-01T19:34:39Z","abstract_excerpt":"Since Shor's discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers - the difficulty of describing them on classical computers - also makes it difficult to describe and understand precisely what can be done with them. A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations. States used in error correction and certain communication protocols can"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"States used in error correction and certain communication protocols can be described by their stabilizer, a group of tensor products of Pauli matrices. Even this simple group structure is sufficient to allow a rich range of quantum effects, although it falls short of the full power of quantum computation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the relevant quantum operations preserve the stabilizer structure and that the class of states and operations considered is representative of useful quantum computation tasks.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Quantum states for error correction are described by their stabilizer, a commuting group of tensor products of Pauli matrices, enabling analysis of a rich class of quantum effects short of full quantum computation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The Heisenberg representation describes quantum computers by tracking the evolution of operators rather than states.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"63dc3f041a6631f09937277d7a1b39559e453f2dc7efc4e28c03d56ea5eff365"},"source":{"id":"quant-ph/9807006","kind":"arxiv","version":1},"verdict":{"id":"c84339a2-9010-4d1d-86ed-96beb75893da","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T00:38:09.741838Z","strongest_claim":"States used in error correction and certain communication protocols can be described by their stabilizer, a group of tensor products of Pauli matrices. Even this simple group structure is sufficient to allow a rich range of quantum effects, although it falls short of the full power of quantum computation.","one_line_summary":"Quantum states for error correction are described by their stabilizer, a commuting group of tensor products of Pauli matrices, enabling analysis of a rich class of quantum effects short of full quantum computation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the relevant quantum operations preserve the stabilizer structure and that the class of states and operations considered is representative of useful quantum computation tasks.","pith_extraction_headline":"The Heisenberg representation describes quantum computers by tracking the evolution of operators rather than states."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9807006/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":13,"sample":[{"doi":"","year":1997,"title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","work_id":"6a74da59-fa0f-48a3-954d-517437ba8ffc","ref_index":1,"cited_arxiv_id":"quant-ph/9508027","is_internal_anchor":false},{"doi":"","year":1998,"title":"A Theory of Fault-Tolerant Quantum Computation","work_id":"2df86b67-dd85-4fff-81f4-6ac83e64e3d4","ref_index":2,"cited_arxiv_id":"quant-ph/9702029","is_internal_anchor":false},{"doi":"","year":1998,"title":"Expressing the operations of quantum computing in multiparticle geome tric algebra","work_id":"36eaf9e6-d524-4186-bc8b-902b6dbbbf57","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"Class of quantum error-correcting c odes saturating the quantum Hamming bound","work_id":"619d99ba-e7fb-451e-843b-0422be7a35d4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"Quantum Error Correction and Orthogonal Geometry","work_id":"b8f53128-cae3-40ea-b2d0-eaa9166103b8","ref_index":5,"cited_arxiv_id":"quant-ph/9605005","is_internal_anchor":false}],"resolved_work":13,"snapshot_sha256":"18716bc37beaedcf7b569771d94fce4cada29d426e5227e43695ac066d0bc402","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f83085fe39c71faf51ae09cfa857f731ecd5b524219332d940d571fd6c74b86f"},"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/9807006","created_at":"2026-07-04T15:48:09.337733+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9807006v1","created_at":"2026-07-04T15:48:09.337733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9807006","created_at":"2026-07-04T15:48:09.337733+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMR4QIYYQI2Q","created_at":"2026-07-04T15:48:09.337733+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMR4QIYYQI2Q6UF3","created_at":"2026-07-04T15:48:09.337733+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMR4QIYY","created_at":"2026-07-04T15:48:09.337733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":111,"internal_anchor_count":111,"sample":[{"citing_arxiv_id":"2607.08396","citing_title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2607.08767","citing_title":"Plaquette: A hardware-aware design platform for fault-tolerant quantum computers","ref_index":9,"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":39,"is_internal_anchor":true},{"citing_arxiv_id":"2607.05343","citing_title":"Quantum Computational Resources and Conformal Field Theory: Unifying Spins, Bosons, and Fermions","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20776","citing_title":"Path integral formulation of finite-dimensional quantum mechanics in discrete phase space","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26084","citing_title":"Operational detection of Wigner negativity in arbitrary quantum states from few copies","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27358","citing_title":"Cultivating logical catalysts for fault-tolerant dyadic phase rotations","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2606.23800","citing_title":"Unitary Designs from Doped Matchgate Circuits","ref_index":197,"is_internal_anchor":true},{"citing_arxiv_id":"2606.22507","citing_title":"Hierarchy of mixed symmetry protected topological states in extended cluster states under subsystem decoherence","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":140,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19848","citing_title":"QMCtwin: Master-Equation Simulation of Syndrome Statistics Beyond Pauli Noise","ref_index":84,"is_internal_anchor":true},{"citing_arxiv_id":"2606.17148","citing_title":"Quantum Resources and Wigner Symmetry in Nucleon-Nucleon Scattering from Effective Field Theory","ref_index":57,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13606","citing_title":"Diffusive Dynamics of Nonstabilizerness","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2607.02481","citing_title":"Symmetries of Pauli Noise from Lindbladian Dynamics","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09785","citing_title":"Biclique decompositions from Welzl orders","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09995","citing_title":"Quantum resources in non-stoquastic quantum annealing","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09971","citing_title":"Magic and entanglement in 1+1-dimensional SU(2) lattice gauge theory","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09773","citing_title":"From Pauli Strings to Quantum Dynamics: A Unified Characterization","ref_index":98,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08707","citing_title":"Simulating quantum circuits with a neural statebank","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07734","citing_title":"Exploring the landscape of compact magic-state distillation factories","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07377","citing_title":"Coherent versus stochastic error injection on a repetition-code logical qubit in superconducting hardware","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28004","citing_title":"Hard-core Bosons in Action: Applications to Quantum Circuits","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25132","citing_title":"Resource Management in Heterogeneous Quantum Repeater Networks","ref_index":63,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18494","citing_title":"Quantum magic of strongly correlated fermions $-$ the Hubbard dimer","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12675","citing_title":"Answer Partitions and Oracle Access Determine Quantum Query Complexity","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK","json":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK.json","graph_json":"https://pith.science/api/pith-number/SMR4QIYYQI2Q6UF3AM2QSFSACK/graph.json","events_json":"https://pith.science/api/pith-number/SMR4QIYYQI2Q6UF3AM2QSFSACK/events.json","paper":"https://pith.science/paper/SMR4QIYY"},"agent_actions":{"view_html":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK","download_json":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK.json","view_paper":"https://pith.science/paper/SMR4QIYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9807006&json=true","fetch_graph":"https://pith.science/api/pith-number/SMR4QIYYQI2Q6UF3AM2QSFSACK/graph.json","fetch_events":"https://pith.science/api/pith-number/SMR4QIYYQI2Q6UF3AM2QSFSACK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK/action/storage_attestation","attest_author":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK/action/author_attestation","sign_citation":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK/action/citation_signature","submit_replication":"https://pith.science/pith/SMR4QIYYQI2Q6UF3AM2QSFSACK/action/replication_record"}},"created_at":"2026-07-04T15:48:09.337733+00:00","updated_at":"2026-07-04T15:48:09.337733+00:00"}