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

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

Huayu Liu

Published Nov 11, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.24143339

Related papers

Classical-Input Simulation of Quantum Superchannels: From Linear to Quadratic Error with One More Outcome

Huayu Liu

One additional retained measurement outcome can change the optimal approximation order in classical-input simulation of a quantum superchannel. A classical-input realization first measures the external input and then applies a deterministic conditional process. The budget counts the complete retained label, including any shared random choice used at a later stage. We construct a fixed-dimensional family of state-input superchannels for which increasing the budget from four outcomes to five changes the optimal approximation error from linear to quadratic just above the exact realization threshold. The error is measured in the trace norm of the process Choi operator, and the optimization allows arbitrary measurement effects and deterministic conditional processes. The quadratic order is optimal over all finite measurements, and five is the smallest outcome budget that attains it. The same approximation orders hold in diamond distance for the associated joint-input channels. A correlated splitting of one effect cancels the linear defect with only a second-order change in the measurement obtained by merging the split outcomes. Throughout the family, the output channels share a four-outcome mother measurement and the process Choi operator is separable across the external-input cut. An independent theorem establishes local linear stability under stochastic postprocessing for rank-one target POVMs with distinct support rays, provided that the unknown POVM has no more outcomes than the target.

•Nov 9, 2026•0 citations

Certifying the classical simulation cost of a quantum channel

Brian Doolittle, Eric Chitambar

A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in $d$ dimensions. The bounds are found to be tight for the special case of the erasure channel.

arXiv:2102.12543•Physical Review Research•Oct 26, 2021•13 citations

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

Intermediate memory costs of quantum channel synthesis with a protected subsystem

Kai Liu, Deguang Han

A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a $b$-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an $a$-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most $a$. A target graph may be realizable with a carrier of dimension $b$, while synthesizing a channel with that graph can require dimension $ab$. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error $(1-η)/4$, where $0\leqη\leq1$ is the depolarization strength. For $η<1$, the gap persists under sufficiently small perturbations of the target branches.

quant-pharXiv:2610.20536•Oct 15, 2026•0 citations

Exact Robustness Frontiers and Fidelity Limits for Qubit Memories

Ying Xie

We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.

•Nov 12, 2026•0 citations

The energy cost of optical noise

Zixuan He

This work gives a resource law for engineering optical noise: how many photons must a single environment mode contain to prevent any signal from producing an output that is too spectrally concentrated? It provides an explicit optimal bath preparation, a matched Gaussian benchmark, and separately proved guarantees for correlated repeated use. Exact photon cost of a spectral noise guarantee A signal mixes with an independently prepared bath \(\sigma\) at a beam splitter of signal transmissivity \(\eta\). The requirement is \[\Phi_{\eta,\sigma}(\rho)\le cI\qquad\text{for every normal input state }\rho,\qquad 0<c<1.\] Equivalently, every rank-one output projection has probability at most \(c\) and the receiver's output min-entropy is at least \(-\ln c\). Inputs may be mixed, non-Gaussian, arbitrarily energetic, and have infinite photon tails. Let \(d=\lceil 1/c\rceil-1\). Throughout \(0<\eta\le 1/\lceil 1/c\rceil\), the minimum mean photon numbers of the actual bath are \[N_{\mathrm{all}}(c,\eta)=\frac{d-cd(d+1)/2}{1-\eta}.\] \[N_{\mathrm G}(c,\eta)=\frac{c^{-1}-1}{1-\eta}.\] The first optimization includes all normal bath states and has a unique finite-support minimizer. The second includes all Gaussian density operators, with arbitrary squeezing and displacement; a centered thermal bath attains it. The coupling and spectral requirement are identical in both comparisons. At \(c=1/j\), for every integer \(j\ge2\) and \(0<\eta\le1/j\), \[N_{\mathrm G}(1/j,\eta)=2N_{\mathrm{all}}(1/j,\eta).\] Between reciprocal budgets the ratio varies. The cost counts mean photons in the physical bath, not laboratory preparation work or the energy of an auxiliary purification. A physical preparation and its complete single-use spectrum Writing \(r=1-dc\), the attaining vacuum-output spectrum is \[\lambda_*=(\underbrace{c,\ldots,c}_{d\text{ entries}},r).\] It majorizes every output of the same channel, so the minimum von Neumann entropy is exactly \[S_{\min}(\Phi_{\eta,\sigma})=-dc\ln c-r\ln r.\] The other positive-order Rényi minima are fixed by the same spectrum. Coherent inputs attain these minima. The proof identifies an actual optical dilation whose port antisymmetry enforces the all-input occupation bound. Exact examples also show that baths with identical energy and covariance can have different optimized entropy floors. What survives entangled repeated use For the same resource-optimal flat-output families of ranks \(j=2,3,4\), separate estimates prove \[S_{\mathrm{out}}\ge m\ln j\] for every finite number \(m\) of uses and arbitrary normal joint inputs, including cross-use entanglement. The environments vary with \(\eta\) along their specified families. Further results give sharp tensorized purity bounds for the entire three-level diagonal bath simplex and for every Fock environment at balanced coupling. The paper then treats a different, fixed bath, \(\sigma=\lvert1\rangle\langle1\rvert\), at every \(0<\eta<1\). With \[h(\eta)=-\eta\ln\eta-(1-\eta)\ln(1-\eta),\] it proves: Exact \(S_{\mathrm{out}}\ge mh(\eta)\) at arbitrary finite blocklength for joint inputs invariant under each local photon-number phase rotation by \(2\pi/q\), \(q\ge4\). Coherence and entanglement within residue sectors and infinite tails remain allowed. The residue-zero restricted channel also has strong minimum-output-entropy additivity with arbitrary normal partner channels. The same exact entropy floor for up to three globally total-phase-invariant input modes, without a mean-energy limit. \(S_{\mathrm{out}}\ge Mh(\eta)-o(M)\) for physical-mode permutation-invariant inputs of finite mean energy density, with explicit errors and full infinite-tail control. For every fixed \(m\) and interior \(\eta\), all outputs remain a uniformly positive trace distance from every state of rank below \(2^m\), without any input-energy bound. This covers nonbalanced parameters where the older purity-based distance bound vanishes; the new positive constant is spectrally implicit. Interpretation and scope The input classes above are not nested, and an entropy rate, a finite-block entropy floor and a low-rank distance are distinct guarantees. The fixed single-photon bath is not generally the resource-optimal bath. Complete unrestricted nonbalanced single-photon entropy additivity and exact classical capacity remain open. A spectral noise guarantee constrains output mixing; it does not mean that all input information or reference correlations are erased. The article separates this issue through actual resolved-erasure qubit restrictions, antidegradability of the specified optimal reciprocal families, and a classical capacity bracket under a true signal-energy budget. The integrated 52-page article contains six scientific figures, the complete proofs, and the mathematical data needed to reconstruct its finite certificates. Logarithms and entropy values use natural units unless bits are explicitly stated.

