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

AIP conference proceedings

Implementing stabilizer codes by linear optics

Peter van Loock, Damian Markham, Timothy C. Ralph, Ping Koy Lam

Published Jan 1, 2011• 9 citations
Publisher

Abstract

In this contribution, we propose linear optical realizations of arbitrary stabilizer quantum error correction (QEC) codes in any dimension, including discrete and continuous quantum variables. Our protocols use graph states to encode arbitrary logical states in a systematic way. In this fashion, the hardest part of the encoding procedure (i.e., the generation of multi‐party correlations robust against local errors) is shifted offline into the preparation of the graph‐state ancilla.

DOI
10.1063/1.3630191

Related papers

Geometric graph-theoretic aspects of quantum stabilizer codes

Carlo Cafaro

Abstract We propose a systematic procedure for the construction of graphs associated with binary quantum stabilizer codes. The procedure is characterized by means of the following three step process. First, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code. Second, the canonical form of the CWS code is determined and third, the input vertices are attached to the graphs. In order to verify the effectiveness of the procedure, we implement the Gottesman stabilizer code characterized by multi-qubit encoding operators for the resource-efficient error correction of arbitrary single-qubit errors. Finally, the error-correcting capabilities of the Gottesman eight-qubit quantum stabilizer code is verified in graph-theoretic terms as originally advocated by Schlingemann and Werner.

arXiv:2206.09726•Physica Scripta•Jun 8, 2022•0 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.

arXiv:1407.2777•Jul 10, 2014•8 citations

Generating foliated quantum error-correcting codes with quantum optics

F. Brunel, Miller Eaton, Hussain Zaidi +1 more

We present a graph generation algorithm, using quantum optical circuits, for general continuous-variable cluster states of arbitrary dimension. We describe its application to the large-scale generation of the foliated toric code for quantum error correction.

Conference on Lasers and Electro-Optics•Jan 1, 2024•0 citations

Entanglement-assisted quantum error correction with linear optics

Mark M. Wilde, Hari Krovi, Todd A. Brun

We construct a theory of continuous-variable entanglement-assisted quantum error correction. We present an example of a continuous-variable entanglement-assisted code that corrects for an arbitrary single-mode error. We also show how to implement encoding circuits using passive optical devices, homodyne measurements, feedforward classical communication, conditional displacements, and off-line squeezers.

arXiv:0705.4314•Physical Review A•Nov 9, 2007•24 citations

Codeword Stabilized Codes From m -Uniform Graph States

Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth +2 more

An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical n,k,d≥m+1 binary linear code with certain additional properties, we show that pure [n,k,m+1]]2 quantum error-correcting codes (QECCs) can be constructed within the codeword stabilized (CWS) code framework. As illustrations, we construct pure [[22r-1,22r-2r-3,3]]2 and [[(24r-1)2,(24r-1)2-32r-7,5]]2 QECCs. We also give measurement-based protocols for encoding into code states and for recovery of logical qubits from code states.

arXiv:2405.06142•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2025•0 citations

Graph-theoretic approach to quantum error correction

Robert R. Vandermolen, Duncan Wright

We investigate a class of quantum error-correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum errors. In this framework, we represent the algebraic conditions for error correction in terms of edge avoidance between graphs providing a visual representation of the interplay between errors and error-correcting codes. Most importantly, this framework supports the development of quantum codes that correct against a predetermined set of errors, in contrast to current methods. A heuristic algorithm is presented, providing steps to develop codes that correct against an arbitrary noisy channel. We benchmark the correction capability of reflexive stabilizer codes for the case of single-qubit errors by comparison to existing stabilizer codes that are widely used. In addition, we present two instances of optimal encodings: an optimal encoding for fully correlated noise, which achieves a higher encoding rate than previously known, and a minimal encoding for single-qudit errors on a four-state system..

arXiv:2110.08414•Physical Review A•Mar 29, 2022•5 citations
In this contribution, we propose linear optical realizations of arbitrary stabilizer quantum error correction (QEC) codes in any dimension, including discrete and continuous quantum variables. Our protocols use graph states to encode arbitrary logical states in a systematic way. In this fashion, the hardest part of the encoding procedure (i.e., the generation of multi‐party correlations robust against local errors) is shifted offline into the preparation of the graph‐state ancilla.
Abstract We propose a systematic procedure for the construction of graphs associated with binary quantum stabilizer codes. The procedure is characterized by means of the following three step process. First, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code. Second, the canonical form of the CWS code is determined and third, the input vertices are attached to the graphs. In order to verify the effectiveness of the procedure, we implement the Gottesman stabilizer code characterized by multi-qubit encoding operators for the resource-efficient error correction of arbitrary single-qubit errors. Finally, the error-correcting capabilities of the Gottesman eight-qubit quantum stabilizer code is verified in graph-theoretic terms as originally advocated by Schlingemann and Werner.
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.
An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical n,k,d≥m+1 binary linear code with certain additional properties, we show that pure [n,k,m+1]]2 quantum error-correcting codes (QECCs) can be constructed within the codeword stabilized (CWS) code framework. As illustrations, we construct pure [[22r-1,22r-2r-3,3]]2 and [[(24r-1)2,(24r-1)2-32r-7,5]]2 QECCs. We also give measurement-based protocols for encoding into code states and for recovery of logical qubits from code states.
We investigate a class of quantum error-correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum errors. In this framework, we represent the algebraic conditions for error correction in terms of edge avoidance between graphs providing a visual representation of the interplay between errors and error-correcting codes. Most importantly, this framework supports the development of quantum codes that correct against a predetermined set of errors, in contrast to current methods. A heuristic algorithm is presented, providing steps to develop codes that correct against an arbitrary noisy channel. We benchmark the correction capability of reflexive stabilizer codes for the case of single-qubit errors by comparison to existing stabilizer codes that are widely used. In addition, we present two instances of optimal encodings: an optimal encoding for fully correlated noise, which achieves a higher encoding rate than previously known, and a minimal encoding for single-qudit errors on a four-state system..