A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra

DOI10.1134/S1995080225607842MaRDI QIDQ7307479zbMATH OpenFDO

Authors

Publication date 31 July 2026

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1995080225607842

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum measurement theory, state operations, state preparations (81P15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68) Channel models (including quantum) in information and communication theory (94A40)

Cites work

• A fast expected time algorithm for Boolean matrix multiplication and transitive closure
• A simplified stabilizer ZX-calculus
• Algorithm 898
• Characterization of non-adaptive Clifford channels
• Fault-tolerant quantum computation with higher-dimensional systems
• Gaussian elimination is not optimal
• Hudson’s theorem for finite-dimensional quantum systems
• Multiparty entanglement in graph states
• Quantum computation and quantum information. 10th anniversary edition
• Quantum systems, channels, information. A mathematical introduction
• Spekkens’ toy model in all dimensions and its relationship with stabiliser quantum mechanics
• Standard form of qudit stabilizer groups
• The axiomatic and the operational approaches to resource theories of magic do not coincide
• Universal quantum computation with ideal Clifford gates and noisy ancillas

This page was built for publication: A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307479)