Clifford Gates in the Holant Framework
arXiv:1705.00942
Abstract
We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable functions under the Holant framework.
14 pages
References in corpus (13)
- Efficient classical simulation of slightly entangled quantum computations
- Improved Simulation of Stabilizer Circuits
- A Theory of Fault-Tolerant Quantum Computation
- Classical simulation of quantum many-body systems with a tree tensor network
- Classical simulation of noninteracting-fermion quantum circuits
- Fast simulation of stabilizer circuits using a graph state representation
- Fermionic Linear Optics and Matchgates
- On the simulation of quantum circuits
- Classical simulation of limited-width cluster-state quantum computation
- Quantum matchgate computations and linear threshold gates
- A Holant Dichotomy: Is the FKT Algorithm Universal?
- The Complexity of Holant Problems over Boolean Domain with Non-negative Weights
- Dichotomy for Real Holant Problems