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:1601.05763 · IEEE International Symposium on Information Theory (ISIT)

Codeword stabilized quantum codes for asymmetric channels

Tyler Jackson, Markus Grassl, Bei Zeng

Published Jul 1, 2016• 9 citations
arXivHTMLPDF

Abstract

In this study we present a method that adapts the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. Making use of the the corresponding Pauli error models for amplitude and phase-damping models, we focus on codes that correct one or two amplitude-damping errors. As a result, we are able to exhaustively search for all possible codes up to length 9 by applying local Clifford operations on graph states. With a similar method, we also look at codes for the Pauli error models that detect a single amplitude error and detect multiple phase damping errors. Many new codes with good parameters are found, including non-additive codes and degenerate codes.

DOI
10.1109/isit.2016.7541702

Related papers

High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping

Peter W. Shor, Graeme Smith, John A. Smolin +1 more

We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear error-correcting codes for classical asymmetric channels, with which we systematically construct quantum amplitude damping codes with parameters better than any prior construction known for any block lengthn≥ 8 exceptn=2r-1. We generalize this construction to employ classical codes overGF(3) with which we numerically obtain better performing codes up to length 14. Because the resulting codes are of the codeword stabilized (CWS) type, conceptually simple (though potentially computationally expensive) encoding and decoding circuits are available.

arXiv:0907.5149•IEEE Transactions on Information Theory•Oct 1, 2011•36 citations

Nonbinary codeword-stabilized quantum codes

Xie Chen, Bei Zeng, Isaac L. Chuang

The codeword-stabilized (CWS) quantum code formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes [see A. Cross et al., e-print arXiv:0708.1021], but only for binary states. Here we generalize the CWS framework to the nonbinary case (of both prime and nonprime dimensions) and map the search for nonbinary quantum codes to a corresponding search problem for classical nonbinary codes with specific error patterns. We show that while the additivity properties of nonbinary CWS codes are similar to the binary case, the structural properties of the nonbinary codes differ substantially from the binary case, even for prime dimensions. In particular, we identify specific structure patterns of stabilizer groups, based on which efficient constructions might be possible for codes that encode more dimensions than any stabilizer codes of the same length and distance; similar methods cannot be applied in the binary case. Understanding of these structural properties can help prune the search space and facilitate the identification of good nonbinary CWS codes.

arXiv:0808.3086•Physical Review A•Dec 8, 2008•31 citations

Local Error Correction of Codeword-Stabilized Quantum Codes

Yunfan Li, Ilya I. Dumer, Leonid P. Pryadko

Codeword stabilized (CWS) codes are a general class of quantum codes that includes stabilizer codes and many families of non-additive codes with good parameters. For such a non-additive code correcting all t-qubit errors, we propose an algorithm that employs a single measurement to test all errors located on a given set of t qubits. Compared with exhaustive error screening, this reduces the total number of measurements required for error recovery by a factor of about 3^t.

•Jul 12, 2009•1 citation

Codeword Stabilized Quantum Codes and Their Error Correction

Yunfan Li

Quantum decoherence and errors represent some of the major challenges arising in quantum computations. Quantum error correcting codes protect quantum states against these errors and make quantum computing more reliable. One of the main problems of quantum error correction is the design of feasible decoding algorithms that can simplify error-correction for general quantum codes. The dissertation addresses decoding of general Codeword Stabilized (CWS) codes. This class of quantum codes also includes some other important classes such as additive Stabilizer codes and non-additive Union Stabilizer (USt) codes.We first design a generic error-correcting algorithm for CWS codes and analyze the number of decoding measurements and quantum gates. This algorithm performs exhaustive screening of different error patterns, similar to decoding of classical non-linear codes. For an n-qubit quantum code correcting up to t erroneous qubits, this brute-force approach consecutively tests all correctable error patterns and employs a separate n-qubit measurement in each test.The main result is a new error grouping technique that enables simultaneous testing of large groups of errors in a single measurement. To achieve this reduction, we first proceed with a new error-correction algorithm for the USt codes. Secondly, we design an algorithm that converts generic non-linear CWS codes into the simpler quasi-linear USt codes. Each decoding measurement can then either locate the actual error in a given group of errors or entirely eliminate this group. This technique yields a much simpler algorithm that exponentially reduces the number of measurements about 3^t times in any t-error-correcting CWS code.

•Jan 1, 2010•0 citations

Codeword stabilized quantum codes: Algorithm and structure

Isaac L. Chuang, Andrew W. Cross, Graeme Smith +2 more

The codeword stabilized (CWS) quantum code formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes [IEEE Trans. Inf. Theory 55, 433 (2009)]. This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we provide three structure theorems which reduce the search space, specifying certain admissible and optimal ((n,K,d)) additive codes. In particular, we find that the re does not exist any ((7,3,3)) CWS code though the linear programming bound does not rule it out. The complexity of the CWS-search algorithm is compared with the contrasting method introduced by Aggarwal and Calderbank [IEEE Trans. Inf. Theory 54, 1700 (2008)].

arXiv:0803.3232•Journal of Mathematical Physics•Apr 1, 2009•40 citations

Degenerate Codes and Capacities of Quantum Channels

Tyler Jackson

