Related papers: The Smallest Code with Transversal T
Consider a binary linear code of length $N$, minimum distance $d_{\text{min}}$, transmission over the binary erasure channel with parameter $0 < \epsilon < 1$ or the binary symmetric channel with parameter $0 < \epsilon < \frac12$, and…
Fault-tolerant quantum computing typically requires the transpilation of arbitrary quantum circuits into a finite, universal gate set, such as Clifford+T. As a baseline, Diagonal approximation can be used for synthesizing single-qubit Pauli…
In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of…
The threshold theorem promises a path to fault-tolerant quantum computation, provided the physical error rate is below a critical threshold. While transversal gates efficiently implement logical operations, they propagate errors and can…
Achieving near-term quantum advantage will require accurate estimation of quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum…
The group of transversal gates and the group of local symmetries are important features of quantum error correcting codes and pure quantum states, respectively; the former provides fault-tolerant operations on a code while the latter tells…
It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we construct the first known quantum codes with linear…
We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in suitable LDPC quantum codes using transversal…
We introduce a morphing procedure that can be used to generate new quantum codes from existing quantum codes. In particular, we morph the 15-qubit Reed-Muller code to obtain a $[\![10,1,2]\!]$ code that is the smallest known stabilizer code…
Following the introduction of the task of reference frame error correction, we show how, by using reference frame alignment with clocks, one can add a continuous Abelian group of transversal logical gates to any error-correcting code. With…
Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
We study the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates suitable for entanglement distillation, teleportation and fault-tolerant quantum computation. We…
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. The groups of Pauli and Clifford gates constitute the…
The surface code is currently the leading proposal to achieve fault-tolerant quantum computation. Among its strengths are the plethora of known ways in which fault-tolerant Clifford operations can be performed, namely, by deforming the…
This paper introduces a framework for constructing Calderbank-Shor-Steane (CSS) codes that support fault-tolerant logical transversal $Z$-rotations. Using this framework, we obtain asymptotically good CSS codes that fault-tolerantly realize…
Hardware efficient transpilation of quantum circuits to a quantum devices native gateset is essential for the execution of quantum algorithms on noisy quantum computers. Typical quantum devices utilize a gateset with a single two-qubit…
Quantum computers promise to solve certain problems exponentially faster than possible classically but are challenging to build because of their increased susceptibility to errors. Remarkably, however, it is possible to detect and correct…
Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state…
Historically, a $\sqrt{N}log^{1/2}(N)$ distance barrier for quantum low-density parity-check (LDPC) codes with $N$ qubits persisted for nearly two decades, until the recent discovery of the fibre-bundle code. An open question is whether…