The all-photonic quantum repeater (APQR) is a promising repeater scheme to
realize long-distance quantum communication. For a practical APQR, an
indispensable requirement is the robustness of the repe
Shor and Steane ancilla are two well-known methods for fault-tolerant logical
measurements, which are successful on small codes and their concatenations. On
large quantum low-density-parity-check (LDP
The ground state of Shor-Movassagh chain can be analytically described by the
Motzkin paths. There is no analytical description of the excited states, the
model is not solvable. We prove the integrabi
Fault-tolerant quantum error correction requires the measurement of error
syndromes in a way that minimizes correlated errors on the quantum data. Steane
and Shor ancilla are two well-known methods fo
We present the relevant results and proofs from the theory of continued fractions in detail (even in more detail than in text books) filling the gap to allow a complete comprehension of the algorithm of shor for prime factorization.
We present a fault-tolerant universal gate set consisting of Hadamard and
controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal
non-Clifford gates on these codes are intriguing in t
We study the performance of Bacon-Shor codes, quantum subsystem codes which
are well suited for applications to fault-tolerant quantum memory because the
error syndrome can be extracted by performing
The compass model on a square lattice provides a natural template for
building subsystem stabilizer codes. The surface code and the Bacon-Shor code
represent two extremes of possible codes depending o
The Shor fault-tolerant error correction (FTEC) scheme uses transversal gates
and ancilla qubits prepared in the cat state in syndrome extraction circuits to
prevent propagation of errors caused by ga
A Bacon-Shor code is a subsystem quantum error-correcting code on an $L
\times L$ lattice where the $2(L-1)$ weight-$2L$ stabilizers are usually
inferred from the measurements of $(L-1)^2$ weight-2 ga
This paper explores a new approach to fault-tolerant quantum computing,
relying on quantum polar codes. We consider quantum polar codes of
Calderbank-Shor-Steane type, encoding one logical qubit, whic
Fault-tolerant quantum error correction (QEC) is crucial for unlocking the
true power of quantum computers. QEC codes use multiple physical qubits to
encode a logical qubit, which is protected against
We construct an explicit and solvable toy model for the AdS/CFT
correspondence in the form of an approximate quantum error correction code with
a non-trivial center in the code subalgebra. Specificall
Quantum computers are able to outperform classical algorithms. This was long
recognized by the visionary Richard Feynman who pointed out in the 1980s that
quantum mechanical problems were better solve
Quantum error correction protects fragile quantum information by encoding it
in a larger quantum system whose extra degrees of freedom enable the detection
and correction of errors. An encoded logical
We introduce a continuous family of frustration-free Hamiltonians with
exactly solvable ground states. We prove that the {ground state of our model is
non-degenerate and exhibits} a novel quantum phas
We simulate four quantum error correcting codes under error models inspired
by realistic noise sources in near-term ion trap quantum computers: $T_2$
dephasing, gate overrotation, and crosstalk. We us
Toric varieties and their associated toric codes, as well as determination of
their parameters with intersection theory, are presented in the two dimensional
case.
Linear Secret Sharing Schemes with s