Scalable noisy quantum circuits for biased-noise qubits

Abstract In this work, we consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. This property allows us to design a class of noisy Hadamard tests involving entangling and certain non-Clifford gates, which can be conducted reliably with only a polynomial overhead in algorithm repetitions. On the flip side, we also found classical algorithms able to efficiently simulate both the noisy and noiseless versions of our specific variants of the Hadamard test. We propose to use these algorithms as a benchmark of the biasness of the noise at the scale of large circuits. The bias being checked on a full computational task makes our benchmark sensitive to crosstalk or time-correlated errors, which are usually invisible from individual gate tomography. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to 10 6 gates, several orders of magnitude larger than circuits not exploiting a noise-bias. Our benchmark is applicable for an arbitrary noise-bias, beyond Pauli models.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2025-08-26
DOI
https://doi.org/10.1038/s41534-025-01054-5
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

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

Scalable noisy quantum circuits for biased-noise qubits

Michał Oszmaniec, Moein Naseri, Marco Fellous-Asiani, Chandan Datta et al.
1 citations
npj Quantum Information
Quantum Computing Algorithms and Architecture
2.48
article

Scalable noisy quantum circuits for biased-noise qubits

Michał Oszmaniec, Moein Naseri, Marco Fellous-Asiani, Chandan Datta, Alexander Streltsov
article en
1 citations

Abstract

Abstract In this work, we consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. This property allows us to design a class of noisy Hadamard tests involving entangling and certain non-Clifford gates, which can be conducted reliably with only a polynomial overhead in algorithm repetitions. On the flip side, we also found classical algorithms able to efficiently simulate both the noisy and noiseless versions of our specific variants of the Hadamard test. We propose to use these algorithms as a benchmark of the biasness of the noise at the scale of large circuits. The bias being checked on a full computational task makes our benchmark sensitive to crosstalk or time-correlated errors, which are usually invisible from individual gate tomography. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to 10 6 gates, several orders of magnitude larger than circuits not exploiting a noise-bias. Our benchmark is applicable for an arbitrary noise-bias, beyond Pauli models.

npj Quantum InformationVol. 11(1)
Indian Institute of Technology Jodhpur (IN), Center for Theoretical Physics (PL), Institute of Fundamental Technological Research (PL), Heinrich Heine University Düsseldorf (DE), University of Warsaw (PL), Polish Academy of Sciences (PL)
European Commission, Fundacja na rzecz Nauki Polskiej, Bundesministerium für Bildung und Forschung, QuantERA, HORIZON EUROPE Framework Programme, HORIZON EUROPE Marie Sklodowska-Curie Actions
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.