Accessible Quantum Gates on Classical Stabilizer Codes

With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting s designed to address a single dominant error type. Here, we consider [n,k,d]-classical stabilizer s addressing bit-flip errors where n, k, and d are the numbers of physical and logical qubits, and the code distance, respectively. We prove that operations essential for achieving a universal logical gate set necessarily require complex unitary circuits to be implemented. Specifically, these implementation circuits either consists of h layers of r-transversal operations on c code blocks such that c^{h-1}r^{h}≥d or of h gates, each operating on at most r physical qubits on the same code block, such that hr≥d. Similar constraints apply not only to classical codes designed to correct phase-flip errors, but also to quantum stabilizer codes tailored to biased noise. This motivates a closer examination of alternative logical gate constructions using, e.g., magic state distillation and cultivation within the framework of biased-noise stabilizer codes.

Authors

Institutions

Publication Details

Journal
Physical Review Letters
Published
2025-12-24
DOI
https://doi.org/10.1103/h741-4678
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accessible Quantum Gates on Classical Stabilizer Codes

Hugo Jacinto, Anonymous, Nicolas Sangouard
Physical Review Letters
Quantum Computing Algorithms and Architecture
article

Accessible Quantum Gates on Classical Stabilizer Codes

Hugo Jacinto, Anonymous, Nicolas Sangouard
article en

Abstract

With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting s designed to address a single dominant error type. Here, we consider [n,k,d]-classical stabilizer s addressing bit-flip errors where n, k, and d are the numbers of physical and logical qubits, and the code distance, respectively. We prove that operations essential for achieving a universal logical gate set necessarily require complex unitary circuits to be implemented. Specifically, these implementation circuits either consists of h layers of r-transversal operations on c code blocks such that c^{h-1}r^{h}≥d or of h gates, each operating on at most r physical qubits on the same code block, such that hr≥d. Similar constraints apply not only to classical codes designed to correct phase-flip errors, but also to quantum stabilizer codes tailored to biased noise. This motivates a closer examination of alternative logical gate constructions using, e.g., magic state distillation and cultivation within the framework of biased-noise stabilizer codes.

Physical Review LettersVol. 136(3)
University of Geneva (CH), State Innovation Exchange (US), Institut de Physique Théorique (FR)
Openalex Percentile: Top 18%
Quantum Computing Algorithms and Architecture
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.

Accessible Quantum Gates on Classical Stabilizer Codes — Hugo Jacinto, Anonymous, et al. · Physical Review Letters (2025) | TGRS Research Map | TGRS