相关论文: Floquet implementation of a 3d fermionic toric cod…
Subsystem quantum error-correcting codes typically involve measuring a sequence of non-commuting parity check operators. They can sometimes exhibit greater fault-tolerance than conventional subspace codes, which use commuting checks.…
We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. These codes have weight-two check operators, a finite encoding rate and can be decoded efficiently with minimum-weight perfect matching.…
Quantum data is susceptible to decoherence induced by the environment and to errors in the hardware processing it. A future fault-tolerant quantum computer will use quantum error correction (QEC) to actively protect against both. In the…
Bosonic codes offer a hardware-efficient approach to encoding and protecting quantum information with a single continuous-variable bosonic system. In this paper, we introduce a new universal quantum gate set composed of only one type of…
Bosonic codes represent a promising route toward quantum error correction in continuous-variable systems, with direct relevance to experimental platforms such as circuit QED and optomechanics. However, their preparation and stabilization…
We introduce homological measurement, a framework for measuring the logical Pauli operators encoded in CSS stabilizer codes. The framework is based on the algebraic description of such codes as chain complexes. Protocols such as lattice…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
Hybridizing different physical systems or degrees of freedom offers significant advantages for realizing practical, universal, scalable, and fault-tolerant quantum computation (FTQC). Here, we propose optical FTQC schemes with low squeezing…
Stabilizer codes form an important class of quantum error correcting codes which have an elegant theory, efficient error detection, and many known examples. Constructing stabilizer codes of length $n$ is equivalent to constructing subspaces…
In this paper, we theoretically study the Floquet engineering of two dimensional photonic waveguide arrays in three types of lattices: honeycomb lattice with Kekule distortion, breathing square lattice and breathing Kagome lattice. The…
Quantum computers face significant challenges from quantum deviations or coherent noise, particularly during gate operations, which pose a complex threat to the efficacy of quantum error correction (QEC) protocols. In this study, we…
Product code construction is a powerful tool for constructing quantum stabilizer codes, which serve as a promising paradigm for realizing fault-tolerant quantum computation. Furthermore, the natural mapping between stabilizer codes and the…
Implementation of high-fidelity gate operations on integrated-qubit systems is of vital importance for fault-tolerant quantum computation. Qubit frequency allocation is an essential part of improving control fidelity. A metric for qubit…
There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We…
In the typical implementation of a quantum error-correcting code, each stabilizer is measured by entangling one or more ancilla qubits with the data qubits and measuring the ancilla qubits to deduce the value of the stabilizer. Recently,…
We construct a three-dimensional Calderbank-Shor-Steane (CSS) stabilizer code on the Face-Centered Cubic (FCC) lattice. Physical qubits reside on the edges of the lattice (coordination $K=12$); X-stabilizers act on octahedral voids and…
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…
Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an…
The recent years have seen a growing interest in quantum codes in three dimensions (3D). One of the earliest proposed 3D quantum codes is the 3D toric code. It has been shown that 3D color codes can be mapped to 3D toric codes. The 3D toric…
The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing…