Related papers: Hexagonal matching codes with 2-body measurements
Hybrid quantum-classical algorithms have begun to leverage quantum devices to efficiently represent many-electron wavefunctions, enabling early demonstrations of molecular simulations on real hardware. A key prerequisite for scalable…
Dynamical quantum error-correcting codes (QECC) offer wider possibilities in how one can protect logical quantum information from noise and perform fault-tolerant quantum computation compared to static QECCs. A family of dynamical QECCs…
Quantum computers have the potential to outperform classical computers in a range of computational tasks, such as prime factorisation and unstructured searching. However, real-world quantum computers are subject to noise. Quantifying noise…
The high overhead of fault-tolerant measurement sequences (FTMSs) poses a major challenge for implementing quantum stabilizer codes. Here, we address this problem by constructing efficient FTMSs for the class of quantum Hamming codes…
We demonstrate that small quantum memories, realized via quantum error correction in multi-qubit devices, can benefit substantially by choosing a quantum code that is tailored to the relevant error model of the system. For a biased noise…
It is known that under fixed-rate information constraints, adaptive quantizers can be used to stabilize an open-loop-unstable linear system on $\mathbb{R}^n$ driven by unbounded noise. These adaptive schemes can be designed so that they…
Near term quantum computers suffer from the presence of different noise sources. In order to mitigate for this effect and acquire results with significantly better accuracy, there is the urge of designing efficient error correction or error…
Quantum error-correcting codes (QECCs) require high encoding rate in addition to high threshold unless a sufficiently large number of physical qubits are available. The many-hypercube (MHC) codes defined as the concatenation of the…
We prove by construction that the Bravyi-Poulin-Terhal bound on the spatial density of stabilizer codes does not generalize to stabilizer circuits. To do so, we construct a fault tolerant quantum computer with a coding rate above 5% and…
Quantum error correction offers a promising path for performing quantum computations with low errors. Although a fully fault-tolerant execution of a quantum algorithm remains unrealized, recent experimental developments, along with…
One of the main problems in quantum information systems is the presence of errors due to noise, and for this reason quantum error-correcting codes (QECCs) play a key role. While most of the known codes are designed for correcting generic…
Color codes are promising quantum error correction (QEC) codes because they have an advantage over surface codes in that all Clifford gates can be implemented transversally. However, thresholds of color codes under circuit-level noise are…
We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the stabilizer generators all have weights $O(1)$ and such that $O(1)$ generators act on any given qubit. The number of…
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.…
The pursuit of superconducting-based quantum computers has advanced the fabrication of and experimentation with custom lattices of qubits and resonators. Here, we describe a roadmap to use present experimental capabilities to simulate an…
We introduce and analyze a family of Clifford-deformed bivariate bicycle codes that are tailored for biased noise. Our qLDPC codes are defined on a bipartite hexagonal lattice with limited-range gates and low-weight stabilizers. The code is…
We study the performance of common quantum stabilizer codes in the presence of asymmetric and correlated errors. Specifically, we consider the depolarizing noisy quantum memory channel and perform quantum error correction via the five and…
Variational algorithms have received significant attention in recent years due to their potential to solve practical problems using noisy intermediate-scale quantum (NISQ) devices. A fundamental step of these algorithms is the evaluation of…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
This study explores the qubit mapping through the integration of Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) in quantum error correction (QEC) frameworks. QOSTBCs have gained prominence for…