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 two-dimensional-subspace input beats the hashing point of the qudit depolarizing channel: positive single-letter coherent information at p = 0.2910672 for d = 3

Harish Santhanalakshmi Ganesan

Published Oct 20, 2026• 0 citations
Publisher

Abstract

Short note with supporting code and data. For the qudit depolarizing channel N(rho) = (1-p) rho + p I/d, the only achievable rate quoted for d ≥ 3 is the hashing bound (maximally mixed input), which vanishes at p_h(3) = 0.2870867. An input maximally mixed on a two-dimensional subspace does better near the threshold: for one use of the qutrit channel its coherent information has the closed form I_c = 2η((1-p)/2 + p/3) + η(p/3) - η(1-p+p/6) - 5η(p/6) (bits, η(x) = -x log2 x) and is positive for all p < p_2(3), with p_2(3) in [0.29106723603359969, 0.29106723603359988] certified by interval arithmetic. Hence Q > 0 for all p < 0.2910672 (previous documented frontier 0.2870867, gain 3.98e-3), and the hashing expression is not the one-shot coherent information of the channel in a window below threshold for every 3 ≤ d ≤ 64 (certified enclosures for d = 3,4,5,6,8,16). Mechanism: the component leaking out of the code subspace heralds the error (qubit depolarizing channel with a flagged erasure). The input was found by an autonomous AI research agent (EVO harness, Claude Sonnet 5.5 proposers) as a two-qutrit rank-four state and identified by the author as a product of two single-qutrit rank-2 inputs. Multi-copy searches (n ≤ 7 qutrits, rank ≤ 4, including repetition codes inside the subspace) found nothing above p_2(3). Claim boundary: a lower bound on the threshold and on the one-shot coherent information; no capacity value, optimality or priority claim. Files: the note (PDF + LaTeX source), interval certificate script, exact multi-copy evaluator, the agent's state with verification scripts, baselines, the agent's notes and search scripts, SHA-256 sums.

DOI
10.5281/zenodo.23492158

Related papers

Private information of the qubit depolarizing channel beyond the single-use threshold: explicit finite-n witnesses up to p = 0.28467, and what one-way key distillation already implies

Harish Santhanalakshmi Ganesan