•Oct 25, 2026•0 citations
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.
One additional retained measurement outcome can change the optimal approximation order in classical-input simulation of a quantum superchannel. A classical-input realization first measures the external input and then applies a deterministic conditional process. The budget counts the complete retained label, including any shared random choice used at a later stage. We construct a fixed-dimensional family of state-input superchannels for which increasing the budget from four outcomes to five changes the optimal approximation error from linear to quadratic just above the exact realization threshold. The error is measured in the trace norm of the process Choi operator, and the optimization allows arbitrary measurement effects and deterministic conditional processes. The quadratic order is optimal over all finite measurements, and five is the smallest outcome budget that attains it. The same approximation orders hold in diamond distance for the associated joint-input channels. A correlated splitting of one effect cancels the linear defect with only a second-order change in the measurement obtained by merging the split outcomes. Throughout the family, the output channels share a four-outcome mother measurement and the process Choi operator is separable across the external-input cut. An independent theorem establishes local linear stability under stochastic postprocessing for rank-one target POVMs with distinct support rays, provided that the unknown POVM has no more outcomes than the target.
A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in ddd dimensions. The bounds are found to be tight for the special case of the erasure channel.
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.
A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a bbb-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an aaa-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most aaa. A target graph may be realizable with a carrier of dimension bbb, while synthesizing a channel with that graph can require dimension ababab. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error (1−η)/4(1-η)/4(1−η)/4, where 0≤η≤10\leqη\leq10≤η≤1 is the depolarization strength. For η<1η<1η<1, the gap persists under sufficiently small perturbations of the target branches.
We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.
This work gives a resource law for engineering optical noise: how many photons must a single environment mode contain to prevent any signal from producing an output that is too spectrally concentrated? It provides an explicit optimal bath preparation, a matched Gaussian benchmark, and separately proved guarantees for correlated repeated use. Exact photon cost of a spectral noise guarantee A signal mixes with an independently prepared bath σ\sigmaσ at a beam splitter of signal transmissivity η\etaη. The requirement is Φη,σ(ρ)≤cIfor every normal input state ρ,0<c<1.\Phi_{\eta,\sigma}(\rho)\le cI\qquad\text{for every normal input state }\rho,\qquad 0<c<1.Φη,σ​(ρ)≤cIfor every normal input state ρ,0<c<1. Equivalently, every rank-one output projection has probability at most ccc and the receiver's output min-entropy is at least −ln⁡c-\ln c−lnc. Inputs may be mixed, non-Gaussian, arbitrarily energetic, and have infinite photon tails. Let d=⌈1/c⌉−1d=\lceil 1/c\rceil-1d=⌈1/c⌉−1. Throughout 0<η≤1/⌈1/c⌉0<\eta\le 1/\lceil 1/c\rceil0<η≤1/⌈1/c⌉, the minimum mean photon numbers of the actual bath are Nall(c,η)=d−cd(d+1)/21−η.N_{\mathrm{all}}(c,\eta)=\frac{d-cd(d+1)/2}{1-\eta}.Nall​(c,η)=1−ηd−cd(d+1)/2​. NG(c,η)=c−1−11−η.N_{\mathrm G}(c,\eta)=\frac{c^{-1}-1}{1-\eta}.NG​(c,η)=1−ηc−1−1​. The first optimization includes all normal bath states and has a unique finite-support minimizer. The second includes all Gaussian density operators, with arbitrary squeezing and displacement; a centered thermal bath attains it. The coupling and spectral requirement are identical in both comparisons. At c=1/jc=1/jc=1/j, for every integer j≥2j\ge2j≥2 and 0<η≤1/j0<\eta\le1/j0<η≤1/j, NG(1/j,η)=2Nall(1/j,η).N_{\mathrm G}(1/j,\eta)=2N_{\mathrm{all}}(1/j,\eta).NG​(1/j,η)=2Nall​(1/j,η). Between reciprocal budgets the ratio varies. The cost counts mean photons in the physical bath, not laboratory preparation work or the energy of an auxiliary purification. A physical preparation and its complete single-use spectrum Writing r=1−dcr=1-dcr=1−dc, the attaining vacuum-output spectrum is λ∗=(c,…,c⏟d entries,r).\lambda_*=(\underbrace{c,\ldots,c}_{d\text{ entries}},r).λ∗​=(d entriesc,…,c​​,r). It majorizes every output of the same channel, so the minimum von Neumann entropy is exactly Smin⁡(Φη,σ)=−dcln⁡c−rln⁡r.S_{\min}(\Phi_{\eta,\sigma})=-dc\ln c-r\ln r.Smin​(Φη,σ​)=−dclnc−rlnr. The other positive-order Rényi minima are fixed by the same spectrum. Coherent inputs attain these minima. The proof identifies an actual optical dilation whose port antisymmetry enforces the all-input occupation bound. Exact examples also show that baths with identical energy and covariance can have different optimized entropy floors. What survives entangled repeated use For the same resource-optimal flat-output families of ranks j=2,3,4j=2,3,4j=2,3,4, separate estimates prove Sout≥mln⁡jS_{\mathrm{out}}\ge m\ln jSout​≥mlnj for every finite number mmm of uses and arbitrary normal joint inputs, including cross-use entanglement. The environments vary with η\etaη along their specified families. Further results give sharp tensorized purity bounds for the entire three-level diagonal bath simplex and for every Fock environment at balanced coupling. The paper then treats a different, fixed bath, σ=∣1⟩⟨1∣\sigma=\lvert1\rangle\langle1\rvertσ=∣1⟩⟨1∣, at every 0<η<10<\eta<10<η<1. With h(η)=−ηln⁡η−(1−η)ln⁡(1−η),h(\eta)=-\eta\ln\eta-(1-\eta)\ln(1-\eta),h(η)=−ηlnη−(1−η)ln(1−η), it proves: Exact Sout≥mh(η)S_{\mathrm{out}}\ge mh(\eta)Sout​≥mh(η) at arbitrary finite blocklength for joint inputs invariant under each local photon-number phase rotation by 2π/q2\pi/q2π/q, q≥4q\ge4q≥4. Coherence and entanglement within residue sectors and infinite tails remain allowed. The residue-zero restricted channel also has strong minimum-output-entropy additivity with arbitrary normal partner channels. The same exact entropy floor for up to three globally total-phase-invariant input modes, without a mean-energy limit. Sout≥Mh(η)−o(M)S_{\mathrm{out}}\ge Mh(\eta)-o(M)Sout​≥Mh(η)−o(M) for physical-mode permutation-invariant inputs of finite mean energy density, with explicit errors and full infinite-tail control. For every fixed mmm and interior η\etaη, all outputs remain a uniformly positive trace distance from every state of rank below 2m2^m2m, without any input-energy bound. This covers nonbalanced parameters where the older purity-based distance bound vanishes; the new positive constant is spectrally implicit. Interpretation and scope The input classes above are not nested, and an entropy rate, a finite-block entropy floor and a low-rank distance are distinct guarantees. The fixed single-photon bath is not generally the resource-optimal bath. Complete unrestricted nonbalanced single-photon entropy additivity and exact classical capacity remain open. A spectral noise guarantee constrains output mixing; it does not mean that all input information or reference correlations are erased. The article separates this issue through actual resolved-erasure qubit restrictions, antidegradability of the specified optimal reciprocal families, and a classical capacity bracket under a true signal-energy budget. The integrated 52-page article contains six scientific figures, the complete proofs, and the mathematical data needed to reconstruct its finite certificates. Logarithms and entropy values use natural units unless bits are explicitly stated.