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

arXiv:2609.26743

Explicit channels with unbounded gains in classical communication using entangled inputs

Hao-Chung Cheng, Peixue Wu

quant-phcs.ITmath-phSubmitted Sep 22, 2026• Announced Sep 23, 2026• 3 citations
v1 · Sep 22, 2026v2 · Oct 5, 2026
arXivHTMLPDF

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.

Related papers

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

Andrew Stewart Caldin

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

•Nov 10, 2026•0 citations

Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback

Mark M. Wilde

We determine the optimal success probability for transmitting a fixed number of classical messages through a finite number of uses of the quantum erasure channel, assisted by noiseless classical feedback and without initial shared entanglement. For an input dimension $d$, an erasure probability $p$, a blocklength $n$, and $M$ equiprobable messages, the optimal success probability is equal to $E[\min\{1,d^K/M\}]$, where $K$ is binomial with parameters $n$ and $1-p$. The converse allows arbitrary adaptive quantum encoders, quantum memories, and receiver instruments. Its main ingredient is an elementary dimension bound for noiseless quantum communication with classical feedback, proved by fixing the classical controls without conditioning the sender's state on the observed transcript. A classical protocol that transmits the base-$d$ digits of an integer representing the message, repeating each digit until the receiver acknowledges its reception or the prescribed blocklength is reached, attains the bound for every integer $M$. We also establish a relative-majorization property of erasure-channel outputs and exactly evaluate a hypothesis-testing converse, recovering the same numerical bound without feedback. That converse need not be achievable without feedback: four uses of the qubit erasure channel and four messages give a strict gap. A product-state code employing tetrahedral qubit states nevertheless outperforms every classical binary erasure code with these parameters. We give an explicit message-size formula and show that the bounded-remainder normal approximation and the average-success strong-converse exponent are unchanged without feedback. We also determine the feedback-assisted error exponent below capacity, prove that it agrees with the no-feedback exponent above a critical rate, and give no-feedback bounds at lower rates.

quant-pharXiv:2610.00440•Oct 1, 2026•2 citations

Classical Simulation of Quantum Channel Families: Unbounded Cost Separation and Sharp Noise–Error Scaling

Huayu Liu

When the input measurement is fixed across a channel family, the simulation of binary output tests allows test-dependent responses, whereas preparing a quantum output requires one normalized state per recorded branch. We prove an unbounded separation between the optimized outcome costs of these tasks for families admitting a common mother measurement. The channel choices are specified by classical descriptions. For an explicit family of qubit channels, six outcomes suffice for all binary tests, whereas the exact channel cost is finite at every positive level of additional depolarizing noise and diverges as the noise vanishes. The family is the image of an explicit CPTP processor with a fixed finite-dimensional program and qubit input and output. For noise fraction λ and uniform output-channel diamond-norm error ε, the minimum common-measurement cost has the sharp order (λ + ε)^{−2/3} for 0 < λ + ε ≤ 1/2, both when channels are approximated independently and when the approximating family is generated by a single CPTP processor on the same spaces. The lower bound holds for arbitrary approximating channels subject only to the common-measurement budget. At each sufficiently small positive noise level, one finite common mother serves an entire full-dimensional process neighborhood of radius proportional to λ, throughout which the same cost law and six-outcome binary-test simulator persist.

•Nov 11, 2026•0 citations

Unbounded Holevo additivity gaps in finite dimensions

Jinzhao Wang

We establish unbounded two-use Holevo additivity gaps in finite dimensions. For each sufficiently large fixed integer $K$ and all sufficiently large $n$, we construct channels $T_n$ with output dimension $K^n$, input dimension $\exp(Θ_K(n^2))$, and \[ χ(T_n^{\otimes2})-2χ(T_n) \ge n\left[\frac{\log_2K}{K}-2\log_2(1+9/K)\right]-O(1/n). \] The gap is linear in output qubits, with an explicit quadratic input-qubit cost and an explicit threshold on $n$. We also obtain channels whose single-use Holevo quantity tends to zero while their two-use Holevo information, and hence classical capacity, diverges. The channels arise from structured tensor products of the complementary mixed-unitary channels used in Collins's free-probabilistic proof. We establish minimum-output-entropy gaps by combining Collins--Youn's product-group Haagerup inequality with Bordenave--Collins's quantitative strong-convergence estimates. We also provide a Lean certificate for our proofs.

