English
Related papers

Related papers: A Note on Quantum Hamming Bound

200 papers

Quantum degeneracy in error correction is a feature unique to quantum error correcting codes, unlike their classical counterpart. It allows a quantum error correcting code to correct errors even when they can not uniquely pinpoint the…

Quantum Physics · Physics 2021-08-04 Upendra S. Kapshikar

We define and show how to construct nonbinary quantum stabilizer codes. Our approach is based on nonbinary error bases. It generalizes the relationship between selforthogonal codes over $GF_{4}$ and binary quantum codes to one between…

Quantum Physics · Physics 2007-05-23 Alexei Ashikhmin , Emanuel Knill

Topological stabilizer codes with different spatial dimensions have complementary properties. Here I show that the spatial dimension can be switched using gauge fixing. Combining 2D and 3D gauge color codes in a 3D qubit lattice,…

Quantum Physics · Physics 2016-05-13 H. Bombin

Quantum speed limits provide ultimate bounds on the time required to transform one quantum state into another. Here, we extend the notion of quantum speed limits to collections of quantum states, investigating the time for converting a…

Quantum Physics · Physics 2024-04-10 Moein Naseri , Chiara Macchiavello , Dagmar Bruß , Paweł Horodecki , Alexander Streltsov

Quantum error-correcting code for higher dimensional systems can, in general, be directly constructed from the codes for qubit systems. What remains unknown is whether there exist efficient code design techniques for higher dimensional…

Quantum Physics · Physics 2020-08-04 Ritajit Majumdar , Susmita Sur-Kolay

We show how procedures which can correct phase and amplitude errors can be directly applied to correct errors due to quantum entanglement. We specify general criteria for quantum error correction, introduce quantum versions of the Hamming…

Quantum Physics · Physics 2007-05-23 A. Ekert , C. Macchiavello

Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough. To make this error correction competitive information about the specific noise is required. Traditionally, this…

Quantum Physics · Physics 2021-04-07 Thomas Wagner , Hermann Kampermann , Dagmar Bruß , Martin Kliesch

Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits,…

Quantum Physics · Physics 2026-05-26 Daiki Komoto , Kenta Kasai

Variational algorithms may enable classically intractable simulations on near-future quantum computers. However, their potential is limited by hardware errors. It is therefore crucial to develop efficient ways to mitigate these errors.…

Quantum Physics · Physics 2019-05-29 Sam McArdle , Xiao Yuan , Simon Benjamin

Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…

Quantum Physics · Physics 2024-09-09 Jing-Lei Xia

In this work, we study quantum error-correcting codes obtained by using Steane-enlargement. We apply this technique to certain codes defined from Cartesian products previously considered by Galindo et al. in [4]. We give bounds on the…

Information Theory · Computer Science 2020-05-26 René Bødker Christensen , Olav Geil

In quantum error-correcting code (QECC), many quantum operations and measurements are necessary to correct errors in logical qubits. In the stabilizer formalism, which is widely used in QECC, generators $G_i (i=1,2,..)$ consist of multiples…

Quantum Physics · Physics 2016-01-27 Tetsufumi Tanamoto

We analyze the performance of quantum stabilizer codes, one of the most important classes for practical implementations, on both symmetric and asymmetric quantum channels. To this aim, we first derive the weight enumerator (WE) for the…

Quantum Physics · Physics 2025-12-17 Diego Forlivesi , Lorenzo Valentini , Marco Chiani

We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit to avoid resource escalation typical of multi-qubit codes. These codes can be customized to the specific physical errors on the qudit,…

Quantum Physics · Physics 2024-10-16 Matteo Mezzadri , Alessandro Chiesa , Luca Lepori , Stefano Carretta

A promising strategy to protect quantum information from noise-induced errors is to encode it into the low-energy states of a topological quantum memory device. However, readout errors from such memory under realistic settings is less…

Quantum Physics · Physics 2024-01-15 Weishun Zhong , Oles Shtanko , Ramis Movassagh

Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for…

Quantum Physics · Physics 2014-03-26 Alastair Kay

Entangled qubit can increase the capacity of quantum error correcting codes based on stabilizer codes. In addition, by using entanglement quantum stabilizer codes can be construct from classical linear codes that do not satisfy the…

Quantum Physics · Physics 2015-05-30 Jeonghwan Shin , Jun Heo , Todd A. Brun

We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of…

Quantum Physics · Physics 2026-04-06 Mohamad Mousa , Amit Jamadagni , Eugene Dumitrescu

When incorporated in quantum sensing protocols, quantum error correction can be used to correct for high frequency noise, as the correction procedure does not depend on the actual shape of the noise spectrum. As such, it provides a powerful…

Quantum Physics · Physics 2015-11-18 David A. Herrera-Martí , Tuvia Gefen , Dorit Aharonov , Nadav Katz , Alex Retzker

Given $r\geq 3$ and $2^{r-1}+1\leq n< 2^{r}-1$, an $[n,n-r,3]$ shortened Hamming code that can detect a maximal number of double errors is constructed. The optimality of the construction is proven.

Discrete Mathematics · Computer Science 2011-05-24 Mario Blaum , Sugata Sanyal
‹ Prev 1 4 5 6 7 8 10 Next ›