Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians

Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>y</mml:mi></mml:math> classical code and explicitly constructs the corresponding QEC code. Our framework can be seen to generalize the CSS codes, and goes beyond the stabilizer formalism (Fig. 1). A concrete advantage is that the desirable properties of a classical code are automatically incorporated in the design of the resulting quantum code. We reify the theory by various illustrations some of which outperform the best previous constructions. We then introduce a local quantum spin-chain Hamiltonian whose ground space we analytically completely characterize. We utilize our framework to demonstrate that the ground space contains explicit quantum codes with linear distance. This side-steps the Bravyi-Terhal no-go theorem.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2024-11-27
DOI
https://doi.org/10.22331/q-2024-11-27-1541
Citations
4
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
1.39

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians

Yingkai Ouyang, Ramis Movassagh
4 citations
Quantum
Quantum Computing Algorithms and Architecture
1.39
article

Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians

Yingkai Ouyang, Ramis Movassagh
article en
4 citations

Abstract

Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>y</mml:mi></mml:math> classical code and explicitly constructs the corresponding QEC code. Our framework can be seen to generalize the CSS codes, and goes beyond the stabilizer formalism (Fig. 1). A concrete advantage is that the desirable properties of a classical code are automatically incorporated in the design of the resulting quantum code. We reify the theory by various illustrations some of which outperform the best previous constructions. We then introduce a local quantum spin-chain Hamiltonian whose ground space we analytically completely characterize. We utilize our framework to demonstrate that the ground space contains explicit quantum codes with linear distance. This side-steps the Bravyi-Terhal no-go theorem.

QuantumVol. 8
Google (United States) (US), IBM (United States) (US), University of Sheffield (GB)
European Commission, QuantERA, Engineering and Physical Sciences Research Council
Openalex Percentile: Top 15%
Quantum Computing Algorithms and Architecture
1.39
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.

Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians — Yingkai Ouyang, Ramis Movassagh · Quantum (2024) | TGRS Research Map | TGRS