Physical Review Letters · 2024 · 33 citations · 39 references
ComputingComputer SciencePhysicsQuantum ComputingQuantum MechanicsTheoretical PhysicsQuantum CircuitsQuantum ComputationQuantum GatesQuantum SimulationQuantum StatesClifford GatesNon-clifford GatesQuantum Circuit ModelQuantum Circuit SimulationTensor Network SimulationUniversal Quantum Computation
Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this Letter, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simulation of more states, raising some interesting questions on the representation power of tensor networks and the quantum properties of resources such as entanglement and magic, and support our claims with simulations.
39
Fault-tolerant quantum computation by anyons
Alexei Kitaev · Annals of Physics · 2003 · 7.3K citations · Full text
Computing, Computer Science, Physics +12
Quantum supremacy using a programmable superconducting processor
Nature · 2019 · 7K citations · Full text
Computing, Computer Science, Physics +14
Robert Raussendorf, Hans J. Briegel · Physical Review Letters · 2001 · 4.5K citations
Rigorous results on valence-bond ground states in antiferromagnets
Ian Affleck, Tom Kennedy, Élliott H. Lieb et al. · Physical Review Letters · 1987 · 2.2K citations