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

Explicit channels with unbounded gains in classical communication using entangled inputs — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 10, 2026• 0 citations
Publisher

Abstract

We construct an explicit family of finite-dimensional quantum channels for which the optimal classical communication rate achievable with product-state codewords and collective decoding tends to zero, while rates achievable using entanglement only within pairs of channel inputs grow without bound. Our construction combines deterministic qudit Clifford unitaries with a binary measurement and classical feedforward, providing a derandomization to Hastings' probabilistic construction. The key ingredient is a careful design of measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family. Source: http://arxiv.org/abs/2609.26743v1 (arXiv:2609.26743v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24099334

Related papers

Explicit channels with unbounded gains in classical communication using entangled inputs

Hao-Chung Cheng, Benjamin Lovitz, Peixue Wu

A seminal result of Hastings showed that entangled inputs can increase the rate of classical communication through independent uses of a quantum channel. While Hastings' result proved the existence of this phenomenon, it has remained a major open problem to find an explicit channel with this property. In this work, we resolve this question by constructing an explicit family of finite-dimensional quantum channels for which entangling inputs between pairs of channel uses yields an unbounded separation from the achievable communication rate using unentangled inputs. We describe a circuit implementation of our channel that uses only deterministic qudit Clifford unitaries and a single binary measurement with classical feedforward. The key ingredient is a careful design of the measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family.

quant-pharXiv:2609.26743•Sep 23, 2026•3 citations

Quantum Broadcast Channels with Mutually Confidential Messages — E8 Intelligence Research

Andrew Stewart Caldin

We study the transmission of two independent confidential classical messages over a quantum broadcast channel, one for each receiver. Each message must remain secret from the other receiver, including when that receiver knows its own message. For classical inputs and quantum outputs, we establish the classical Marton-type inner bound under average reliability and conditional strong secrecy. The encoder selects pairs of codewords from independently generated codebooks using normalized likelihood weights. We prove reliability through a change-of-distribution argument. Our main technical result is a bipartite classical-quantum resolvability theorem that accounts for the dependence created by pair selection and establishes secrecy for the same encoder. We also obtain a multi-letter capacity characterization and extend it to arbitrary quantum inputs under secrecy against the other receiver, together with the Stinespring environment. We recover confidential capacity regions for deterministic Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 10, 2026•0 citations

Semi-Quantum Games Unify Bell Inequalities and Quantum Communication — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Buscemi's semi-quantum games generalize Bell inequalities by replacing local measurements with quantum channels, unifying entanglement and classical communication in a single statistical comparison framework. | MATH: Bell inequality violation condition: \( \sum_{a,b,x,y} P(a,b|x,y) \, \mu(a,b,x,y) \leq 1 \) (classical bound); Buscemi's extension replaces \(P(a,b|x,y)\) with quantum channel correlations \( \mathrm{Tr}[(E_a^x \otimes F_b^y) \rho] \) where \(E_a^x, F_b^y\) are POVMs, and the "free" operations become arbitrary quantum instruments, yielding a hierarchy of semi-device-independent bounds. The nondegeneracy property (arXiv:1903.05303) defines when a Bell inequality is violated only by a state \(\rho\) and not by its orthogonal complement \(\rho^\perp\), requiring \(\mathrm{Tr}[\rho \rho^\perp]=0\) in the fixed measurement basis. | CONNECTION: The statistical comparison framework maps to convex cones — the set of classical correlations forms a polytope whose facets are Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 11, 2026•0 citations

The Minimal Dimension of Entangled-Noise Advantage — E8 Intelligence Research

Andrew Stewart Caldin

Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems. Source: http://arxiv.org/abs/2609.28367v1 (arXiv:2609.28367 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 11, 2026•0 citations

Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata

Salman Beigi, Marco Tomamichel

A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.

quant-pharXiv:2609.11771•Sep 11, 2026•5 citations

Multinegativity and single-letter formulas for asymptotic entanglement — E8 Intelligence Research

Andrew Stewart Caldin

