Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
fault tolerance. Conversions between and verifications of different specifications of stabiliser …
Stabilizer operators and Barnes-Wall lattices
We give a simple description of rectangular matrices that can be implemented by a post-
selected stabilizer circuit. Given a matrix with entries in dyadic cyclotomic number fields …
selected stabilizer circuit. Given a matrix with entries in dyadic cyclotomic number fields …
Decision-tree decoders for general quantum LDPC codes
KR Ott, B Hetényi, ME Beverland - arxiv preprint arxiv:2502.16408, 2025 - arxiv.org
We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary
check matrix, making them broadly applicable for decoding any quantum low-density parity …
check matrix, making them broadly applicable for decoding any quantum low-density parity …
Minimal entanglement for injecting diagonal gates
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by
first distilling magic states in specialised magic-state factories. In the rest of the architecture …
first distilling magic states in specialised magic-state factories. In the rest of the architecture …