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

Stabilizer codes : encoding schemes and applications

Shiyu Shi

Published Jan 1, 2016• 0 citations
OpenAlex

Related papers

Generation and Decoding of Random Sparse Stabilizer Codes

Stefan Krastanov, Liang Jiang

Bulletin of the American Physical Society•Mar 9, 2018•0 citations

Encoding Subsystem Codes with and without Noisy Gauge Qubits

Pradeep Kiran Sarvepalli, Andreas Klappenecker

In this paper, we investigate a rather neglected aspect of subsystem codes viz. that of encoding. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use the known results on encoding of stabilizer codes. Along the way we also show how Clifford codes can be encoded. These encoding schemes can tolerate initialization errors on the gauge qubits. This tolerance can be traded for reduced encoding complexity.

International Conference on Quantum, Nano and Micro Technologies (ICQNM)•Feb 1, 2009•3 citations

Quantum algorithms for state preparation and data classification based on stabilizer codes

Pejman Jouzdani, H. Arslan Hashim, Eduardo R. Mucciolo

Quantum error correction (QEC) is a way to protect quantum information against noise. It consists of encoding input information into entangled quantum states known as the code space. Furthermore, to classify if the encoded information is corrupted or intact, a step known as syndrome detection is performed. For stabilizer codes, this step consists of measuring a set of stabilizer operators. In this paper, inspired by the QEC approach, and specifically stabilizer codes, we propose a prototype quantum circuit model for classification of classical data. The core quantum circuit can be considered as a quantum perceptron where the classification is based on syndrome detection. In this proposal, a quantum perceptron is realized by one stabilizer as part of a stabilizer code, while a quantum neural network (QNN) layer is realized by a stabilizer code which consists of many stabilizers. The concatenation of stabilizer codes results in complex QNNs. The QNN is trained by performing measurements and optimization of a set of parametrized stabilizers. We demonstrate the concept numerically. In this paper we also consider the first challenge to most applications of quantum computers, including data classification, which is to load data into the memory of the quantum computer. This loading amounts to representing the data as a quantum state, i.e., quantum state preparation. An exact amplitude encoding algorithm requires a circuit of exponential depth. We introduce an alternative recursive algorithm which approximates amplitude encoding with only a polynomial number of elementary gates. We name it the recursive approximate-scheme algorithm.

arXiv:2309.10087•Physical Review A•Feb 6, 2024•0 citations

The construction method of stabilizer codes for continuous variables

Liping Lin, Chun-Hui Huang

Journal of Electronics (China)•May 1, 2011•0 citations

New stabilizer codes from the construction of dual-containing matrix-product codes

Meng Cao, Jianlian Cui

Finite Fields and Their Applications•Jan 23, 2020•12 citations

Scheme for constructing graphs associated with stabilizer quantum codes

Carlo Cafaro, Damian Markham, Peter van Loock

We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code; second, the canonical form of the CWS code is uncovered; third, the input vertices are attached to the graphs. To check the effectiveness of the scheme, we discuss several graphical constructions of various useful stabilizer codes characterized by single and multi-qubit encoding operators. In particular, the error-correcting capabilities of such quantum codes are verified in graph-theoretic terms as originally advocated by Schlingemann and Werner. Finally, possible generalizations of our scheme for the graphical construction of both (stabilizer and nonadditive) nonbinary and continuous-variable quantum codes are briefly addressed.

•Apr 1, 2015•0 citations
Quantum error correction (QEC) is a way to protect quantum information against noise. It consists of encoding input information into entangled quantum states known as the code space. Furthermore, to classify if the encoded information is corrupted or intact, a step known as syndrome detection is performed. For stabilizer codes, this step consists of measuring a set of stabilizer operators. In this paper, inspired by the QEC approach, and specifically stabilizer codes, we propose a prototype quantum circuit model for classification of classical data. The core quantum circuit can be considered as a quantum perceptron where the classification is based on syndrome detection. In this proposal, a quantum perceptron is realized by one stabilizer as part of a stabilizer code, while a quantum neural network (QNN) layer is realized by a stabilizer code which consists of many stabilizers. The concatenation of stabilizer codes results in complex QNNs. The QNN is trained by performing measurements and optimization of a set of parametrized stabilizers. We demonstrate the concept numerically. In this paper we also consider the first challenge to most applications of quantum computers, including data classification, which is to load data into the memory of the quantum computer. This loading amounts to representing the data as a quantum state, i.e., quantum state preparation. An exact amplitude encoding algorithm requires a circuit of exponential depth. We introduce an alternative recursive algorithm which approximates amplitude encoding with only a polynomial number of elementary gates. We name it the recursive approximate-scheme algorithm.
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code; second, the canonical form of the CWS code is uncovered; third, the input vertices are attached to the graphs. To check the effectiveness of the scheme, we discuss several graphical constructions of various useful stabilizer codes characterized by single and multi-qubit encoding operators. In particular, the error-correcting capabilities of such quantum codes are verified in graph-theoretic terms as originally advocated by Schlingemann and Werner. Finally, possible generalizations of our scheme for the graphical construction of both (stabilizer and nonadditive) nonbinary and continuous-variable quantum codes are briefly addressed.