Fast algorithms for classical specifications of stabiliser states and Clifford gates
The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of many classical algorithms in quantum information, e.g. for...
Saved in:
Main Authors: | Nadish de Silva, Wilfred Salmon, Ming Yin |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-01-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2025-01-08-1586/pdf/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
by: Yifei Wang, et al.
Published: (2024-12-01) -
A graph-state based synthesis framework for Clifford isometries
by: Timothée Goubault de Brugière, et al.
Published: (2025-01-01) -
Hyperholomorphic Function Theory and Clifford Analyticity
by: Kwang Ho Shon, et al.
Published: (2014-01-01) -
Clifford's Ethic of Belief and Maximum Extreme Reasoning
by: Ghasem Pourhassan, et al.
Published: (2017-10-01) -
Relief Package: Stabilisation of Expectations
by: Michael Hüther
Published: (2022-10-01)