The Heisenberg Representation of Quantum Computers

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.

20 pages, LaTeX. Expanded version of a plenary speech at the 1998 International Conference on Group Theoretic Methods in Physics

References in corpus (1)

• Expressing the operations of quantum computing in multiparticle geometric algebra

Cited by in corpus (266)

• Gaussian Quantum Information
• Surface codes: Towards practical large-scale quantum computation
• Quantum Teleportation is a Universal Computational Primitive
• Topological quantum memory
• Quantum Error Correction for Quantum Memories
• Quantum Resource Theories
• Multi-party entanglement in graph states
• Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
• Measurement-driven entanglement transition in hybrid quantum circuits
• The Resource Theory of Stabilizer Computation
• Simulating quantum computation by contracting tensor networks
• Efficient Classical Simulation of Continuous Variable Quantum Information Processes
• Quantum Computing with Continuous-Variable Clusters
• Classical simulation of noninteracting-fermion quantum circuits
• Scalable probes of measurement-induced criticality
• Is the quantum state real? An extended review of $\psi$-ontology theorems
• Information Scrambling in Computationally Complex Quantum Circuits
• Stabilizer Rényi entropy
• Observation of measurement-induced quantum phases in a trapped-ion quantum computer
• The SIC Question: History and State of Play
• Quantum discord and its allies: a review
• Statistical mechanics of quantum error correcting codes
• Measurement Protected Quantum Phases
• Measurement-induced criticality in (2+1)-d hybrid quantum circuits
• Open source software in quantum computing
• Emerging quantum computing algorithms for quantum chemistry
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Quasi-quantization: classical statistical theories with an epistemic restriction
• Quantum from principles
• Introduction to the book "Quantum Theory: Informational Foundations and Foils"
• The completeness of quantum theory for predicting measurement outcomes
• Linear growth of quantum circuit complexity
• Conformal invariance and quantum non-locality in critical hybrid circuits
• Fermionic partial tomography via classical shadows
• Efficient classical simulation of random shallow 2D quantum circuits
• Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
• Towards realistic implementations of a Majorana surface code
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Unified derivations of measurement-based schemes for quantum computation
• An area law for entanglement from exponential decay of correlations
• Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions
• Roadmap to Majorana surface codes
• Continuous-variable quantum computing in the quantum optical frequency comb
• Stabilizer entropies and nonstabilizerness monotones
• Tutorial: Gate-based superconducting quantum computing
• qHiPSTER: The Quantum High Performance Software Testing Environment
• Measuring magic on a quantum processor
• A Partial Derandomization of PhaseLift using Spherical Designs
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Measurement-induced phase transitions in quantum automaton circuits
• Both Toffoli and Controlled-NOT need little help to do universal quantum computation
• A randomized quantum algorithm for statistical phase estimation
• Entanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures
• Hierarchy of universal entanglement in 2D measurement-based quantum computation
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Local permutations of products of Bell states and entanglement distillation
• Verification of Many-Qubit States
• Fault-tolerant quantum computing with color codes
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Emergence of typical entanglement in two-party random processes
• Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
• How to efficiently select an arbitrary Clifford group element
• Phase space simulation method for quantum computation with magic states on qubits
• Encoding a qubit in a spin
• Efficient Classical Simulation of Optical Quantum Circuits
• Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories
• Phase transition in magic with random quantum circuits
• Decoherence-Free Subspaces for Multiple-Qubit Errors: (II) Universal, Fault-Tolerant Quantum Computation
• Efficient classical simulation of matchgate circuits with generalized inputs and measurements
• Pauli stabilizer models of twisted quantum doubles
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks
• Resource theory of quantum scrambling
• Entanglement phase transitions in random stabilizer tensor networks
• Quantum interference as a resource for quantum speedup
• Decoding algorithms for surface codes
• On Optimality of CSS Codes for Transversal $T$
• Metaplectic Anyons, Majorana Zero Modes, and their Computational Power
• A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
• Real Randomized Benchmarking
• Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
• Braiding Majorana zero modes using quantum dots
• qTorch: The Quantum Tensor Contraction Handler
• The ZX-calculus is incomplete for quantum mechanics
• Simulating a measurement-induced phase transition for trapped ion circuits
• One-way Quantum Computation - a tutorial introduction
• Entanglement is not a critical resource for quantum metrology
• Quantum chemistry simulation of ground- and excited-state properties of the sulfonium cation on a superconducting quantum processor
• Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes
• Generators and relations for n-qubit Clifford operators
• Symmetry-protected sign problem and magic in quantum phases of matter
• Photonic resource state generation from a minimal number of quantum emitters
• Generation of Universal Linear Optics by Any Beamsplitter
• Fundamental limits on the capacities of bipartite quantum interactions
• Network architecture for a topological quantum computer in silicon
• Quantum Entropy and Central Limit Theorem
• The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
• Unforgeable Quantum Encryption
• Artificial Intelligence for Quantum Computing
• Transitions in Entanglement Complexity in Random Circuits
• Error mitigation and quantum-assisted simulation in the error corrected regime
• Level Reduction and the Quantum Threshold Theorem
• Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
• Quantum computing by color-code lattice surgery
• Method for decoupling error correction from privacy amplification
• Measurement-based generation and preservation of cat and grid states within a continuous-variable cluster state
• Learning quantum circuits of some $T$ gates
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
• Stabilizer extent is not multiplicative
• Fast estimation of outcome probabilities for quantum circuits
• State preparation by shallow circuits using feed forward
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Optimising Clifford Circuits with Quantomatic
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Measurement-Based Quantum Computation
• Infinite-randomness criticality in monitored quantum dynamics with static disorder
• Introduction to Quantum Error Correction and Fault Tolerance
• Quantum butterfly effect in polarized Floquet systems
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• Scrambling and Lyapunov Exponent in Unitary Networks with Tunable Interactions
• Fast Stabiliser Simulation with Quadratic Form Expansions
• Nonlocality and information flow: The approach of Deutsch and Hayden
• Analytical Framework for Quantum Alternating Operator Ansätze
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
• Further extensions of Clifford circuits and their classical simulation complexities
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Closed-form analytic expressions for shadow estimation with brickwork circuits
• Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
• Graphical Structures for Design and Verification of Quantum Error Correction
• Robustness of QMA against witness noise
• Exact solution of long-range stabilizer Rényi entropy in the dual-unitary XXZ model
• Superluminal X-waves in a polariton quantum fluid
• Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution
• A quantum primality test with order finding
• Limits on Efficient Computation in the Physical World
• Quantifying non-stabilizerness via information scrambling
• A toy model for decoherence in the black hole information problem
• Near-Hashing-Bound Multiple-Rate Quantum Turbo Short-Block Codes
• Quantum Error Correction via Noise Guessing Decoding
• Deterministic Fast Scrambling with Neutral Atom Arrays
• Constructions for Quantum Indistinguishability Obfuscation
• Pseudorandom unitaries are neither real nor sparse nor noise-robust
• Propagation of generalized Pauli errors in qudit Clifford circuits
• Negative Wigner function at telecommunication wavelength from homodyne detection
• On the Significance of the Gottesman-Knill Theorem
• Efficient mutual magic and magic capacity with matrix product states
• Adiabatic topological quantum computing
• Secure assisted quantum computation
• Topological quantum error correction in the Kitaev honeycomb model
• Relating Measurement Patterns to Circuits via Pauli Flow
• Compilation of algorithm-specific graph states for quantum circuits
• A SAT Encoding for Optimal Clifford Circuit Synthesis
• Classical simulation of quantum circuits by half Gauss sums
• Effects of quantum resources on the statistical complexity of quantum circuits
• Quantum error correction with the color-Gottesman-Kitaev-Preskill code
• Entanglement and Stabilizer entropies of random bipartite pure quantum states
• Entanglement of random hypergraph states
• The Quantum House Of Cards
• Power of one non-clean qubit
• What the foundations of quantum computer science teach us about chemistry
• A Regular Representation of Quantum Circuits
• Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems
• Designing the Quantum Channels Induced by Diagonal Gates
• Transformations of Stabilizer States in Quantum Networks
• Quantum matchgate computations and linear threshold gates
• Error-correcting codes for fermionic quantum simulation
• Topological Defects in Floquet Circuits
• The principle of majorization: application to random quantum circuits
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
• Fractional Chern insulator edges and layer-resolved lattice contacts
• Mitigating Coherent Noise by Balancing Weight-2 $Z$-Stabilizers
• Quantum Circuit Mapping for Universal and Scalable Computing in MZI-based Integrated Photonics
• Magic phase transition and non-local complexity in generalized $W$ State
• Mixing and localisation in random time-periodic quantum circuits of Clifford unitaries
• Contextuality in composite systems: the role of entanglement in the Kochen-Specker theorem
• Gottesman Types for Quantum Programs
• Interplay of entanglement structures and stabilizer entropy in spin models
• Simulation of open quantum systems via low-depth convex unitary evolutions
• Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
• ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification
• Quantum convolutional data-syndrome codes
• Hybrid quantum computing with ancillas
• Emulating Quantum Interference with Generalized Ising Machines
• Entanglement buffering with two quantum memories
• Realistic simulation of quantum computation using unitary and measurement channels
• From the Bloch sphere to phase space representations with the Gottesman-Kitaev-Preskill encoding
• Blind Quantum Computation Using a Circuit-Based Quantum Computer
• Scalable evaluation of quantum-circuit error loss using Clifford sampling
• Quantum Chaos and Circuit Parameter Optimization
• Applications and resource reductions in measurement-based variational quantum eigensolvers
• Quantum simulation from the bottom up: the case of rebits
• Abstraqt: Analysis of Quantum Circuits via Abstract Stabilizer Simulation
• A Solvable Model of Quantum Darwinism-Encoding Transitions
• Intrinsic mixed state topological order in a stabilizer system under stochastic decoherence: Strong-to-weak spontaneous symmetry breaking from percolation point of view
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing
• Complementarity and Entanglement in Quantum Information Theory
• Observability of fidelity decay at the Lyapunov rate in few-qubit quantum simulations
• The Gauge Theory of Measurement-Based Quantum Computation
• Classical realization of the quantum Deutsch algorithm
• Qubit assignment using time reversal
• With a Few Square Roots, Quantum Computing is as Easy as Π
• Towards a Minimal Stabilizer ZX-calculus
• Understanding the Quantum Computational Speed-up via De-quantisation
• Feynman-path type simulation using stabilizer projector decomposition of unitaries
• Quantum circuits with classically simulable operator scrambling
• Computing quantum magic of state vectors
• New techniques for bounding stabilizer rank
• Is the SIC Outcome There When Nobody Looks?
• Control landscapes for high-fidelity generation of C-NOT and C-PHASE gates with coherent and environmental driving
• Quantum Darwinism and the spreading of classical information in non-classical theories
• Automatic Test Pattern Generation for Robust Quantum Circuit Testing
• Counting stabiliser codes for arbitrary dimension
• Hands-on Introduction to Randomized Benchmarking
• Partition Function Estimation: Quantum and Quantum-Inspired Algorithms
• Dynamical phase transitions of information flow in random quantum circuits
• Normalizer Circuits and Quantum Computation
• Decoherence and Quantum Error Correction for Quantum Computing and Communications
• On the average-case complexity of learning output distributions of quantum circuits
• Multireference error mitigation for quantum computation of chemistry
• Generating $k$ EPR-pairs from an $n$-party resource state
• Supercomputer simulations of transmon quantum computers
• Error Correction for Reliable Quantum Computing
• Measurement-Driven Transitions between Area Law Phases
• Clifford circuit based heuristic optimization of fermion-to-qubit mappings
• Measurement-based interleaved randomised benchmarking using IBM processors
• Clifford Orbits from Cayley Graph Quotients
• Decoding quantum error correction with Ising model hardware
• Entanglement spectrum of matchgate circuits with universal and non-universal resources
• Exotic equilibration dynamics on a 1-D quantum CNOT gate lattice
• Abelian Hypergroups and Quantum Computation
• Transforming graph states via Bell state measurements
• Wigner's Theorem for stabilizer states and quantum designs
• Magic Boundaries of 3D Color Codes
• Applications of differential geometry and representation theory to description of quantum correlations
• Quantum Lego and XP Stabilizer Codes
• Planar Floquet Codes
• Monte Carlo Simulation of Operator Dynamics and Entanglement in Dual-Unitary Circuits
• BGLS: A Python Package for the Gate-by-Gate Sampling Algorithm to Simulate Quantum Circuits
• Quantum Goppa Codes over Hyperelliptic Curves
• Classical Coding Approaches to Quantum Applications
• The decomposition of an arbitrary $2^w\times 2^w$ unitary matrix into signed permutation matrices
• Quantum collapse as undecidable proposition in an Everettian multiverse
• Twenty years of quantum contextuality at USTC
• On character table of Clifford groups
• Partition of 3-qubits using local gates
• On The Stabilizer Formalism And Its Generalization
• Classical simulators of quantum computers and no-go theorems
• A local-realistic theory for fermions
• Proceedings 13th International Conference on Quantum Physics and Logic
• Theory-independent monitoring of the decoherence of a superconducting qubit with generalized contextuality
• The ABC of Deutsch-Hayden Descriptors
• Plaquette Models, Cellular Automata, and Measurement-induced Criticality
• Reduced Sampling Overhead for Probabilistic Error Cancellation by Pauli Error Propagation
• The magic of top quarks
• Interference in the Heisenberg Picture of Quantum Field Theory, Local Elements of Reality and Fermions
• Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
• Fault-tolerant Quantum Error Correction Using a Linear Array of Emitters
• Four qubits generated by Clifford gates
• Classical simulation of qubit by a new hardware design and its applications
• Hyperspheres and control of spin chains
• Distilling GHZ States using Stabilizer Codes
• Information Bounds on phase transitions in disordered systems
• Optimized Clifford Noise Reduction: Theory, Simulations and Experiments
• Explicitly Quantum-parallel Computation by Displacements