quant-pharXiv:2609.18222•Sep 17, 2026•2 citations

Inequalities and Separations Among Assisted Capacities of Quantum Channels

Charles H. Bennett, Igor Devetak, Peter W. Shor +1 more

We exhibit quantum channels whose classical and quantum capacities, when assisted by classical feedback, exceed their unassisted classical Holevo capacity. These channels are designed to be noisy in a way that can be corrected with the help of the output and a reference system entangled with part of the input. A similar construction yields quantum channels whose classical capacity, when assisted by two-way classical communication independent of the source, exceeds their classical capacity assisted by feedback alone. We give a hierarchy of capacity inequalities and open questions.

arXiv:quant-ph/0406086•Physical Review Letters•Apr 18, 2006•46 citations

The power of constant-depth quantum circuits of unbounded size

Sergii Strelchuk, Sathyawageeswar Subramanian, Máté Weisz

Classical circuits with unbounded fan-in can compute any Boolean function in constant depth when their size is unrestricted. We ask whether removing the restrictions on circuit size and ancillary qubits also allows quantum circuits built from arbitrary single-qubit gates and generalised Toffoli gates to implement every unitary in constant depth. We give exact constant-depth constructions for arbitrary permutations of computational basis states, diagonal unitaries and the preparation of arbitrary pure states. These connect quantum state preparation to reversible classical computation and the preparation of probability distributions. With fanout in the gate set, they use exponentially many gates and ancillary qubits and return all ancillary qubits to zero. Replacing fanout by an exact circuit over the original gate set preserves constant depth, although the size bounds can become doubly exponential. The implementation of arbitrary unitaries in constant depth remains open. We give equivalent formulations in terms of copying the vectors of a specified orthonormal basis, extracting their labels and implementing restricted families of unitaries. We also reduce arbitrary unitary implementation to that of traceless unitary involutions using one additional clean qubit. With adaptive measurements, gate teleportation gives depth proportional to the level of a gate in the Clifford hierarchy. Towards arbitrary unitary implementation in constant depth, we use port-based teleportation: for input dimension $d$ and $M\geq d^2-1$ ports, we construct a unitary circuit of depth $O(\sqrt d)$, independent of $M$ and including resource preparation and port selection, with entanglement fidelity at least $(1-(d^2-1)/(2M))^2$. Thus, at fixed $d$, the approximation can be made arbitrarily accurate without increasing depth. Whether the dependence on $d$ can also be removed remains open.

