English
Related papers

Related papers: Tradeoff Constructions for Quantum Locally Testabl…

200 papers

Locally recoverable codes (LRCs) with locality parameter $r$ can recover any erased code symbol by accessing $r$ other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems…

Information Theory · Computer Science 2024-11-05 Sandeep Sharma , Vinayak Ramkumar , Itzhak Tamo

Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…

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…

Quantum Physics · Physics 2025-04-15 Eric Sabo , Lane G. Gunderman , Benjamin Ide , Michael Vasmer , Guillaume Dauphinais

A locally recoverable code of locality $r$ over $\mathbb{F}_{q}$ is a code where every coordinate of a codeword can be recovered using the values of at most $r$ other coordinates of that codeword. Locally recoverable codes are efficient at…

Information Theory · Computer Science 2024-06-19 Gustavo Terra Bastos , Angelynn Alvarez , Zachary Flores , Adriana Salerno

The task of preserving entanglement against noises is of crucial importance for both quantum communication and quantum information transfer. To this aim, quantum error correction (QEC) codes may be employed to compensate, at least…

Quantum Physics · Physics 2023-03-21 Alessio Morea , Michele N. Notarnicola , Stefano Olivares

Quantum error-correcting codes (QECCs) sit between noisy quantum hardware and reliable computation, so the code parameters used in practice must be trustworthy. The single number that summarizes a code's strength is its distance, yet…

Quantum Physics · Physics 2026-05-19 Mattias Ehatamm , Yi Lee , Xiaodi Wu , Runzhou Tao

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…

Quantum Physics · Physics 2024-09-18 Yugo Takada , Keisuke Fujii

Quantum error correction codes with non-local connections such as quantum low-density parity-check (qLDPC) incur lower overhead and outperform surface codes on large-scale devices. These codes are not applicable on current superconducting…

We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…

Commutative Algebra · Mathematics 2016-05-25 Edoardo Ballico , Chiara Marcolla

A major challenge in fault-tolerant quantum computation (FTQC) is to reduce both space overhead -- the large number of physical qubits per logical qubit -- and time overhead -- the long physical gate sequences per logical gate. We prove…

Quantum Physics · Physics 2024-12-06 Shiro Tamiya , Masato Koashi , Hayata Yamasaki

Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of…

Quantum Physics · Physics 2022-05-18 Nouédyn Baspin , Anirudh Krishna

Reliable quantum computation requires systematic identification and correction of errors that occur and accumulate in quantum hardware. To diagnose and correct such errors, standard quantum error-correcting protocols utilize…

Quantum Physics · Physics 2025-01-20 Mincheol Park , Nishad Maskara , Marcin Kalinowski , Mikhail D. Lukin

Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…

Information Theory · Computer Science 2020-09-08 Jingjie Lv , Ruihu Li , Yu Yao

Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant number of stabilizers. We study qLDPC codes constructed from…

Quantum Physics · Physics 2022-03-08 Ting-Chun Lin , Min-Hsiu Hsieh

Geometrically local quantum codes, which are error correction codes embedded in $\mathbb{R}^D$ with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to…

Quantum Physics · Physics 2025-07-04 Quinten Eggerickx , Adam Wills , Ting-Chun Lin , Kristiaan De Greve , Min-Hsiu Hsieh

The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will…

Quantum Physics · Physics 2025-06-05 Shubham P. Jain , Victor V. Albert

We perform an extended numerical search for practical fermion-to-qubit encodings with error correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high…

Quantum Physics · Physics 2024-05-29 Fedor Simkovic , Martin Leib , Francisco Revson F. Pereira

The codification in higher dimensional Hilbert Spaces (whose logical basis states are dubbed qudits in analogy with bidimensional qubits) presents various advantages both for Quantum Information applications and for studies on Foundations…

Quantum Physics · Physics 2009-02-27 Marco Genovese , Paolo Traina

Quantum metrology aims to exploit many-body quantum states to achieve parameter-estimation precision beyond the standard quantum limit. For unitary parameter encoding generated by local Hamiltonians, such enhancement is characterized by…

Quantum Physics · Physics 2025-12-24 Junjie Chen , Rui Luo , Yuxuan Yan , You Zhou , Xiongfeng Ma

We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance of such codes are derived. The upper bound is based on the…

Information Theory · Computer Science 2017-02-07 Stanislav Kruglik , Alexey Frolov