Short note with supporting code and data on Open Problem Zoo record op_d2813fe3fcdf09ad (private capacity P of the qubit depolarizing channel Lambda_p(rho) = (1-p) rho + p I/2). The record certifies P > 0 only for p ≤ 0.259824 (via the quantum capacity) and lists positivity on (0.259824, 1/3) as open. Two observations. (1) Published one-way key-distillation results already imply more: the one-way six-state rate with noisy preprocessing (Renes-Smith 2007, Kraus-Gisin-Renner 2005) is a single-use private information of this channel and is positive for p < 0.28223 (QBER = p/2), and the rates of Kern and Renes (2008) with repetition codes of length 250 are positive up to QBER 14.5741%, i.e. p = 0.291482; a short in-band lemma (send the publicly announced syndromes through extra channel uses with a classical code; I(S;B) = H(S) ≥ I(S;E) up to Fano terms) turns any such forward-announcement rate into a Devetak private information over finitely many uses, so P(Lambda_p) > 0 for all p ≤ 0.291482 with no public channel. (2) Explicit finite-n witnesses: ensembles of two classical mixed states on n ≤ 8 qubits whose private information I(X;B) - I(X;E) is positive at p = 0.28336, 0.28372, 0.28405, 0.28437, 0.28466 for n = 4, 5, 6, 7, 8 (thresholds 0.283375 ... 0.284671), above the single-use threshold 0.28223. They were found by an autonomous AI research agent (the depositor's EVO harness); the members are distributions over bit strings whose weights depend only on the Hamming weight, with the second member the bit complement of the first. Verification uses an exact closed-form block decomposition of the environment state's spectrum (no 4^n-dimensional objects); every value is recomputed in 30-digit arithmetic and agrees with double precision to about twelve digits. Negative findings of the same searches: the family is locally optimal within classical ensembles, gains ~0.0003 per added qubit, and general (quantum) members at n ≤ 3 give no gain; the finite-n frontier will not reach the key-distillation frontier at n ≤ 10. Claim boundary: lower bounds on the positivity threshold and on finite-n private informations; no capacity value, optimality or priority claim. Files: the note (PDF + LaTeX), the ensembles as JSON, the exact evaluator and verifier, the high-precision certifier, the agent's notes and search code, SHA-256 sums.

•Oct 21, 2026•0 citations

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

Artus Krohn-Grimberghe

The noise threshold below which the qubit depolarizing channel retains positive quantum capacity has been studied since 1996. The classic constructions come with exact finite formulae, but in every reported threshold to date -- most recently the record of Agarwal et al. -- the final step, the sign of the coherent information at the reported point, is a floating-point evaluation. We give the first exact-arithmetic, independently machine-checkable positivity proofs 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 both the best value printed in the Agarwal et al. paper ($0.064657$) and the strongest state in the same authors' public repository ($\approx 0.064911$), both numerical. 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 the positivity boundaries of two explicit 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.

quant-pharXiv:2608.15870•Aug 18, 2026•2 citations

How Far Can a Qutrit Beat a Qubit on Antipodal Tables? An Exact Qubit Test, Bounds, and a Conjectured Constant for Three Queries

Vasily Psykovsky

Third note in a series on qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations (doi:10.5281/zenodo.24093433, doi:10.5281/zenodo.24121836). Setting: fixed binary measurements, no shared randomness, and tables of antipodal pairs of target expectation vectors. The question: by how much must a qutrit table be shrunk before a qubit can reproduce it? Proved: A qubit reproduces such a table exactly if and only if it factors through 3-dimensional real space with all rows and columns in the unit ball. With at most three queries this is the condition γ₂(T) ≤ 1 on the factorization norm, a single semidefinite program. Every qutrit table has γ₂(T) ≤ 2/√3, while the same argument gives exactly 1 for qubits. The worst-case factor κ(n) never decreases with the number of queries n. For three queries, γ₂(T)² ≥ I(T)/9, where I ≤ 9 is the qubit inequality of the previous note. Averaging a core over relabellings of the measurements can never raise the shrink factor. Certified in exact rational arithmetic (computer-assisted): κ(3) ≥ 1.002813276 and κ(4) ≥ 1.007479. For a fixed rational reference triple A*, close to the numerically best symmetric triple, the shrink factor lies in [1.002813276, 1.00281429]. The upper bound uses a new second-order covering of the direction sphere. Conjectured (not proved): κ(3) = √(I*)/3 = 1.0028142848…, and the worst triple is cyclically symmetric. No numerical search found a larger value. The note explains why the obvious proof strategies fail. Files: the preprint (PDF), and a reproducibility archive (ZIP) with five preregistered research stages, including failed and stopped runs, all certificates, and a SHA-256 manifest. After unpacking, two pure-Python exact checks reproduce the certificates in about 20 s, without any numerical solver. They check the certificates, not the surrounding proofs. Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.

•Nov 11, 2026•2 citations

An explicit ten-term stabilizer decomposition of |T>^{(x)7}: chi(|T>^{(x)7}) <= 10

Harish Santhanalakshmi Ganesan

Short note with supporting code and data on Open Problem Zoo record op_37f7b003ec78a028 (stabilizer rank of tensor powers of the magic state |T> = (|0> + e^{i pi/4}|1>)/sqrt2). The exact stabilizer rank chi(|T>^{(x)m}) is known for m ≤ 4 (2, 2, 3, 4); at m = 5, 6, 7 only the upper bounds 6, 6, 12 were known, the last being the product of the six-copy and one-copy decompositions (no direct search beyond six copies had been reported). This deposit gives an explicit decomposition of |T>^{(x)7} into ten stabilizer states, hence chi(|T>^{(x)7}) ≤ 10, and by sub-multiplicativity chi(|T>^{(x)13}) ≤ 60 (previously 72). The ten states are symmetric under permutations within the qubit blocks {1,2} and {3,...,7}; they are listed in Dehaene-De Moor normal form with exact coefficients in (1/4) Z[e^{i pi/4}]. The decomposition was found by an autonomous AI research agent (the depositor's EVO harness) that closed three seed states under block-symmetric Clifford gates to obtain a dictionary of a few hundred stabilizer states spanning the relevant symmetric subspace and then ran a subset search over it. Verification: exact Gaussian elimination over Q(e^{i pi/4}) (a proof of the identity), a 40-digit least-squares residual of 1.6e-41, and a brute-force recount of the stabilizer group of every state. Companion searches give evidence, not proof, that chi(|T>^{(x)5}) = 6. Claim boundary: an upper bound with an explicit certificate; no optimality, no asymptotic statement, no priority claim. Files: the note (PDF + LaTeX), the decomposition as JSON and as a readable listing, the exact verifier and the independent check with its log, the agent's search code and notes, the task text, SHA-256 sums.

•Oct 21, 2026•1 citation

Enhanced quantum capacity thresholds from symmetry

Avantika Agarwal, Amolak Ratan Kalra, Sungjai Lee +4 more

The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.

quant-pharXiv:2605.09138•May 12, 2026•5 citations

Addendum to "Quantum Search with Noisy Oracle"

Ansis Rosmanis

In this note, I generalize the techniques of my recent work (arXiv:2309.14944) and show that, even if just a single known qubit of query registers is affected by the depolarizing noise of rate p, quantum search among n elements cannot be done any faster than in O(np) queries. This holds both when the affected qubit is one of the log(n) index qubits and when it is the target qubit.

arXiv:2405.11973•May 20, 2024•4 citations
Short note with supporting code and data. For the qudit depolarizing channel N(rho) = (1-p) rho + p I/d, the only achievable rate quoted for d ≥ 3 is the hashing bound (maximally mixed input), which vanishes at p_h(3) = 0.2870867. An input maximally mixed on a two-dimensional subspace does better near the threshold: for one use of the qutrit channel its coherent information has the closed form I_c = 2η((1-p)/2 + p/3) + η(p/3) - η(1-p+p/6) - 5η(p/6) (bits, η(x) = -x log2 x) and is positive for all p < p_2(3), with p_2(3) in [0.29106723603359969, 0.29106723603359988] certified by interval arithmetic. Hence Q > 0 for all p < 0.2910672 (previous documented frontier 0.2870867, gain 3.98e-3), and the hashing expression is not the one-shot coherent information of the channel in a window below threshold for every 3 ≤ d ≤ 64 (certified enclosures for d = 3,4,5,6,8,16). Mechanism: the component leaking out of the code subspace heralds the error (qubit depolarizing channel with a flagged erasure). The input was found by an autonomous AI research agent (EVO harness, Claude Sonnet 5.5 proposers) as a two-qutrit rank-four state and identified by the author as a product of two single-qutrit rank-2 inputs. Multi-copy searches (n ≤ 7 qutrits, rank ≤ 4, including repetition codes inside the subspace) found nothing above p_2(3). Claim boundary: a lower bound on the threshold and on the one-shot coherent information; no capacity value, optimality or priority claim. Files: the note (PDF + LaTeX source), interval certificate script, exact multi-copy evaluator, the agent's state with verification scripts, baselines, the agent's notes and search scripts, SHA-256 sums.
Short note with supporting code and data on Open Problem Zoo record op_d2813fe3fcdf09ad (private capacity P of the qubit depolarizing channel Lambda_p(rho) = (1-p) rho + p I/2). The record certifies P > 0 only for p ≤ 0.259824 (via the quantum capacity) and lists positivity on (0.259824, 1/3) as open. Two observations. (1) Published one-way key-distillation results already imply more: the one-way six-state rate with noisy preprocessing (Renes-Smith 2007, Kraus-Gisin-Renner 2005) is a single-use private information of this channel and is positive for p < 0.28223 (QBER = p/2), and the rates of Kern and Renes (2008) with repetition codes of length 250 are positive up to QBER 14.5741%, i.e. p = 0.291482; a short in-band lemma (send the publicly announced syndromes through extra channel uses with a classical code; I(S;B) = H(S) ≥ I(S;E) up to Fano terms) turns any such forward-announcement rate into a Devetak private information over finitely many uses, so P(Lambda_p) > 0 for all p ≤ 0.291482 with no public channel. (2) Explicit finite-n witnesses: ensembles of two classical mixed states on n ≤ 8 qubits whose private information I(X;B) - I(X;E) is positive at p = 0.28336, 0.28372, 0.28405, 0.28437, 0.28466 for n = 4, 5, 6, 7, 8 (thresholds 0.283375 ... 0.284671), above the single-use threshold 0.28223. They were found by an autonomous AI research agent (the depositor's EVO harness); the members are distributions over bit strings whose weights depend only on the Hamming weight, with the second member the bit complement of the first. Verification uses an exact closed-form block decomposition of the environment state's spectrum (no 4^n-dimensional objects); every value is recomputed in 30-digit arithmetic and agrees with double precision to about twelve digits. Negative findings of the same searches: the family is locally optimal within classical ensembles, gains ~0.0003 per added qubit, and general (quantum) members at n ≤ 3 give no gain; the finite-n frontier will not reach the key-distillation frontier at n ≤ 10. Claim boundary: lower bounds on the positivity threshold and on finite-n private informations; no capacity value, optimality or priority claim. Files: the note (PDF + LaTeX), the ensembles as JSON, the exact evaluator and verifier, the high-precision certifier, the agent's notes and search code, SHA-256 sums.
The noise threshold below which the qubit depolarizing channel retains positive quantum capacity has been studied since 1996. The classic constructions come with exact finite formulae, but in every reported threshold to date -- most recently the record of Agarwal et al. -- the final step, the sign of the coherent information at the reported point, is a floating-point evaluation. We give the first exact-arithmetic, independently machine-checkable positivity proofs in this regime: an explicit 45-copy rank-two input state AAA, published as a 1,472-byte witness, with certified Ic>0I_c > 0Ic​>0 at the exact rational p=16239/250000=0.064956p = 16239/250000 = 0.064956p=16239/250000=0.064956 (per-Pauli convention; total error rate 3p=0.1948683p = 0.1948683p=0.194868) -- beyond both the best value printed in the Agarwal et al. paper (0.0646570.0646570.064657) and the strongest state in the same authors' public repository (≈0.064911\approx 0.064911≈0.064911), both numerical. Because the depolarizing family is a semigroup under composition, fixed-input coherent information is nonincreasing in ppp on [0,1/4][0,1/4][0,1/4], so a single certified point extends to the entire interval below it. The same machinery confines the positivity boundaries of AAA and of the strongest public state of Agarwal et al. to disjoint rational intervals separated by more than 1/250001/250001/25000 -- to our knowledge the first proven ordering of the positivity boundaries of two explicit 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.
Third note in a series on qubit–qutrit equivalence for centrally symmetric prepare-and-measure correlations (doi:10.5281/zenodo.24093433, doi:10.5281/zenodo.24121836). Setting: fixed binary measurements, no shared randomness, and tables of antipodal pairs of target expectation vectors. The question: by how much must a qutrit table be shrunk before a qubit can reproduce it? Proved: A qubit reproduces such a table exactly if and only if it factors through 3-dimensional real space with all rows and columns in the unit ball. With at most three queries this is the condition γ₂(T) ≤ 1 on the factorization norm, a single semidefinite program. Every qutrit table has γ₂(T) ≤ 2/√3, while the same argument gives exactly 1 for qubits. The worst-case factor κ(n) never decreases with the number of queries n. For three queries, γ₂(T)² ≥ I(T)/9, where I ≤ 9 is the qubit inequality of the previous note. Averaging a core over relabellings of the measurements can never raise the shrink factor. Certified in exact rational arithmetic (computer-assisted): κ(3) ≥ 1.002813276 and κ(4) ≥ 1.007479. For a fixed rational reference triple A*, close to the numerically best symmetric triple, the shrink factor lies in [1.002813276, 1.00281429]. The upper bound uses a new second-order covering of the direction sphere. Conjectured (not proved): κ(3) = √(I*)/3 = 1.0028142848…, and the worst triple is cyclically symmetric. No numerical search found a larger value. The note explains why the obvious proof strategies fail. Files: the preprint (PDF), and a reproducibility archive (ZIP) with five preregistered research stages, including failed and stopped runs, all certificates, and a SHA-256 manifest. After unpacking, two pure-Python exact checks reproduce the certificates in about 20 s, without any numerical solver. They check the certificates, not the surrounding proofs. Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.
Short note with supporting code and data on Open Problem Zoo record op_37f7b003ec78a028 (stabilizer rank of tensor powers of the magic state |T> = (|0> + e^{i pi/4}|1>)/sqrt2). The exact stabilizer rank chi(|T>^{(x)m}) is known for m ≤ 4 (2, 2, 3, 4); at m = 5, 6, 7 only the upper bounds 6, 6, 12 were known, the last being the product of the six-copy and one-copy decompositions (no direct search beyond six copies had been reported). This deposit gives an explicit decomposition of |T>^{(x)7} into ten stabilizer states, hence chi(|T>^{(x)7}) ≤ 10, and by sub-multiplicativity chi(|T>^{(x)13}) ≤ 60 (previously 72). The ten states are symmetric under permutations within the qubit blocks {1,2} and {3,...,7}; they are listed in Dehaene-De Moor normal form with exact coefficients in (1/4) Z[e^{i pi/4}]. The decomposition was found by an autonomous AI research agent (the depositor's EVO harness) that closed three seed states under block-symmetric Clifford gates to obtain a dictionary of a few hundred stabilizer states spanning the relevant symmetric subspace and then ran a subset search over it. Verification: exact Gaussian elimination over Q(e^{i pi/4}) (a proof of the identity), a 40-digit least-squares residual of 1.6e-41, and a brute-force recount of the stabilizer group of every state. Companion searches give evidence, not proof, that chi(|T>^{(x)5}) = 6. Claim boundary: an upper bound with an explicit certificate; no optimality, no asymptotic statement, no priority claim. Files: the note (PDF + LaTeX), the decomposition as JSON and as a readable listing, the exact verifier and the independent check with its log, the agent's search code and notes, the task text, SHA-256 sums.
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.