No quantum system can be perfectly isolated from the environment and, as a result, no physical implementation of quantum information processing tasks can be completely free from noise. The best tool for combating such noise is the use of quantum error correcting codes (QECCs). The general requirements for QECCs have been documented for a while and yet construction of good codes and understanding their effect remains a difficult and active area of study. In this thesis I outline the work I have completed looking into both of these problems. My general technique throughout this work is to first reduce the problem space as much as possible through use of group theory. Then to use numerical methods and bring computational power to bear on the problem. In chapter 2, I investigate the construction of good codes for the amplitude damping channel, using the codeword stabilized quantum code(CWS) framework. Through an exhaustive search method many new codes with better parameters than previously known are found. In chapter 3, I continue constructing good codes for the amplitude damping channel, this time using code concatenation techniques to find results that would be unfeasible to find via an exhaustive search. Finally, chapter 4 broaches the difficult problem of determining if a quantum channel has capacity; the ultimate use of QECCs in a sense. Expanding on the key works done on the problem, I develop the theory surrounding effective noise channels obtained from applying a QECC on multiple uses of a channel in order to determine if capacity exists. Using this framework and making use of computational power available today, these techniques allow us to find many very noisy non-Pauli channels that have positive capacity which previously had not been shown to have capacity.

•May 4, 2017•1 citation
In this study we present a method that adapts the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. Making use of the the corresponding Pauli error models for amplitude and phase-damping models, we focus on codes that correct one or two amplitude-damping errors. As a result, we are able to exhaustively search for all possible codes up to length 9 by applying local Clifford operations on graph states. With a similar method, we also look at codes for the Pauli error models that detect a single amplitude error and detect multiple phase damping errors. Many new codes with good parameters are found, including non-additive codes and degenerate codes.
We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear error-correcting codes for classical asymmetric channels, with which we systematically construct quantum amplitude damping codes with parameters better than any prior construction known for any block lengthn≥ 8 exceptn=2r-1. We generalize this construction to employ classical codes overGF(3) with which we numerically obtain better performing codes up to length 14. Because the resulting codes are of the codeword stabilized (CWS) type, conceptually simple (though potentially computationally expensive) encoding and decoding circuits are available.
The codeword-stabilized (CWS) quantum code formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes [see A. Cross et al., e-print arXiv:0708.1021], but only for binary states. Here we generalize the CWS framework to the nonbinary case (of both prime and nonprime dimensions) and map the search for nonbinary quantum codes to a corresponding search problem for classical nonbinary codes with specific error patterns. We show that while the additivity properties of nonbinary CWS codes are similar to the binary case, the structural properties of the nonbinary codes differ substantially from the binary case, even for prime dimensions. In particular, we identify specific structure patterns of stabilizer groups, based on which efficient constructions might be possible for codes that encode more dimensions than any stabilizer codes of the same length and distance; similar methods cannot be applied in the binary case. Understanding of these structural properties can help prune the search space and facilitate the identification of good nonbinary CWS codes.
Quantum decoherence and errors represent some of the major challenges arising in quantum computations. Quantum error correcting codes protect quantum states against these errors and make quantum computing more reliable. One of the main problems of quantum error correction is the design of feasible decoding algorithms that can simplify error-correction for general quantum codes. The dissertation addresses decoding of general Codeword Stabilized (CWS) codes. This class of quantum codes also includes some other important classes such as additive Stabilizer codes and non-additive Union Stabilizer (USt) codes.We first design a generic error-correcting algorithm for CWS codes and analyze the number of decoding measurements and quantum gates. This algorithm performs exhaustive screening of different error patterns, similar to decoding of classical non-linear codes. For an n-qubit quantum code correcting up to t erroneous qubits, this brute-force approach consecutively tests all correctable error patterns and employs a separate n-qubit measurement in each test.The main result is a new error grouping technique that enables simultaneous testing of large groups of errors in a single measurement. To achieve this reduction, we first proceed with a new error-correction algorithm for the USt codes. Secondly, we design an algorithm that converts generic non-linear CWS codes into the simpler quasi-linear USt codes. Each decoding measurement can then either locate the actual error in a given group of errors or entirely eliminate this group. This technique yields a much simpler algorithm that exponentially reduces the number of measurements about 3^t times in any t-error-correcting CWS code.
The codeword stabilized (CWS) quantum code formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes [IEEE Trans. Inf. Theory 55, 433 (2009)]. This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we provide three structure theorems which reduce the search space, specifying certain admissible and optimal ((n,K,d)) additive codes. In particular, we find that the re does not exist any ((7,3,3)) CWS code though the linear programming bound does not rule it out. The complexity of the CWS-search algorithm is compared with the contrasting method introduced by Aggarwal and Calderbank [IEEE Trans. Inf. Theory 54, 1700 (2008)].
No quantum system can be perfectly isolated from the environment and, as a result, no physical implementation of quantum information processing tasks can be completely free from noise. The best tool for combating such noise is the use of quantum error correcting codes (QECCs). The general requirements for QECCs have been documented for a while and yet construction of good codes and understanding their effect remains a difficult and active area of study. In this thesis I outline the work I have completed looking into both of these problems. My general technique throughout this work is to first reduce the problem space as much as possible through use of group theory. Then to use numerical methods and bring computational power to bear on the problem. In chapter 2, I investigate the construction of good codes for the amplitude damping channel, using the codeword stabilized quantum code(CWS) framework. Through an exhaustive search method many new codes with better parameters than previously known are found. In chapter 3, I continue constructing good codes for the amplitude damping channel, this time using code concatenation techniques to find results that would be unfeasible to find via an exhaustive search. Finally, chapter 4 broaches the difficult problem of determining if a quantum channel has capacity; the ultimate use of QECCs in a sense. Expanding on the key works done on the problem, I develop the theory surrounding effective noise channels obtained from applying a QECC on multiple uses of a channel in order to determine if capacity exists. Using this framework and making use of computational power available today, these techniques allow us to find many very noisy non-Pauli channels that have positive capacity which previously had not been shown to have capacity.