Related papers: Direct measurement of Bacon-Shor code stabilizers
Stabilizer codes are the most widely studied class of quantum error-correcting codes and form the basis of most proposals for a fault-tolerant quantum computer. A stabilizer code is defined by a set of parity-check operators, which are…
We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code…
We compare Steane's and Shor's syndrome extraction methods on the Bacon-Shor code. We propose a straightforward strategy based on post-selection to prepare the logical $|0\rangle_L$ and $|+\rangle_L$ states of the Bacon-Shor code by using…
We propose a scalable decoding framework for correcting correlated hook errors in stabilizer measurement circuits. Traditional circuit-level decoding attempts to estimate the precise location of faults by constructing an extended Tanner…
Quantum subsystem codes have been shown to improve error-correction performance, ease the implementation of logical operations on codes, and make stabilizer measurements easier by decomposing stabilizers into smaller-weight gauge operators.…
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
High-fidelity decoding of quantum error correction codes relies on an accurate experimental model of the physical errors occurring in the device. Because error probabilities can depend on the context of the applied operations, the error…
Amongst quantum error-correcting codes the surface code has remained of particular promise as it has local and very low-weight checks, even despite only encoding a single logical qubit no matter the lattice size. In this work we discuss new…
In this paper we investigate stabilizer quantum error correction codes using controlled phase rotations of strong coherent probe states. We explicitly describe two methods to measure the Pauli operators which generate the stabilizer group…
We describe a class of "neighboring-blocks" stabilizer quantum error correction codes and demonstrate that such class of codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit…
Designing efficient fault tolerance schemes is crucial for building useful quantum computers. Most standard schemes assume no knowledge of the underlying device noise and rely on general-purpose quantum error-correcting (QEC) codes capable…
The surface code is a powerful quantum error correcting code that can be defined on a 2-D square lattice of qubits with only nearest neighbor interactions. Syndrome and data qubits form a checkerboard pattern. Information about errors is…
The complexity of the error correction circuitry forces us to design quantum error correction codes capable of correcting a single error per error correction cycle. Yet, time-correlated error are common for physical implementations of…
The performance of quantum error correction can be significantly improved if detailed information about the noise is available, allowing to optimize both codes and decoders. It has been proposed to estimate error rates from the syndrome…
We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace…
We construct a family of quantum low-density parity-check codes locally equivalent to higher-dimensional quantum hypergraph-product (QHP) codes. Similarly to QHP codes, the proposed codes have highly redundant sets of low-weight stabilizer…
Although qubit coherence times and gate fidelities are continuously improving, logical encoding is essential to achieve fault tolerance in quantum computing. In most encoding schemes, correcting or tracking errors throughout the computation…
The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the devices that can be realised in the near term, uses…
With quantum devices rapidly approaching qualities and scales needed for fault tolerance, the validity of simplified error models underpinning the study of quantum error correction needs to be experimentally evaluated. In this work, we have…
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes…