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

Quantum science and technology

Constructions of QCCs

Giuliano G. La Guardia

Published Jan 1, 2020• 0 citations
Publisher
DOI
10.1007/978-3-030-48551-1_7

Related papers

Efficient Construction of Involutory Linear Combinations of Anticommuting Pauli Generators for Large-Scale Iterative Qubit Coupled Cluster Calculations

Ilya G. Ryabinkin, Andrew Jena, Scott N. Genin

We present an efficient method for construction of a fully anticommutative set of Pauli generators (elements of the Pauli group) from a commutative set of operators that are composed exclusively from Pauli x̂ operators (purely X generators) and sorted by an associated numerical measure, such as absolute energy gradients. Our approach uses the Gauss–Jordan elimination applied to a binary matrix that encodes the set of X generators to bring it to the reduced row-echelon form, followed by the construction of an anticommutative system in a standard basis by means of a modified Jordan–Wigner transformation and returning to the original basis. The algorithm complexity is linear in the size of the X set and quadratic in the number of qubits. The resulting anticommutative sets are used to construct the qubit coupled cluster Ansatz with involutory linear combinations of anticommuting Paulis (QCC-ILCAP) proposed in J. Chem. Theory Comput. 2021, 17 (1), 66–78. We applied the iterative qubit coupled cluster method with the QCC-ILCAP Ansatz to calculations of ground-state potential energy curves for symmetric stretching of the water molecule (36 qubits) and dissociation of N 2 (56 qubits).

arXiv:2301.10690•Journal of Chemical Theory and Computation•Feb 23, 2023•8 citations

QCL-C: Relaxations and Special Cases

Kluwer Academic Publishers eBooks•May 31, 2006•0 citations

Constructions of Quantum Convolutional Codes

Markus Grassl, Martin Rötteler

We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum convolutional code by applying a product code construction to an arbitrary classical convolutional code and an arbitrary quantum block code. We show that the resulting codes have highly structured and efficient encoders. Furthermore, we show that the resulting quantum circuits have finite depth, independent of the lengths of the input stream, and show that this depth is polynomial in the degree and frame size of the code.

arXiv:quant-ph/0703182•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•40 citations

QCA Background

Trailokya Nath Sasamal, Ashutosh Kumar Singh, Anand Mohan

Studies in computational intelligence•Dec 16, 2019•4 citations

THE QUASI-CLASSICAL CASE

L.D. LANDAU, E.M. LIFSHITZ

Elsevier eBooks•Jan 1, 1977•11 citations

Constructing Quantum Convolutional Codes via Difference Triangle Sets

Vahid Nourozi, David G. M. Mitchell

In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers X(D) and Z(D) that commute (symplectic orthogonality), while keeping the stabilizers sparse and encoding memory small. To construct Z(D), we show that one can use a reflection of the DTS indices of X(D), where X(D) corresponds to a classical convolutional self-orthogonal code (CSOC) constructed from strong DTS supports. The motivation of this approach is to provide a constructive design that guarantees a prescribed minimum distance. We provide numerical results demonstrating the construction for a variety of code rates.

arXiv:2602.13505•International Conference on Communications•May 24, 2026•0 citations
We present an efficient method for construction of a fully anticommutative set of Pauli generators (elements of the Pauli group) from a commutative set of operators that are composed exclusively from Pauli x̂ operators (purely X generators) and sorted by an associated numerical measure, such as absolute energy gradients. Our approach uses the Gauss–Jordan elimination applied to a binary matrix that encodes the set of X generators to bring it to the reduced row-echelon form, followed by the construction of an anticommutative system in a standard basis by means of a modified Jordan–Wigner transformation and returning to the original basis. The algorithm complexity is linear in the size of the X set and quadratic in the number of qubits. The resulting anticommutative sets are used to construct the qubit coupled cluster Ansatz with involutory linear combinations of anticommuting Paulis (QCC-ILCAP) proposed in J. Chem. Theory Comput. 2021, 17 (1), 66–78. We applied the iterative qubit coupled cluster method with the QCC-ILCAP Ansatz to calculations of ground-state potential energy curves for symmetric stretching of the water molecule (36 qubits) and dissociation of N 2 (56 qubits).
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum convolutional code by applying a product code construction to an arbitrary classical convolutional code and an arbitrary quantum block code. We show that the resulting codes have highly structured and efficient encoders. Furthermore, we show that the resulting quantum circuits have finite depth, independent of the lengths of the input stream, and show that this depth is polynomial in the degree and frame size of the code.
In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers X(D) and Z(D) that commute (symplectic orthogonality), while keeping the stabilizers sparse and encoding memory small. To construct Z(D), we show that one can use a reflection of the DTS indices of X(D), where X(D) corresponds to a classical convolutional self-orthogonal code (CSOC) constructed from strong DTS supports. The motivation of this approach is to provide a constructive design that guarantees a prescribed minimum distance. We provide numerical results demonstrating the construction for a variety of code rates.