Recognition: unknown
Doubled Color Codes
read the original abstract
We show how to perform a fault-tolerant universal quantum computation in 2D architectures using only transversal unitary operators and local syndrome measurements. Our approach is based on a doubled version of the 2D color code. It enables a transversal implementation of all logical gates in the Clifford+T basis using the gauge fixing method proposed recently by Paetznick and Reichardt. The gauge fixing requires six-qubit parity measurements for Pauli operators supported on faces of the honeycomb lattice with two qubits per site. Doubled color codes are promising candidates for the experimental demonstration of logical gates since they do not require state distillation. Secondly, we propose a Maximum Likelihood algorithm for the error correction and gauge fixing tasks that enables a numerical simulation of logical circuits in the Clifford+T basis. The algorithm can be used in the online regime such that a new error syndrome is revealed at each time step. We estimate the average number of logical gates that can be implemented reliably for the smallest doubled color code and a toy noise model that includes depolarizing memory errors and syndrome measurement errors.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
A solvable model of 3d quantum gravity
A solvable 3d quantum gravity model is defined by summing Virasoro TQFT copies over all topologies, shown to be dual to a 2d CFT ensemble and to exhibit semiclassical features such as cured negative density of states ...
-
Near-Term Reduction in Nonlocal Gate Count from Distributed Logical Qubits
Qubit allocation techniques for distributed color-code logical qubits achieve a 10% reduction in nonlocal gates that scales with more qubits, plus evaluations of methods for universal gate sets including a logical-swa...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.