{"work":{"id":"64ad356b-b16b-40e9-8055-ea3eb48cb88f","openalex_id":null,"doi":null,"arxiv_id":"quant-ph/9807006","raw_key":null,"title":"The Heisenberg Representation of Quantum Computers","authors":null,"authors_text":"Daniel Gottesman","year":1998,"venue":"quant-ph","abstract":"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 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.","external_url":"https://arxiv.org/abs/quant-ph/9807006","cited_by_count":null,"metadata_source":"pith","metadata_fetched_at":"2026-05-25T07:00:26.962801+00:00","pith_arxiv_id":"quant-ph/9807006","created_at":"2026-05-09T04:30:15.762631+00:00","updated_at":"2026-06-05T21:23:00.469572+00:00","title_quality_ok":true,"display_title":"The Heisenberg Representation of Quantum Computers","render_title":"The Heisenberg Representation of Quantum Computers"},"hub":{"state":{"work_id":"64ad356b-b16b-40e9-8055-ea3eb48cb88f","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":72,"external_cited_by_count":null,"distinct_field_count":8,"first_pith_cited_at":"2023-06-01T18:00:02+00:00","last_pith_cited_at":"2026-05-22T12:54:10+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-07T00:21:12.795676+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":12},{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"background","n":11},{"context_polarity":"unclear","n":1},{"context_polarity":"use_method","n":1}],"runs":{"context_extract":{"job_type":"context_extract","status":"succeeded","result":{"enqueued_papers":25},"error":null,"updated_at":"2026-05-20T11:01:57.102810+00:00"},"graph_features":{"job_type":"graph_features","status":"succeeded","result":{"co_cited":[{"title":"Stabilizer Codes and Quantum Error Correction","work_id":"8dffbb8a-b91b-45a6-98ea-5fdf60573717","shared_citers":6},{"title":"Tahura, D","work_id":"412ba31b-7285-41a3-b20b-d12189fefe76","shared_citers":6},{"title":"Aaronson and D","work_id":"f3f3f051-fc77-4a15-99c3-6c98bb44c5c5","shared_citers":5},{"title":"Collura, J","work_id":"112dc5f9-2a83-4d6b-8e39-e41e5ad2148e","shared_citers":5},{"title":"Efficient witnessing and testing of magic in mixed quantum states","work_id":"623a11a4-c833-4bc8-99d6-4940aefab8fc","shared_citers":5},{"title":"Garc´ ıa, I.L","work_id":"32db64c9-017d-485c-b78a-15c4394dadb4","shared_citers":5},{"title":"Huang, H.-Z","work_id":"2595a779-8c1d-4a3c-9d8f-c42922cc038f","shared_citers":5},{"title":"Leone, S","work_id":"ff3e28d9-d750-4c61-a363-6434bc64eb8e","shared_citers":5},{"title":"Liu and A","work_id":"090f617f-a42c-455d-80f2-3cd9c6d4e36f","shared_citers":5},{"title":"Magic state cultivation: growing T states as cheap as CNOT gates","work_id":"4cfb255f-1ed0-4158-9c9b-5c3133e0e6aa","shared_citers":5},{"title":"Tirrito, L","work_id":"d3bbd314-451f-4ff6-a206-01475bfade09","shared_citers":5},{"title":"Turkeshi, E","work_id":"b43966a8-426c-449a-a0ec-ba5ee4eaf89f","shared_citers":5},{"title":"Aditya, X","work_id":"d4c7c903-2361-4faf-8336-7a2f720769d9","shared_citers":4},{"title":"Bravyi and A","work_id":"1a9f2613-2907-4567-8450-5623871daebf","shared_citers":4},{"title":"Capecci, G","work_id":"426a5c57-4640-4f4b-88cc-8c52ae218d5d","shared_citers":4},{"title":"Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness","work_id":"80e9365e-42ca-4931-9f12-035754ccd10c","shared_citers":4},{"title":"Hoshino and Y","work_id":"3de55047-d7bb-4547-8bd8-6ce1597dbe55","shared_citers":4},{"title":"Landahl and Jonas T","work_id":"4b43eb98-1720-4905-be14-d7e13e083ca6","shared_citers":4},{"title":"Measuring magic on a quantum processor","work_id":"fad5875e-8f58-4636-adbf-36d0b10b61db","shared_citers":4},{"title":"Quantum computing with Qiskit","work_id":"5dd3e61a-2250-4afb-a3d4-dd7202477631","shared_citers":4},{"title":"Tarabunga, T","work_id":"3d3799c0-cad5-41b8-aaa1-0c4539511b30","shared_citers":4},{"title":"The Clifford group fails gracefully to be a unitary 4-design","work_id":"7ec9973c-4a0d-4392-a094-81a5af1cbe87","shared_citers":4},{"title":"Aaronson and D","work_id":"aec614c6-cd2f-40f6-b868-bafb63000536","shared_citers":3},{"title":"Aditya, A","work_id":"e6d7cb4d-6dc1-454a-9698-9cdb81f20d21","shared_citers":3}],"time_series":[{"n":1,"year":2024},{"n":17,"year":2025},{"n":39,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","primary_cat":"quant-ph","context_text":"Section 5 concludes with a summary of results and future directions. 2 Frame-Factored State Representation Standard state vector simulation scales exponentially with the total number of qubits in the system. However, fault-tolerant quantum circuits are typically dominated by Clifford operations, which can be tracked efficiently via the Gottesman-Knill theorem [37]. We utilize this structure by shifting from the standard Schrödinger picture to a hybrid representation that decouples the state into three distinct objects: an offline Clifford coordinate frame, a dynamically sized state vector, and a lightweight Pauli tracking frame. By mapping operations into a Pauli tracking frame (which we term thevirtual basis) and","citing_arxiv_id":"2604.27058"}]},"error":null,"updated_at":"2026-05-20T11:02:01.777072+00:00"},"identity_refresh":{"job_type":"identity_refresh","status":"succeeded","result":{"items":[{"title":"Qwen3 Technical Report","outcome":"unchanged","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","resolver":"local_arxiv","confidence":0.98,"old_work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e"}],"counts":{"fixed":0,"merged":0,"unchanged":1,"quarantined":0,"needs_external_resolution":0},"errors":[],"attempted":1},"error":null,"updated_at":"2026-05-20T11:02:01.233705+00:00"},"summary_claims":{"job_type":"summary_claims","status":"succeeded","result":{"title":"The Heisenberg Representation of Quantum Computers","claims":[{"claim_text":"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","claim_type":"abstract","evidence_strength":"source_metadata"},{"claim_text":"Section 5 concludes with a summary of results and future directions. 2 Frame-Factored State Representation Standard state vector simulation scales exponentially with the total number of qubits in the system. However, fault-tolerant quantum circuits are typically dominated by Clifford operations, which can be tracked efficiently via the Gottesman-Knill theorem [37]. We utilize this structure by shifting from the standard Schrödinger picture to a hybrid representation that decouples the state into","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"[40] Z. Wang,Topological Quantum Computation, American Mathematical Society (2010). [41] M.A. Nielsen and I.L. Chuang,Quantum Computation and Quantum Information, Cambridge University Press, 10th anniversary edition ed. (2010). [42] S. Aaronson and D. Gottesman,Improved simulation of stabilizer circuits,Phys. Rev. A70(2004) 052328 [quant-ph/0406196v5]. [43] D. Gottesman,The heisenberg representation of quantum computers, in22nd International Colloquium on Group Theoretical Methods in Physics, pp","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"as starting points to include correlations, while the modern tools of tensor networks offer controlled, low-entanglement expansions around tensor-product states. Another notable class of states in the Hilbert space, that was only recently introduced in the many body-physics area [30], is that of stabilizer states. As first pointed out by Gottesmann and Knill [31], these states are special in that they can be prepared efficiently with classical computing [31,32], while being able to support high ","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"The study of the complexity of classical algorithms informs us that some problems cannot be solved by computers in reasonable timeframes. Quantum computers can solve these problems quickly, and the construction of these devices will bring profound technological changes in the upcoming decades. Some practical applications for which quantum algorithms currently exist include molecular simulation for drug discovery and material design [BGM+19, LBG+21, SBW+21, RBK+23], algorithms that break public-k","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"advantage using photons, Science370, 1460 (2020), https://www.science.org/doi/pdf/10.1126/science.abe8770. [4] D. Gottesman, The heisenberg representation of quantum computers, arXiv preprint quant-ph/9807006 (1998). [5] S. Bravyi and A. Kitaev, Universal quantum computa- tion with ideal clifford gates and noisy ancillas, Physical Review A71, 022316 (2005). [6] A. Mari and J. Eisert, Positive wigner functions ren- der classical simulation of quantum computation ef- ficient, Physical Review Lette","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"this by applying probabilistic inequalities such as Cheby- shev's inequality, Pr ∣ψ⟩∼ELU(ψ0) [∣sE(ψ)−∥E∥2 F∣≥kσ] ≤ 1 k2 , whereσ= √ Var(sE(ψ))denotes the standard de- viation. Error Kurtosis and Quantum Magic-In magic- state resource theory, Clifford operations and stabilizer states are considered \"free\" as a direct consequence of the Gottesman-Knill theorem [13, 14], which establishes their efficient classical simulability. In contrast, non- Clifford gates-though essential for achieving univers","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks The Heisenberg Representation of Quantum Computers because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (11 contexts).","role_counts":[{"n":11,"context_role":"background"},{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-05-20T11:01:54.583335+00:00"}},"summary":{"title":"The Heisenberg Representation of Quantum Computers","claims":[{"claim_text":"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","claim_type":"abstract","evidence_strength":"source_metadata"},{"claim_text":"Section 5 concludes with a summary of results and future directions. 2 Frame-Factored State Representation Standard state vector simulation scales exponentially with the total number of qubits in the system. However, fault-tolerant quantum circuits are typically dominated by Clifford operations, which can be tracked efficiently via the Gottesman-Knill theorem [37]. We utilize this structure by shifting from the standard Schrödinger picture to a hybrid representation that decouples the state into","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"[40] Z. Wang,Topological Quantum Computation, American Mathematical Society (2010). [41] M.A. Nielsen and I.L. Chuang,Quantum Computation and Quantum Information, Cambridge University Press, 10th anniversary edition ed. (2010). [42] S. Aaronson and D. Gottesman,Improved simulation of stabilizer circuits,Phys. Rev. A70(2004) 052328 [quant-ph/0406196v5]. [43] D. Gottesman,The heisenberg representation of quantum computers, in22nd International Colloquium on Group Theoretical Methods in Physics, pp","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"as starting points to include correlations, while the modern tools of tensor networks offer controlled, low-entanglement expansions around tensor-product states. Another notable class of states in the Hilbert space, that was only recently introduced in the many body-physics area [30], is that of stabilizer states. As first pointed out by Gottesmann and Knill [31], these states are special in that they can be prepared efficiently with classical computing [31,32], while being able to support high ","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"The study of the complexity of classical algorithms informs us that some problems cannot be solved by computers in reasonable timeframes. Quantum computers can solve these problems quickly, and the construction of these devices will bring profound technological changes in the upcoming decades. Some practical applications for which quantum algorithms currently exist include molecular simulation for drug discovery and material design [BGM+19, LBG+21, SBW+21, RBK+23], algorithms that break public-k","claim_type":"background","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"advantage using photons, Science370, 1460 (2020), https://www.science.org/doi/pdf/10.1126/science.abe8770. [4] D. Gottesman, The heisenberg representation of quantum computers, arXiv preprint quant-ph/9807006 (1998). [5] S. Bravyi and A. Kitaev, Universal quantum computa- tion with ideal clifford gates and noisy ancillas, Physical Review A71, 022316 (2005). [6] A. Mari and J. Eisert, Positive wigner functions ren- der classical simulation of quantum computation ef- ficient, Physical Review Lette","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"this by applying probabilistic inequalities such as Cheby- shev's inequality, Pr ∣ψ⟩∼ELU(ψ0) [∣sE(ψ)−∥E∥2 F∣≥kσ] ≤ 1 k2 , whereσ= √ Var(sE(ψ))denotes the standard de- viation. Error Kurtosis and Quantum Magic-In magic- state resource theory, Clifford operations and stabilizer states are considered \"free\" as a direct consequence of the Gottesman-Knill theorem [13, 14], which establishes their efficient classical simulability. In contrast, non- Clifford gates-though essential for achieving univers","claim_type":"background","confidence":0.85,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks The Heisenberg Representation of Quantum Computers because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (11 contexts).","role_counts":[{"n":11,"context_role":"background"},{"n":1,"context_role":"method"}]},"graph":{"co_cited":[{"title":"Stabilizer Codes and Quantum Error Correction","work_id":"8dffbb8a-b91b-45a6-98ea-5fdf60573717","shared_citers":6},{"title":"Tahura, D","work_id":"412ba31b-7285-41a3-b20b-d12189fefe76","shared_citers":6},{"title":"Aaronson and D","work_id":"f3f3f051-fc77-4a15-99c3-6c98bb44c5c5","shared_citers":5},{"title":"Collura, J","work_id":"112dc5f9-2a83-4d6b-8e39-e41e5ad2148e","shared_citers":5},{"title":"Efficient witnessing and testing of magic in mixed quantum states","work_id":"623a11a4-c833-4bc8-99d6-4940aefab8fc","shared_citers":5},{"title":"Garc´ ıa, I.L","work_id":"32db64c9-017d-485c-b78a-15c4394dadb4","shared_citers":5},{"title":"Huang, H.-Z","work_id":"2595a779-8c1d-4a3c-9d8f-c42922cc038f","shared_citers":5},{"title":"Leone, S","work_id":"ff3e28d9-d750-4c61-a363-6434bc64eb8e","shared_citers":5},{"title":"Liu and A","work_id":"090f617f-a42c-455d-80f2-3cd9c6d4e36f","shared_citers":5},{"title":"Magic state cultivation: growing T states as cheap as CNOT gates","work_id":"4cfb255f-1ed0-4158-9c9b-5c3133e0e6aa","shared_citers":5},{"title":"Tirrito, L","work_id":"d3bbd314-451f-4ff6-a206-01475bfade09","shared_citers":5},{"title":"Turkeshi, E","work_id":"b43966a8-426c-449a-a0ec-ba5ee4eaf89f","shared_citers":5},{"title":"Aditya, X","work_id":"d4c7c903-2361-4faf-8336-7a2f720769d9","shared_citers":4},{"title":"Bravyi and A","work_id":"1a9f2613-2907-4567-8450-5623871daebf","shared_citers":4},{"title":"Capecci, G","work_id":"426a5c57-4640-4f4b-88cc-8c52ae218d5d","shared_citers":4},{"title":"Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness","work_id":"80e9365e-42ca-4931-9f12-035754ccd10c","shared_citers":4},{"title":"Hoshino and Y","work_id":"3de55047-d7bb-4547-8bd8-6ce1597dbe55","shared_citers":4},{"title":"Landahl and Jonas T","work_id":"4b43eb98-1720-4905-be14-d7e13e083ca6","shared_citers":4},{"title":"Measuring magic on a quantum processor","work_id":"fad5875e-8f58-4636-adbf-36d0b10b61db","shared_citers":4},{"title":"Quantum computing with Qiskit","work_id":"5dd3e61a-2250-4afb-a3d4-dd7202477631","shared_citers":4},{"title":"Tarabunga, T","work_id":"3d3799c0-cad5-41b8-aaa1-0c4539511b30","shared_citers":4},{"title":"The Clifford group fails gracefully to be a unitary 4-design","work_id":"7ec9973c-4a0d-4392-a094-81a5af1cbe87","shared_citers":4},{"title":"Aaronson and D","work_id":"aec614c6-cd2f-40f6-b868-bafb63000536","shared_citers":3},{"title":"Aditya, A","work_id":"e6d7cb4d-6dc1-454a-9698-9cdb81f20d21","shared_citers":3}],"time_series":[{"n":1,"year":2024},{"n":17,"year":2025},{"n":39,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","primary_cat":"quant-ph","context_text":"Section 5 concludes with a summary of results and future directions. 2 Frame-Factored State Representation Standard state vector simulation scales exponentially with the total number of qubits in the system. However, fault-tolerant quantum circuits are typically dominated by Clifford operations, which can be tracked efficiently via the Gottesman-Knill theorem [37]. We utilize this structure by shifting from the standard Schrödinger picture to a hybrid representation that decouples the state into three distinct objects: an offline Clifford coordinate frame, a dynamically sized state vector, and a lightweight Pauli tracking frame. By mapping operations into a Pauli tracking frame (which we term thevirtual basis) and","citing_arxiv_id":"2604.27058"}]},"authors":[]}}