Related papers: Stacked codes: universal fault-tolerant quantum co…
The promise of high-rate low-density parity check (LDPC) codes to substantially reduce the overhead of fault-tolerant quantum computation depends on constructing efficient, fault-tolerant implementations of logical gates on such codes.…
An algorithm which encodes the $L\times L$ 2D toric code logical state with a circuit of depth $2L+1$, using only local controlled-NOT($CX$) and Hadamard($H$) gates, is presented.
We propose and simulate the performance of a set of fault-tolerant and constant-depth logical gates on 2D toric codes. This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full…
In recent years, there have been many studies on local stabilizer codes. Under the assumption of translation and scale invariance Yoshida classified such codes. His result implies that translation invariant 2D color codes are equivalent to…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that classical computers cannot accomplish within a reasonable time frame, achieving quantum advantage. However, the vulnerability of…
Quantum random access memories (QRAMs) are pivotal for data-intensive quantum algorithms, but existing general-purpose and domain-specific architectures are hampered by a critical bottleneck: a heavy reliance on non-Clifford gates (e.g.,…
Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal, they can be combined with specially distilled resource…
Fault-tolerant quantum computation (FTQC) schemes using large block codes that encode $k>1$ qubits in $n$ physical qubits can potentially reduce the resource overhead to a great extent because of their high encoding rate. However, the…
Topological subsystem color codes add to the advantages of topological codes an important feature: error tracking only involves measuring 2-local operators in a two dimensional setting. Unfortunately, known methods to compute with them were…
We present an algorithm for manipulating quantum information via a sequence of projective measurements. We frame this manipulation in the language of stabilizer codes: a quantum computation approach in which errors are prevented and…
There have been significant recent advances in constructing theoretical and practical quantum error correcting codes that function well as quantum memories; however, performing fault-tolerant logical gates on these codes is less studied,…
Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Implementing arbitrary FTQC requires the execution of a universal gate set on logical qubits, which is highly challenging.…
We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $\mathit{CCZ}$…
Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed…
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…
Stabilizer states along with Clifford manipulations (unitary transformations and measurements) thereof -- despite being efficiently simulable on a classical computer -- are an important tool in quantum information processing, with…
We introduce a model for a stacked quantum memory made with multi-qubit cells, inspired by multi-level flash cells in classical solid-state drive, and we design quantum error correction codes for this model by generalizing rank-metric codes…
This paper introduces Claycode, a novel 2D scannable code designed for extensive stylization and deformation. Unlike traditional matrix-based codes (e.g., QR codes), Claycodes encode their message in a tree structure. During the encoding…
Estimating and reducing the overhead of fault tolerance (FT) schemes is a crucial step toward realizing scalable quantum computers. Of particular interest are schemes based on two-dimensional (2D) topological codes such as the surface and…