.png){kind=icon}
.png){kind=icon}
Return
Fault-tolerant quantum computing with the parity code and biased-noise qubits
.png){kind=icon}
OA
AI
A
B
M
DOI：10.1103/PhysRevApplied.23.044032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a fault-tolerant universal quantum computing architecture based on a code concatenation of biased-noise qubits and the parity architecture. The parity architecture can be understood as a low-density parity-check code tailored specifically to obtain any desired logical connectivity from nearest-neighbor physical interactions. The code layout can be dynamically adjusted to algorithmic requirements on the fly. This allows for implementations with any desired code distance with a universal set of fault-tolerant gates. In addition to the previously explored toolsets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme supports codes with lower physical qubit overhead than the repetition code at the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest-neighbor connectivity on a two-dimensional square lattice.
Keywords:
COMPUTATION
Journal
IF:
4.4
Papers:
7.1K
Citations:
2.8W
Organization
Cited Papers