Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel

Alexei Ashikhmin

Published Jun 1, 2020• 2 citations
Publisher

Abstract

We consider the probability of decoding error, equivalently the fidelity, of finite length quantum codes assuming quantum information transmission via qubit erasure channel. First, we obtain an analytical expression on this probability via combinatorial invariants of quantum codes. Next, we derive a generalization of the MacWilliams identities for those invariants and use them to formulate a linear programming optimization problem, which allows us to obtain lower bounds on the number of unrecoverable sets of i erasures and the probability of decoding error. Our example shows that the obtain bounds can be very tight. Next, we derive upper (achievability) bounds on the probability of decoding error for finite length stabilizer and CSS codes. CSS codes have many advantages for practical applications. Our results show that CSS codes of small lengths, like 100 qubits, visibly lose in performance to generic stabilizer codes.

DOI
10.1109/isit44484.2020.9174340

Related papers

Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes

Alexei Ashikhmin

In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve the fidelity bounds by estimating the quantum enumerators of expurgated ensembles of stabilizer and CSS codes. Finally, we derive fidelity bounds in the asymptotic regime when the code length tends to infinity. These results tell us which code rate we can afford for achieving a target fidelity with codes of a given length. The results also show that in symmetric depolarizing channel a typical stabilizer code has better performance, in terms of fidelity and code rate, compared with a typical CSS codes, and that balanced CSS codes significantly outperform other CSS codes. Asymptotic results demonstrate that CSS codes have a fundamental performance loss compared with stabilizer codes.

arXiv:1702.02591•IEEE Transactions on Information Theory•Mar 11, 2014•6 citations

Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel

Nicolas Delfosse, Gilles Zémor

Using combinatorial arguments, we determine an upper bound on achievable rates of stabilizer codes used over the quantum erasure channel. This allows us to recover the no-cloning bound on the capacity of the quantum erasure channel, $R \leq 1-2p$, for stabilizer codes: we also derive an improved upper bound of the form $R \leq 1-2p-D(p)$ with a function $D(p)$ that stays positive for $0<p<1/2$ and for any family of stabilizer codes whose generators have weights bounded from above by a constant -- low density stabilizer codes. We obtain an application to percolation theory for a family of self-dual tilings of the hyperbolic plane. We associate a family of low density stabilizer codes with appropriate finite quotients of these tilings. We then relate the probability of percolation to the probability of a decoding error for these codes on the quantum erasure channel. The application of our upper bound on achievable rates of low density stabilizer codes gives rise to an upper bound on the critical probability for these tilings.

arXiv:1205.7036•Quantum Information and Computation•Sep 1, 2013•37 citations

Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators

Ching–Yi Lai, Alexei Ashikhmin

Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.

arXiv:1602.00413•IEEE Transactions on Information Theory•Jun 2, 2017•107 citations

The n-shot classical capacity of the quantum erasure channel

Matteo Rosati

Abstract We compute the n-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.

Journal of Physics Communications•Aug 1, 2024•2 citations

Quantum error detection .II. Bounds

Alexei Ashikhmin, Alexander Barg, Emanuel H. Knill +1 more

In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1.

arXiv:quant-ph/9906131•IEEE Transactions on Information Theory•May 1, 2000•53 citations

Performance of CSS Quantum Codes in Asymmetric Channels

Alexei Ashikhmin

In this work, we derive achievability (upper) bounds for the logical error probability (LEP) of finite-length CSS codes for two asymmetric channels. In other words, we prove the existence of [[n, k]] CSS codes whose LEP does not exceed certain bounds that depend on the code and channel parameters. The bounds are derived with the help of finding the average LEPs of CSS codes from different code ensembles.The obtained bounds allow us to optimize code parameters for specific quantum channels. We show that such optimization leads to drastic performance improvements in asymmetric channels. We further show that expurgating bad codes from the ensemble of all CSS codes also leads to large performance improvements in certain channels.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•1 citation
We consider the probability of decoding error, equivalently the fidelity, of finite length quantum codes assuming quantum information transmission via qubit erasure channel. First, we obtain an analytical expression on this probability via combinatorial invariants of quantum codes. Next, we derive a generalization of the MacWilliams identities for those invariants and use them to formulate a linear programming optimization problem, which allows us to obtain lower bounds on the number of unrecoverable sets of i erasures and the probability of decoding error. Our example shows that the obtain bounds can be very tight. Next, we derive upper (achievability) bounds on the probability of decoding error for finite length stabilizer and CSS codes. CSS codes have many advantages for practical applications. Our results show that CSS codes of small lengths, like 100 qubits, visibly lose in performance to generic stabilizer codes.
In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve the fidelity bounds by estimating the quantum enumerators of expurgated ensembles of stabilizer and CSS codes. Finally, we derive fidelity bounds in the asymptotic regime when the code length tends to infinity. These results tell us which code rate we can afford for achieving a target fidelity with codes of a given length. The results also show that in symmetric depolarizing channel a typical stabilizer code has better performance, in terms of fidelity and code rate, compared with a typical CSS codes, and that balanced CSS codes significantly outperform other CSS codes. Asymptotic results demonstrate that CSS codes have a fundamental performance loss compared with stabilizer codes.
Using combinatorial arguments, we determine an upper bound on achievable rates of stabilizer codes used over the quantum erasure channel. This allows us to recover the no-cloning bound on the capacity of the quantum erasure channel, R≤1−2pR \leq 1-2pR≤1−2p, for stabilizer codes: we also derive an improved upper bound of the form R≤1−2p−D(p)R \leq 1-2p-D(p)R≤1−2p−D(p) with a function D(p)D(p)D(p) that stays positive for 0<p<1/20<p<1/20<p<1/2 and for any family of stabilizer codes whose generators have weights bounded from above by a constant -- low density stabilizer codes. We obtain an application to percolation theory for a family of self-dual tilings of the hyperbolic plane. We associate a family of low density stabilizer codes with appropriate finite quotients of these tilings. We then relate the probability of percolation to the probability of a decoding error for these codes on the quantum erasure channel. The application of our upper bound on achievable rates of low density stabilizer codes gives rise to an upper bound on the critical probability for these tilings.
Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.
Abstract We compute the n-shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n. The protocols are in full product form, i.e. no entanglement is needed either at the encoder or decoder to attain the capacity, and they explicitly adapt to the transition between different error regimes as the erasure probability increases. Finally, we show that our upper and lower bounds on the capacity are tighter than those obtainable from the general theory of finite-size capacity via generalized divergences.
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1.
In this work, we derive achievability (upper) bounds for the logical error probability (LEP) of finite-length CSS codes for two asymmetric channels. In other words, we prove the existence of [[n, k]] CSS codes whose LEP does not exceed certain bounds that depend on the code and channel parameters. The bounds are derived with the help of finding the average LEPs of CSS codes from different code ensembles.The obtained bounds allow us to optimize code parameters for specific quantum channels. We show that such optimization leads to drastic performance improvements in asymmetric channels. We further show that expurgating bad codes from the ensemble of all CSS codes also leads to large performance improvements in certain channels.