Complexity of Local Quantum Circuits under Nonunital Noise

It is widely accepted that noisy quantum devices are limited to logarithmic depth circuits unless midcircuit measurements and error correction are employed. However, this conclusion holds only for unital error channels, such as depolarizing noise. Building on the idea of the “quantum refrigerator” Ben-Or [Quantum refrigerator, arXiv1301.1995 (2013)], we improve upon previous results and show that geometrically local circuits in the presence of nonunital noise, in any dimension <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"><a:mi>d</a:mi><a:mo>≥</a:mo><a:mspace width="0.2em"/><a:mn>1</a:mn></a:math>, can correct errors without midcircuit measurements and extend computation to any depth, with only polylogarithmic overhead in the depth and the number of qubits. This implies that local quantum dynamics subjected to sufficiently weak nonunital noise are computationally universal and nearly as hard to simulate as noiseless dynamics. Additionally, we quantify the contraction property of local random circuits in the presence of nonunital noise.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-07-16
DOI
https://doi.org/10.1103/xwz2-wfr4
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Complexity of Local Quantum Circuits under Nonunital Noise

Kunal Sharma, Karl J. Friston
1 citations
PRX Quantum
Quantum Computing Algorithms and Architecture
2.48
article

Complexity of Local Quantum Circuits under Nonunital Noise

Kunal Sharma, Karl J. Friston
article en
1 citations

Abstract

It is widely accepted that noisy quantum devices are limited to logarithmic depth circuits unless midcircuit measurements and error correction are employed. However, this conclusion holds only for unital error channels, such as depolarizing noise. Building on the idea of the “quantum refrigerator” Ben-Or [Quantum refrigerator, arXiv1301.1995 (2013)], we improve upon previous results and show that geometrically local circuits in the presence of nonunital noise, in any dimension <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"><a:mi>d</a:mi><a:mo>≥</a:mo><a:mspace width="0.2em"/><a:mn>1</a:mn></a:math>, can correct errors without midcircuit measurements and extend computation to any depth, with only polylogarithmic overhead in the depth and the number of qubits. This implies that local quantum dynamics subjected to sufficiently weak nonunital noise are computationally universal and nearly as hard to simulate as noiseless dynamics. Additionally, we quantify the contraction property of local random circuits in the presence of nonunital noise.

PRX QuantumVol. 6(3)
IBM Research - Almaden (US), IBM Research - Thomas J. Watson Research Center (US)
Affordable and clean energy
Openalex Percentile: Top 9%
Quantum Computing Algorithms and Architecture
2.48
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.

Complexity of Local Quantum Circuits under Nonunital Noise — Kunal Sharma, Karl J. Friston · PRX Quantum (2025) | TGRS Research Map | TGRS