quant-pharXiv:2609.40294•Oct 1, 2026•2 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.
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
We determine the optimal success probability for transmitting a fixed number of classical messages through a finite number of uses of the quantum erasure channel, assisted by noiseless classical feedback and without initial shared entanglement. For an input dimension ddd, an erasure probability ppp, a blocklength nnn, and MMM equiprobable messages, the optimal success probability is equal to E[min⁡{1,dK/M}]E[\min\{1,d^K/M\}]E[min{1,dK/M}], where KKK is binomial with parameters nnn and 1−p1-p1−p. The converse allows arbitrary adaptive quantum encoders, quantum memories, and receiver instruments. Its main ingredient is an elementary dimension bound for noiseless quantum communication with classical feedback, proved by fixing the classical controls without conditioning the sender's state on the observed transcript. A classical protocol that transmits the base-ddd digits of an integer representing the message, repeating each digit until the receiver acknowledges its reception or the prescribed blocklength is reached, attains the bound for every integer MMM. We also establish a relative-majorization property of erasure-channel outputs and exactly evaluate a hypothesis-testing converse, recovering the same numerical bound without feedback. That converse need not be achievable without feedback: four uses of the qubit erasure channel and four messages give a strict gap. A product-state code employing tetrahedral qubit states nevertheless outperforms every classical binary erasure code with these parameters. We give an explicit message-size formula and show that the bounded-remainder normal approximation and the average-success strong-converse exponent are unchanged without feedback. We also determine the feedback-assisted error exponent below capacity, prove that it agrees with the no-feedback exponent above a critical rate, and give no-feedback bounds at lower rates.
When the input measurement is fixed across a channel family, the simulation of binary output tests allows test-dependent responses, whereas preparing a quantum output requires one normalized state per recorded branch. We prove an unbounded separation between the optimized outcome costs of these tasks for families admitting a common mother measurement. The channel choices are specified by classical descriptions. For an explicit family of qubit channels, six outcomes suffice for all binary tests, whereas the exact channel cost is finite at every positive level of additional depolarizing noise and diverges as the noise vanishes. The family is the image of an explicit CPTP processor with a fixed finite-dimensional program and qubit input and output. For noise fraction λ and uniform output-channel diamond-norm error ε, the minimum common-measurement cost has the sharp order (λ + ε)^{−2/3} for 0 < λ + ε ≤ 1/2, both when channels are approximated independently and when the approximating family is generated by a single CPTP processor on the same spaces. The lower bound holds for arbitrary approximating channels subject only to the common-measurement budget. At each sufficiently small positive noise level, one finite common mother serves an entire full-dimensional process neighborhood of radius proportional to λ, throughout which the same cost law and six-outcome binary-test simulator persist.
We establish unbounded two-use Holevo additivity gaps in finite dimensions. For each sufficiently large fixed integer KKK and all sufficiently large nnn, we construct channels TnT_nTn​ with output dimension KnK^nKn, input dimension exp⁡(ΘK(n2))\exp(Θ_K(n^2))exp(ΘK​(n2)), and χ(Tn⊗2)−2χ(Tn)≥n[log⁡2KK−2log⁡2(1+9/K)]−O(1/n). χ(T_n^{\otimes2})-2χ(T_n) \ge n\left[\frac{\log_2K}{K}-2\log_2(1+9/K)\right]-O(1/n). χ(Tn⊗2​)−2χ(Tn​)≥n[Klog2​K​−2log2​(1+9/K)]−O(1/n). The gap is linear in output qubits, with an explicit quadratic input-qubit cost and an explicit threshold on nnn. We also obtain channels whose single-use Holevo quantity tends to zero while their two-use Holevo information, and hence classical capacity, diverges. The channels arise from structured tensor products of the complementary mixed-unitary channels used in Collins's free-probabilistic proof. We establish minimum-output-entropy gaps by combining Collins--Youn's product-group Haagerup inequality with Bordenave--Collins's quantitative strong-convergence estimates. We also provide a Lean certificate for our proofs.
We exhibit quantum channels whose classical and quantum capacities, when assisted by classical feedback, exceed their unassisted classical Holevo capacity. These channels are designed to be noisy in a way that can be corrected with the help of the output and a reference system entangled with part of the input. A similar construction yields quantum channels whose classical capacity, when assisted by two-way classical communication independent of the source, exceeds their classical capacity assisted by feedback alone. We give a hierarchy of capacity inequalities and open questions.
Classical circuits with unbounded fan-in can compute any Boolean function in constant depth when their size is unrestricted. We ask whether removing the restrictions on circuit size and ancillary qubits also allows quantum circuits built from arbitrary single-qubit gates and generalised Toffoli gates to implement every unitary in constant depth. We give exact constant-depth constructions for arbitrary permutations of computational basis states, diagonal unitaries and the preparation of arbitrary pure states. These connect quantum state preparation to reversible classical computation and the preparation of probability distributions. With fanout in the gate set, they use exponentially many gates and ancillary qubits and return all ancillary qubits to zero. Replacing fanout by an exact circuit over the original gate set preserves constant depth, although the size bounds can become doubly exponential. The implementation of arbitrary unitaries in constant depth remains open. We give equivalent formulations in terms of copying the vectors of a specified orthonormal basis, extracting their labels and implementing restricted families of unitaries. We also reduce arbitrary unitary implementation to that of traceless unitary involutions using one additional clean qubit. With adaptive measurements, gate teleportation gives depth proportional to the level of a gate in the Clifford hierarchy. Towards arbitrary unitary implementation in constant depth, we use port-based teleportation: for input dimension ddd and M≥d2−1M\geq d^2-1M≥d2−1 ports, we construct a unitary circuit of depth O(d)O(\sqrt d)O(d​), independent of MMM and including resource preparation and port selection, with entanglement fidelity at least (1−(d2−1)/(2M))2(1-(d^2-1)/(2M))^2(1−(d2−1)/(2M))2. Thus, at fixed ddd, the approximation can be made arbitrarily accurate without increasing depth. Whether the dependence on ddd can also be removed remains open.