Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A sharp restoration threshold under depolarizing noise for a qubit recovery bound: a preregistered reproduction test of a derived crossing point

Tristen Pierson

Published Oct 11, 2026• 0 citations
Publisher
DOI
10.17605/osf.io/jrhua

Related papers

A graded monotone dose-response of the qubit recovery gap under depolarizing noise: a preregistered reproduction test of a derived curve shape

Tristen Pierson

•Oct 11, 2026•0 citations

A monotone graded dilution of a qubit recovery-bound violation under reference disorder: a preregistered reproduction test of a derived ensemble profile

Tristen Pierson

•Oct 11, 2026•0 citations

Fault tolerance of quantum circuits with tensor networks and symplectic geometry

Soham Ghosh, Holger Boche, Andrew Tanggara

We develop an operator-algebraic framework for analyzing fault tolerance in quantum circuits and establish necessary and sufficient conditions for exact recovery of the ideal computation under a prescribed noise model. For prescribed circuit families and noise models, we derive a semidefinite program (SDP) based test whose infeasibility certifies that there does not exist any recovery map restoring its intended operation. For non-adaptive stabilizer circuits, analyzing the stabilizer symmetries of its components with symplectic geometry, we obtain closed-form detection and logical-effect matrices that characterize circuit distance algebraically. Applied to a finite Hastings--Haah honeycomb Floquet-code circuit, these matrices certify the dynamical encoding of two logical qubits and distance four under Pauli noise including measurement errors. Using these matrices, we then derive MacWilliams identities for circuit weight enumerators and obtain linear-programming (LP) upper bounds on circuit distance. Output-code constraints give additional Singleton-like bounds. Under independent and identically distributed (i.i.d.) depolarizing noise, the weight enumerators determine decoder failure probabilities and yield upper bounds on circuit pseudothresholds. Finally, we derive LP distance bounds for families of flag syndrome-extraction circuits specified by their CNOT orderings, by incorporating the $t$-flag criterion as additional linear constraints to the distance-bounding LP. An analytical CSS Hamming-code benchmark yields a tight distance-three bound attained by the Chao--Reichardt one-flag construction.

quant-pharXiv:2610.03429•Oct 5, 2026•0 citations

A sharp dephasing onset for a qubit recovery bound: a preregistered reproduction test of a derived crossing point

Tristen Pierson

Preregistered reproduction test of a derived prediction. For a qubit state and a faithful reference state, the ordinary Petz recovery map obeys a quantitative recovery bound whose residual is non-negative when the bound holds. This study evaluates the residual under a dephasing dose family - interpolating between the identity channel and computational-basis pinching, with the Petz map rebuilt at each dose. A derivation predicts the residual is protected on a long initial interval and crosses zero exactly once, late in the dose range, with a specified sign pattern, while rotated Petz maps satisfy the bound with margin at every dose. A frozen evaluation protocol tests the sign pattern, the single crossing, and the rotated-map control.

•Oct 11, 2026•0 citations

A depolarizing choir sings in Gaussian harmony

Rabsan Galib Ahmed, Sujeet Bhalerao, Sungjai Lee +4 more

We study the noise threshold for positive quantum capacity for the qubit depolarizing channel. We explore analytically the action of the qubit depolarizing channel on the symmetric subspaces of the input qubits, in the limit of asymptotically many uses of the channel. We observe the emergence of a bosonic Gaussian channel. Furthermore, the codes previously developed for the depolarizing channel can be translated to codes for the emergent Gaussian channel, and it is easier to further optimize these codes for the simpler emergent Gaussian channel. Translating these codes back to the depolarizing channel leads to extremely good input states for the coherent information of the depolarizing channel producing new lower bounds on the noise threshold for positive capacity. In addition to improved lower bounds on the threshold, this newly found link between depolarizing noise and Gaussian channels offers a novel perspective contributing to our understanding of these symmetric codes.

quant-pharXiv:2609.39747•Oct 1, 2026•1 citation

A recoverable qubit at maximal nonclassical discrimination

Xinjun Wang

•Oct 24, 2026•0 citations
We develop an operator-algebraic framework for analyzing fault tolerance in quantum circuits and establish necessary and sufficient conditions for exact recovery of the ideal computation under a prescribed noise model. For prescribed circuit families and noise models, we derive a semidefinite program (SDP) based test whose infeasibility certifies that there does not exist any recovery map restoring its intended operation. For non-adaptive stabilizer circuits, analyzing the stabilizer symmetries of its components with symplectic geometry, we obtain closed-form detection and logical-effect matrices that characterize circuit distance algebraically. Applied to a finite Hastings--Haah honeycomb Floquet-code circuit, these matrices certify the dynamical encoding of two logical qubits and distance four under Pauli noise including measurement errors. Using these matrices, we then derive MacWilliams identities for circuit weight enumerators and obtain linear-programming (LP) upper bounds on circuit distance. Output-code constraints give additional Singleton-like bounds. Under independent and identically distributed (i.i.d.) depolarizing noise, the weight enumerators determine decoder failure probabilities and yield upper bounds on circuit pseudothresholds. Finally, we derive LP distance bounds for families of flag syndrome-extraction circuits specified by their CNOT orderings, by incorporating the ttt-flag criterion as additional linear constraints to the distance-bounding LP. An analytical CSS Hamming-code benchmark yields a tight distance-three bound attained by the Chao--Reichardt one-flag construction.
Preregistered reproduction test of a derived prediction. For a qubit state and a faithful reference state, the ordinary Petz recovery map obeys a quantitative recovery bound whose residual is non-negative when the bound holds. This study evaluates the residual under a dephasing dose family - interpolating between the identity channel and computational-basis pinching, with the Petz map rebuilt at each dose. A derivation predicts the residual is protected on a long initial interval and crosses zero exactly once, late in the dose range, with a specified sign pattern, while rotated Petz maps satisfy the bound with margin at every dose. A frozen evaluation protocol tests the sign pattern, the single crossing, and the rotated-map control.
We study the noise threshold for positive quantum capacity for the qubit depolarizing channel. We explore analytically the action of the qubit depolarizing channel on the symmetric subspaces of the input qubits, in the limit of asymptotically many uses of the channel. We observe the emergence of a bosonic Gaussian channel. Furthermore, the codes previously developed for the depolarizing channel can be translated to codes for the emergent Gaussian channel, and it is easier to further optimize these codes for the simpler emergent Gaussian channel. Translating these codes back to the depolarizing channel leads to extremely good input states for the coherent information of the depolarizing channel producing new lower bounds on the noise threshold for positive capacity. In addition to improved lower bounds on the threshold, this newly found link between depolarizing noise and Gaussian channels offers a novel perspective contributing to our understanding of these symmetric codes.