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

arXiv:2012.13395

Changing the Local-Dimension of an Entanglement-Assisted Stabilizer Code Removes Entanglement Need

Lane G. Gunderman

Published Dec 24, 2020• 0 citations
arXivHTMLPDF

Abstract

Having protected quantum information is essential to perform quantum computations. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular this procedure removes the need for shared entanglement in entanglement-assisted quantum error-correcting codes, which is a result which could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.

DOI
10.48550/arxiv.2012.13395

Related papers

Local-dimension-invariant qudit stabilizer codes

Lane G. Gunderman

Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.

arXiv:1910.08122•Physical Review A•May 28, 2020•14 citations

Degenerate local-dimension-invariant stabilizer codes and an alternative bound for the distance preservation condition

Lane G. Gunderman

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and, in particular, that degenerate stabilizer codes can have their distance also promised upon sufficiently large local dimension as well as an alternative bound on the local dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.

arXiv:2110.15274•Physical Review A•Apr 14, 2022•5 citations

Quantum error correction and fault-tolerant quantum computation

Todd A. Brun, Ching–Yi Lai

Quantum computers need to be protected by quantum error-correcting codes against decoherence. One of the most interesting and useful classes of quantum codes is the class of quantum stabilizer codes. Entanglement-assisted (EA) quantum codes are a class of stabilizer codes that make use of preshared entanglement between the sender and the receiver. We provide several code constructions for entanglement-assisted quantum codes. The MacWilliams identity for quantum codes leads to linear programming bounds on the minimum distance. We find new constraints on the simplified stabilizer group and the logical group, which help improve the linear programming bounds on entanglement-assisted quantum codes. The results also can be applied to standard stabilizer codes. In the real world, quantum gates are faulty. To implement quantum computation fault-tolerantly, quantum codes with certain properties are needed. We first analyze Knill's postselection scheme in a two-dimensional architecture. The error performance of this scheme is better than other known concatenated codes. Then we propose several methods to protect syndrome extraction against measurement errors.

•Jan 1, 2013•0 citations

Encoding of Nonbinary Entanglement-Unassisted and Assisted Stabilizer Codes

Priya J. Nadkarni, Shayan Srinivasa Garani

Quantum coding schemes over qudits using preshared entanglement between the encoder and decoder can provide better error correction capability than without it. In this article, we develop procedures for constructing encoding operators for entanglement-unassisted and entanglement-assisted qudit stabilizer codes over Fpk, with p prime and k ≥ 1 from first principles, generalizing prior works on qubit-based codes and codes that work over Fp. We also provide quantum encoding architectures based on the proposed encoding procedures using one and two qudit gates, useful toward realizing coded quantum computing and communication systems using qudits.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•16 citations

Puncturing for Adaptive Entanglement-Assisted Stabilizer Codes

Nicolai Peder Bülow Pedersen, Jakob Kaltoft Søndergaard, Jaron Skovsted Gundersen +2 more

Quantum error-correcting codes are essential for reliable quantum communication. The achievable parameters can be improved by using entanglement-assisted stabilizers at the cost of consuming pre-shared Bell pairs. If the availability of such Bell pairs is intermittent, the ability to adapt the code to available resources is beneficial. That is, to pick a single mother code that can be adapted to different entanglement budgets. To achieve this, we extend an existing puncturing construction for standard/unassisted stabilizers to the entanglement-assisted setting through a three-step procedure: Interpreting the code as an unassisted stabilizer, puncturing a receiver-side qubit, and recovering an entanglement-assisted representation. This procedure reduces the number of required Bell pairs by one while preserving the number of transmitted and logical qubits. We derive a bound on the resulting distance loss and establish conditions for preserving the original code distance. Finally, we analyse distinct, randomly generated, entanglement-assisted stabilizers with five to eight transmitted qubits. Of these codes, 14.75% have a greater distance than their associated unassisted representations. Among this subset, 81.4% admit at least one puncturing choice that preserves the original entanglement-assisted distance. These results illustrate how puncturing can reduce entanglement requirements while maintaining code distance.

quant-pharXiv:2609.36273•Sep 30, 2026•0 citations

The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes

Kao-Yueh Kuo, Ching–Yi Lai

