Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This paper establishes the first rigorously proven lower bound for positive quantum capacity in qubit depolarizing channels using a 45-copy input state, surpassing previous floating-point estimates. By reducing all computational claims to finite big-integer comparisons verifiable by an independent tool, it resolves long-standing numerical ambiguities regarding competing code states. This advancement provides a mathematically sound benchmark for quantum error correction thresholds essential for reliable fault-tolerant systems.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

A certified lower bound on the quantum-capacity threshold of the depolarizing channel

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2608.15870v1 Announce Type: new Abstract: The noise threshold below which the qubit depolarizing channel retains positive quantum capacity has been studied since 1996, and every improvement to date -- most recently the record of Agarwal et al. -- rests on floating-point evaluation of the coherent information. We give the first proven positivity results in this regime: an explicit 45-copy rank-two input state A, published as a 1,472-byte witness, with certified $I_c>0$ at the exact rational $p=16239/250000=0.064956$ (per-Pauli convention; total error rate $3p=0.194868$), beyond the best previously reported numerical value. Because the depolarizing family is a semigroup under composition, fixed-input coherent information is nonincreasing in $p$ on $[0,1/4]$, so a single certified point extends to the entire interval below it. The same machinery confines the positivity boundaries of A and of the strongest public state of Agarwal et al. to disjoint rational intervals separated by more than $1/25000$ -- to our knowledge the first proven ordering of two competing code states. Every computational claim in the paper reduces to a finite list of big-integer comparisons, checkable by a dependency-free few-hundred-line verifier whose soundness rests on three self-contained half-page lemmas. Payloads, certificates, and verifier accompany the paper as a supplementary artifact.

Abstract:The noise threshold below which the qubit depolarizing channel retains positive quantum capacity has been studied since 1996, and every improvement to date -- most recently the record of Agarwal et al. -- rests on floating-point evaluation of the coherent information. We give the first proven positivity results in this regime: an explicit 45-copy rank-two input state A, published as a 1,472-byte witness, with certified $I_c>0$ at the exact rational $p=16239/250000=0.064956$ (per-Pauli convention; total error rate $3p=0.194868$), beyond the best previously reported numerical value. Because the depolarizing family is a semigroup under composition, fixed-input coherent information is nonincreasing in $p$ on $[0,1/4]$, so a single certified point extends to the entire interval below it. The same machinery confines the positivity boundaries of A and of the strongest public state of Agarwal et al. to disjoint rational intervals separated by more than $1/25000$ -- to our knowledge the first proven ordering of two competing code states. Every computational claim in the paper reduces to a finite list of big-integer comparisons, checkable by a dependency-free few-hundred-line verifier whose soundness rests on three self-contained half-page lemmas. Payloads, certificates, and verifier accompany the paper as a supplementary artifact.

11 pages, 2 tables. Verification artifact: DOI https://doi.org/10.5281/zenodo.21962925

arXiv:2608.15870 [quant-ph]

(or arXiv:2608.15870v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.15870 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 293 cuvinte

Subiecte conexe