Quantum error correction for long chains of trapped ions

We propose a model for quantum computing with long chains of trapped ions and we design quantum error correction schemes for this model. The main components of a quantum error correction scheme are the quantum code and a quantum circuit called the syndrome extraction circuit, which is executed to perform error correction with this code. In this work, we design syndrome extraction circuits tailored to our ion chain model, a syndrome extraction tuning protocol to optimize these circuits, and we construct new quantum codes that outperform the state-of-the-art for chains of about <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>50</mml:mn> </mml:math> qubits. To establish a baseline under the ion chain model, we simulate the performance of surface codes and bivariate bicycle (BB) codes equipped with our optimized syndrome extraction circuits. Then, we propose a new variant of BB codes defined by weight-five measurements, that we refer to as BB5 codes and we identify BB5 codes that achieve a better minimum distance than any BB codes with the same number of logical qubits and data qubits, such as a <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mo stretchy="false">[</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mn>48</mml:mn> <mml:mo>,</mml:mo> <mml:mn>4</mml:mn> <mml:mo>,</mml:mo> <mml:mn>7</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">]</mml:mo> </mml:math> BB5 code. For a physical error rate of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mn>10</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>&amp;#x2212;</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> </mml:math> , the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mo stretchy="false">[</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mn>48</mml:mn> <mml:mo>,</mml:mo> <mml:mn>4</mml:mn> <mml:mo>,</mml:mo> <mml:mn>7</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">]</mml:mo> </mml:math> BB5 code achieves a logical error rate per logical qubit of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>5</mml:mn> <mml:mo>&amp;#x22C5;</mml:mo> <mml:msup> <mml:mn>10</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>&amp;#x2212;</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> </mml:msup> </mml:math> , which is four times smaller than the best BB code in our baseline family. It also achieves the same logical error rate per logical qubit as the distance-7 surface code but using four times fewer physical qubits per logical qubit.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2025-11-27
DOI
https://doi.org/10.22331/q-2025-11-27-1920
Citations
3
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
7.44
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum error correction for long chains of trapped ions

Nicolas Delfosse, Min Ye
3 citations
Quantum
Quantum Computing Algorithms and Architecture
7.44
article

Quantum error correction for long chains of trapped ions

Nicolas Delfosse, Min Ye
article en
3 citations

Abstract

We propose a model for quantum computing with long chains of trapped ions and we design quantum error correction schemes for this model. The main components of a quantum error correction scheme are the quantum code and a quantum circuit called the syndrome extraction circuit, which is executed to perform error correction with this code. In this work, we design syndrome extraction circuits tailored to our ion chain model, a syndrome extraction tuning protocol to optimize these circuits, and we construct new quantum codes that outperform the state-of-the-art for chains of about <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>50</mml:mn> </mml:math> qubits. To establish a baseline under the ion chain model, we simulate the performance of surface codes and bivariate bicycle (BB) codes equipped with our optimized syndrome extraction circuits. Then, we propose a new variant of BB codes defined by weight-five measurements, that we refer to as BB5 codes and we identify BB5 codes that achieve a better minimum distance than any BB codes with the same number of logical qubits and data qubits, such as a <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mo stretchy="false">[</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mn>48</mml:mn> <mml:mo>,</mml:mo> <mml:mn>4</mml:mn> <mml:mo>,</mml:mo> <mml:mn>7</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">]</mml:mo> </mml:math> BB5 code. For a physical error rate of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mn>10</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>&amp;#x2212;</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> </mml:math> , the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mo stretchy="false">[</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mn>48</mml:mn> <mml:mo>,</mml:mo> <mml:mn>4</mml:mn> <mml:mo>,</mml:mo> <mml:mn>7</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">]</mml:mo> </mml:math> BB5 code achieves a logical error rate per logical qubit of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>5</mml:mn> <mml:mo>&amp;#x22C5;</mml:mo> <mml:msup> <mml:mn>10</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>&amp;#x2212;</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> </mml:msup> </mml:math> , which is four times smaller than the best BB code in our baseline family. It also achieves the same logical error rate per logical qubit as the distance-7 surface code but using four times fewer physical qubits per logical qubit.

QuantumVol. 9
IonQ (United States) (US)
Openalex Percentile: Top 3%
Quantum Computing Algorithms and Architecture
7.44
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.