Quantum error-correcting codes are used to protect quantum information from decoherence. A raw state is mapped, by an encoding circuit, to a codeword so that the most likely quantum errors from a noisy quantum channel can be removed after a decoding process.A good encoding circuit should have some desired features, such as low depth, few gates, and so on. In this paper, we show how to practically implement an encoding circuit of gate complexity O(n(n - k + c)/ log n) for an [[n, k; c]] quantum stabilizer code with the help of c pairs of maximally-entangled states. For the special case of an [[n, k]] stabilizer code with c = 0, the encoding complexity is O(n(n-k)/ log n), which is previously known to be O(n2/ log n). For c > 0, this suggests that the benefits from shared entanglement come at an additional cost of encoding complexity.Finally we discuss decoding of entanglement-assisted quantum stabilizer codes and extend previously known computational hardness results on decoding quantum stabilizer codes.

arXiv:1903.10013•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2019•9 citations
Having protected quantum information is essential to perform quantum computations. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and in particular this procedure removes the need for shared entanglement in entanglement-assisted quantum error-correcting codes, which is a result which could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.
Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.
One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and, in particular, that degenerate stabilizer codes can have their distance also promised upon sufficiently large local dimension as well as an alternative bound on the local dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.
Quantum computers need to be protected by quantum error-correcting codes against decoherence. One of the most interesting and useful classes of quantum codes is the class of quantum stabilizer codes. Entanglement-assisted (EA) quantum codes are a class of stabilizer codes that make use of preshared entanglement between the sender and the receiver. We provide several code constructions for entanglement-assisted quantum codes. The MacWilliams identity for quantum codes leads to linear programming bounds on the minimum distance. We find new constraints on the simplified stabilizer group and the logical group, which help improve the linear programming bounds on entanglement-assisted quantum codes. The results also can be applied to standard stabilizer codes. In the real world, quantum gates are faulty. To implement quantum computation fault-tolerantly, quantum codes with certain properties are needed. We first analyze Knill's postselection scheme in a two-dimensional architecture. The error performance of this scheme is better than other known concatenated codes. Then we propose several methods to protect syndrome extraction against measurement errors.
Quantum coding schemes over qudits using preshared entanglement between the encoder and decoder can provide better error correction capability than without it. In this article, we develop procedures for constructing encoding operators for entanglement-unassisted and entanglement-assisted qudit stabilizer codes over Fpk, with p prime and k ≥ 1 from first principles, generalizing prior works on qubit-based codes and codes that work over Fp. We also provide quantum encoding architectures based on the proposed encoding procedures using one and two qudit gates, useful toward realizing coded quantum computing and communication systems using qudits.
Quantum error-correcting codes are essential for reliable quantum communication. The achievable parameters can be improved by using entanglement-assisted stabilizers at the cost of consuming pre-shared Bell pairs. If the availability of such Bell pairs is intermittent, the ability to adapt the code to available resources is beneficial. That is, to pick a single mother code that can be adapted to different entanglement budgets. To achieve this, we extend an existing puncturing construction for standard/unassisted stabilizers to the entanglement-assisted setting through a three-step procedure: Interpreting the code as an unassisted stabilizer, puncturing a receiver-side qubit, and recovering an entanglement-assisted representation. This procedure reduces the number of required Bell pairs by one while preserving the number of transmitted and logical qubits. We derive a bound on the resulting distance loss and establish conditions for preserving the original code distance. Finally, we analyse distinct, randomly generated, entanglement-assisted stabilizers with five to eight transmitted qubits. Of these codes, 14.75% have a greater distance than their associated unassisted representations. Among this subset, 81.4% admit at least one puncturing choice that preserves the original entanglement-assisted distance. These results illustrate how puncturing can reduce entanglement requirements while maintaining code distance.
Quantum error-correcting codes are used to protect quantum information from decoherence. A raw state is mapped, by an encoding circuit, to a codeword so that the most likely quantum errors from a noisy quantum channel can be removed after a decoding process.A good encoding circuit should have some desired features, such as low depth, few gates, and so on. In this paper, we show how to practically implement an encoding circuit of gate complexity O(n(n - k + c)/ log n) for an [[n, k; c]] quantum stabilizer code with the help of c pairs of maximally-entangled states. For the special case of an [[n, k]] stabilizer code with c = 0, the encoding complexity is O(n(n-k)/ log n), which is previously known to be O(n2/ log n). For c > 0, this suggests that the benefits from shared entanglement come at an additional cost of encoding complexity.Finally we discuss decoding of entanglement-assisted quantum stabilizer codes and extend previously known computational hardness results on decoding quantum stabilizer codes.