The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates $k$-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations
We construct an explicit family of finite-dimensional quantum channels for which the optimal classical communication rate achievable with product-state codewords and collective decoding tends to zero, while rates achievable using entanglement only within pairs of channel inputs grow without bound. Our construction combines deterministic qudit Clifford unitaries with a binary measurement and classical feedforward, providing a derandomization to Hastings' probabilistic construction. The key ingredient is a careful design of measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family. Source: http://arxiv.org/abs/2609.26743v1 (arXiv:2609.26743v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
A seminal result of Hastings showed that entangled inputs can increase the rate of classical communication through independent uses of a quantum channel. While Hastings' result proved the existence of this phenomenon, it has remained a major open problem to find an explicit channel with this property. In this work, we resolve this question by constructing an explicit family of finite-dimensional quantum channels for which entangling inputs between pairs of channel uses yields an unbounded separation from the achievable communication rate using unentangled inputs. We describe a circuit implementation of our channel that uses only deterministic qudit Clifford unitaries and a single binary measurement with classical feedforward. The key ingredient is a careful design of the measurement and feedforward process that yields the required one-copy and two-copy output entropy bounds from moment estimates alone, without requiring strong convergence of the underlying unitary family.
We study the transmission of two independent confidential classical messages over a quantum broadcast channel, one for each receiver. Each message must remain secret from the other receiver, including when that receiver knows its own message. For classical inputs and quantum outputs, we establish the classical Marton-type inner bound under average reliability and conditional strong secrecy. The encoder selects pairs of codewords from independently generated codebooks using normalized likelihood weights. We prove reliability through a change-of-distribution argument. Our main technical result is a bipartite classical-quantum resolvability theorem that accounts for the dependence created by pair selection and establishes secrecy for the same encoder. We also obtain a multi-letter capacity characterization and extend it to arbitrary quantum inputs under secrecy against the other receiver, together with the Stinespring environment. We recover confidential capacity regions for deterministic Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Buscemi's semi-quantum games generalize Bell inequalities by replacing local measurements with quantum channels, unifying entanglement and classical communication in a single statistical comparison framework. | MATH: Bell inequality violation condition: ∑a,b,x,yP(a,b∣x,y) μ(a,b,x,y)≤1 \sum_{a,b,x,y} P(a,b|x,y) \, \mu(a,b,x,y) \leq 1 ∑a,b,x,y​P(a,b∣x,y)μ(a,b,x,y)≤1 (classical bound); Buscemi's extension replaces P(a,b∣x,y)P(a,b|x,y)P(a,b∣x,y) with quantum channel correlations Tr[(Eax⊗Fby)ρ] \mathrm{Tr}[(E_a^x \otimes F_b^y) \rho] Tr[(Eax​⊗Fby​)ρ] where Eax,FbyE_a^x, F_b^yEax​,Fby​ are POVMs, and the "free" operations become arbitrary quantum instruments, yielding a hierarchy of semi-device-independent bounds. The nondegeneracy property (arXiv:1903.05303) defines when a Bell inequality is violated only by a state ρ\rhoρ and not by its orthogonal complement ρ⊥\rho^\perpρ⊥, requiring Tr[ρρ⊥]=0\mathrm{Tr}[\rho \rho^\perp]=0Tr[ρρ⊥]=0 in the fixed measurement basis. | CONNECTION: The statistical comparison framework maps to convex cones — the set of classical correlations forms a polytope whose facets are Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Can entangled noise erase entanglement more efficiently than separable noise? Standard robustness restricts the added noise to separable states; generalized robustness allows any state. We prove that the two costs coincide for every two-qubit state and give an explicit full-rank qubit--qutrit state with a strict gap. Positivity under partial transpose (PPT) characterizes separability in both dimensions, so the boundary is not caused by a failure of the PPT criterion. Instead, product-vector geometry permits a rank-one bridge between the two-qubit dual optimizations and supplies a two-dimensional completely entangled subspace for the qubit--qutrit separation. Local isometric embeddings complete the finite-dimensional bipartite classification, also for any fixed multipartite cut. Combined with known three-qubit separation, the result classifies universal equality relative to full separability in all finite multipartite systems. Source: http://arxiv.org/abs/2609.28367v1 (arXiv:2609.28367 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.
The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates kkk-multinegative states, a generalization of binegative states and the associated Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com