--- title: Conditional Quantum Communication url: https://www.emergentmind.com/topics/conditional-quantum-communication type: topic --- # Conditional Quantum Communication Conditional quantum communication denotes a family of quantum-information tasks in which communication, entanglement generation, secrecy, recovery, or routing is contingent on auxiliary systems or conditions. In the most explicit channel-coding formulation, Alice uses a quantum broadcast channel \(\Phi:A\to B\otimes C\), Bob exploits the side output \(C\), and the exact asymptotic ebit-generation capacity is \[ Q_K(\Phi)=\frac12\max_{\rho_A} I(R:B\mid C), \] thereby giving the quantum conditional mutual information (QCMI) a direct channel-coding meaning [2606.25264]. Closely related uses of the same conditional structure appear in state redistribution, conditional quantum one-time pads, conditional disclosure of secrets, heralded quantum memories, and protocols in which the signaling order is coherently controlled by a quantum system [1411.4921, 1703.02903, 2404.14491, 1111.0676, 1508.07840]. ## 1. Scope of the term in the literature The literature does not employ a single uniform definition of conditional quantum communication. Instead, the phrase appears across several technically distinct settings in which the recoverability, secrecy, or utility of quantum information depends on side information, a helper system, a public predicate, a heralding event, or a control qubit governing causal order [2606.25264, 1411.4921, 1703.02903, 2404.14491, 1111.0676, 1508.07840]. | Setting | Condition | Core statement | |---|---|---| | Broadcast-channel entanglement generation | Assistant output \(C\) helps decoding and must be decoupled | \(Q_K(\Phi)=\frac12\max_{\rho_A}I(R:B\mid C)\) | | State redistribution | Bob’s side information \(B\) reduces communication cost | \(Q_*=\frac12 I(C;R\mid B)\) | | Conditional quantum one-time pad | Secure subsystem \(B\) versus insecure subsystem \(E\) | Capacity \(I(A;B\mid E)\); quantum-message version \(\frac12 I(A;B\mid E)\) | | Quantum conditional disclosure of secrets | Reveal the secret iff \(f(x,y)=1\) | Correctness and privacy are imposed in diamond norm | | Heralded memory readout | Condition on detection of the partner photon | Conditional average storage fidelity \(0.885\pm0.020\) | | Superposed communication order | Order is coherently controlled by a qubit | \(P_{\mathrm{success}}^{\mathrm{superposed}}=1\) in the tripartite task | This suggests a unifying feature: the relevant resource is not merely quantum signaling, but quantum signaling constrained or unlocked by ancillary structure. In some settings the condition is informational, as in QCMI-governed tasks; in others it is cryptographic, optical, or causal. ## 2. Broadcast-channel conditional quantum communication and the QCMI capacity theorem In the broadcast-channel model, Alice holds system \(A\). Through a quantum broadcast channel \(\Phi:A\to B\otimes C\), Alice’s input emerges partly at Bob as \(B\) and partly at an assistant or “pilot” station as \(C\). No prior entanglement is shared, while classical public communication between the parties is allowed but not counted toward the rate. The goal is to establish noiseless quantum correlation, i.e. ebits, between Alice’s purification reference \(R\) and Bob’s system \(B\), while allowing the assistant \(C\) to help the decoding; the assistant must be decoupled from the final \(RB\) correlation to prevent leakage [2606.25264]. For \(n\) uses of \(\Phi\) achieving \(k\) nearly perfect ebits, the asymptotic rate is \[ R=\lim_{n\to\infty}\frac{k}{n}. \] If \(\rho_{ABC}\) is a tripartite state, with von Neumann entropy \(S(X)=-\Tr[\rho_X\log\rho_X]\), then \[ I(A:B)=S(A)+S(B)-S(AB), \] and \[ I(A:B\mid C)=S(AC)+S(BC)-S(C)-S(ABC). \] By strong subadditivity, \[ I(A:B\mid C)\ge 0. \] The central theorem states that for a quantum broadcast channel \(\Phi\), \[ Q_K(\Phi)=\frac12\max_{\rho_A}I(R:B\mid C)_\sigma, \] where \(\sigma_{RBC}=(\id_R\otimes\Phi)(|\psi\rangle\langle\psi|_{RA})\) and \(|\psi\rangle_{RA}\) purifies \(\rho_A\). Equivalently, if \(E\) denotes the channel environment, \[ Q_K(\Phi)=\frac12\max_{\rho_A}\bigl[S(RC)+S(BC)-S(C)-S(E)\bigr]. \] The result directly links QCMI to a channel capacity and is presented as a quantum extension of the classical key-generation capacity of Csiszár and Ahlswede. In the purely classical limit, including diagonal states, the expression reduces to the classical \(I(A:B\mid C)\) [2606.25264]. The coding theorem places QCMI in a direct operational role that had remained elusive in channel coding. Earlier operational meanings of QCMI involved redistribution, deconstruction, erasure, or secrecy tasks rather than a broadcast-channel capacity. ## 3. Proof architecture and the role of QCMI beyond channel coding The achievability proof proceeds by selecting an input ensemble \(\{\rho_A\}\) that approximately maximizes \(I(R:B\mid C)\). A packing lemma is then used to code classical labels into typical subspaces of \(R^n\) so that Bob, with access to \(B^nC^n\), can reliably identify the label whenever the label rate is below \(I(R:BC)\). A covering lemma randomizes over the ensemble to decouple \(C^n\) from the final \(R^nB^n\) system; this requires a randomness rate up to \(I(R:C)\). Converting classical communication cost into quantum cost introduces at most a factor two through entanglement-assisted and superdense-coding arguments, yielding \[ \frac12\bigl[I(R:BC)-I(R:C)\bigr]=\frac12 I(R:B\mid C) \] ebits per channel use. The converse uses Fannes-Alicki continuity and the data-processing inequality to show \[ k\le n\,\frac12 I(R:B\mid C)+o(n), \] so any larger rate would either defeat reliable decoding or leave the assistant correlated with \(RB\) [2606.25264]. QCMI already had a canonical operational interpretation in state redistribution. For a pure state \(|\psi\rangle_{ABCR}\), with Alice holding \(AC\), Bob holding \(B\), and \(R\) purifying \(ABC\), the optimal forward quantum communication cost for transferring subsystem \(C\) to Bob is \[ Q_*=\frac12 I(C;R\mid B), \] while the entanglement rate is \[ E_*=\frac12\bigl[I(C;A)-I(C;B)\bigr]. \] This establishes QCMI as the exact rate for a conditional transfer task and furnishes the main ingredient in reconstruction-based lower bounds on QCMI [1411.4921]. The reconstruction perspective asks how well \(\rho_{ABC}\) can be recovered from \(\rho_{AC}\) or \(\rho_{BC}\) by a CPTP reconstruction map. The Fawzi-Renner inequality gives \[ I(A;B\mid C)_\rho \ge -2\log F(\rho_{ABC},\mathcal R_{C\to BC}(\rho_{AC})), \] and stronger bounds upper-limit the regularized relative-entropy distance and the measured relative-entropy distance to reconstructed states. In this framework, \(I(A;B\mid C)=0\) if and only if the state is a quantum Markov chain \(B\text{--}C\text{--}A\), while small QCMI implies closeness to a reconstructed state in fidelity, measured relative entropy, or regularized quantum relative entropy [1411.4921]. Taken together, these results show that QCMI governs at least three distinct operational regimes: redistribution cost, distinguishability from reconstructed states, and broadcast-channel entanglement generation. A plausible implication is that the 2026 capacity theorem converts a previously structural entropy quantity into a directly code-theoretic one. ## 4. Example channels and implications for code design Two example classes illustrate how the side output \(C\) can unlock correlations that are inaccessible if one looks only at \(B\) [2606.25264]. For correlated bit-flip and phase-flip noise, consider a two-qubit map \(\mathcal N:L_1L_2\to BC\) with Kraus operators \[ K_0=\sqrt{1-p-q}\,I\otimes I,\quad K_1=\sqrt{p}\,X\otimes X,\quad K_2=\sqrt{q}\,Z\otimes Z. \] With maximally mixed input \(\rho_{L_1L_2}=I/4\), \[ I(R:B\mid C)=2,\qquad I(R:B)=2-H_3(1-p-q,p,q). \] Here the side channel \(C\) perfectly flags the error type—bit-flip, phase-flip, or none—and unlocks the full two bits of correlation. A second class starts from a single-user channel \(\mathcal N_1:A\to B\) with isometry \(V_1:A\to B\otimes E\), followed by an isometric split \(E\to C\otimes E'\) via \(V_2\). The resulting broadcast channel \(\mathcal N_{bc}:A\to B\otimes C\) obeys \[ I(R:B\mid C)=S(RC)+S(BC)-S(C)-S(E'), \qquad I(R:B)=S(R)+S(B)-S(RB). \] For the rank-2 qubit channel with Kraus matrices \[ K_0=\begin{pmatrix}\sqrt{1-p}&0\\0&\sqrt{1-q}\end{pmatrix},\qquad K_1=\begin{pmatrix}0&\sqrt q\\ \sqrt p&0\end{pmatrix}, \] the gain \[ \Delta=I(R:B\mid C)-I(R:B) \] was computed for four splitting options: AD + AD, Deph + Deph, Deph + AD, and AD + Deph. In the AD+AD case with parameters \(\gamma\) and \(\lambda\), \[ \Delta =H_2\!\bigl(\tfrac{\gamma\lambda}{2}\bigr) -H_2\!\bigl(\tfrac{\gamma(1-\lambda)}{2}\bigr) +2-H_2\!\bigl(\tfrac{1-\gamma}{2}\bigr) -\tfrac12 H_2(\gamma), \] and numerically \(\Delta\approx0.13\) for \(\gamma=0.3,\lambda=0.2\). The paper identifies several code-design implications. In architectures with multi-qubit gates with crosstalk, correlated noise in quantum memories, or photonic networks with environment probes, the auxiliary degrees of freedom \(C\) may carry partial information about errors on \(B\). The conditional coding framework shows how such information can be exploited to boost the logical rate relative to discarding \(C\). Code construction is described in terms of combining standard quantum error-correcting codes for the main channel with a “sensing” code for the side output \(C\), while typical-subspace methods plus classical randomness enforce decoupling of \(C\). The same capacity formula is proposed as a figure of merit for end-to-end entanglement distribution in repeater chains or multi-node networks when intermediate measurement outcomes or syndrome data are reused. Future directions explicitly mentioned include threshold analyses in hardware-informed noise models, explicit code families achieving half the QCMI, and investigations of additivity and superadditivity in this channel class [2606.25264]. ## 5. Cryptographic conditional communication A cryptographic realization of conditional quantum communication appears in the conditional quantum one-time pad. Alice and Bob share many copies of a tripartite state \(\rho_{ABE}\), Alice holds \(A\), and Bob holds \(BE\), but \(E\) is an insecure sector controlled by Eve. Alice communicates over an ideal quantum channel that Eve may intercept. The task is to encode a classical message so that Bob, with access to \(A'B^nE^n\), can decode it, while Eve, with access to \(A'E^n\), learns nothing. The exact secret-communication capacity is \[ C_{\mathrm{CQOTP}}(\rho_{ABE})=I(A;B\mid E)_\rho. \] The achievability proof again uses packing and covering: \(\log_2(MK)nI(A;E)+o(n)\) for secrecy, so the net rate is \[ I(A;BE)-I(A;E)=I(A;B\mid E). \] The same work states that the quantum-message version has rate \(\frac12 I(A;B\mid E)\), and it relates the minimized quantity \(\frac12\inf_{\rho_{ABE}} I(A;B\mid E)\) to squashed entanglement [1703.02903]. A second cryptographic branch is conditional disclosure of secrets with quantum resources. Here Alice and Bob do not communicate with one another; Alice receives \((x,Q)\), Bob receives \(y\), they may share entanglement, and both send quantum messages to a referee. Correctness requires that whenever \(f(x,y)=1\), there exists a decoder \(\mathcal D^{x,y}\) with \[ \bigl\|\mathcal D^{x,y}\circ \mathcal N^{x,y}_{Q\to M}-\Id_Q\bigr\|_\diamond\le \epsilon, \] while privacy requires that whenever \(f(x,y)=0\), there exists a simulator \(\mathcal S^{x,y}\) independent of the secret such that \[ \bigl\|\mathcal N^{x,y}_{Q\to M}-\mathcal S^{x,y}\circ \Tr_Q\bigr\|_\diamond\le \delta. \] This model is equivalent, up to parameter losses, to \(f\)-routing, where the quantum secret is routed to one party or the other depending on \(f(x,y)\). The theory includes closure under negation, amplification from a single-qubit secret to \(k\) qubits with exponentially small error at linear overhead, and lower bounds from one-way quantum communication complexity, \(PP^{cc}\), two-message quantum interactive proofs, and honest-verifier QSZK [2404.14491]. The comparison between classical and quantum conditional disclosure sharpens the complexity-theoretic picture. For perfectly correct CDS, a promise version of not-equals admits a quantum upper bound of \(O(\log n)\) and a classical lower bound of \(\Omega(n)\). More generally, quantum CDS satisfies a lower bound \[ \Omega\!\bigl(\log R_{0,A\to B}(f)+\log R_{0,B\to A}(f)\bigr), \] and there is a poly\((\log n)\) quantum CDS protocol for forrelation. The same line also gives an exponential separation between classical and quantum private simultaneous message passing for a partial function [2505.02939]. These cryptographic models differ from the broadcast-channel capacity problem in their objective: the central issue is not entanglement generation assisted by a helper, but controlled revelation of a secret under correctness and privacy constraints. Nevertheless, the common entropy-theoretic motif is the conditional accessibility of quantum information. ## 6. Heralding, conditional detection, and superposed communication order An experimental use of conditional quantum communication appears in heralded detection after storage in a quantum memory. In the waveguide experiment on time-bin qubits, each 795 nm photon is encoded as \[ |\psi\rangle=\alpha|e\rangle+\beta e^{i\phi}|l\rangle \] and stored in a Ti:Tm:LiNbO\(_3\) single-mode channel waveguide implementing an atomic-frequency-comb memory. Detection of the paired 1532 nm photon serves as a herald, so that one analyzes only those trials for which the partner photon has been detected. The conditional retrieval probability is written as \(P(\mathrm{retrieve}\mid \mathrm{herald})=N_{\mathrm{coinc}}/N_{\mathrm{herald}}\simeq0.2\%\), with intrinsic AFC recall efficiency \(\simeq2\%\). The conditional average storage fidelity is \[ F^*=\frac{F^*_{el}+2F^*_\phi}{3}=0.885\pm0.020, \] compared with the unconditioned \[ F=\frac{F_{el}+2F_\phi}{3}=0.738\pm0.029. \] The heralded value exceeds both the measure-and-prepare benchmark \(2/3\) and the universal-cloning bound \(5/6\), while heralding rejects \(\sim95\%\) of detector dark counts [1111.0676]. A conceptually different usage identifies conditional quantum communication with coherent control of communication order. In this formulation, one replaces a definite signaling order such as \(A\to B\to C\) or \(B\to A\to C\) by a quantum superposition controlled by an auxiliary qubit. In the tripartite Hamming game with \(n=1\) and total communication \(m=2\), the best average success probabilities obey \[ P_{\mathrm{classical}}\le \frac79,\qquad P_{\mathrm{quantum\_fixed}}\le \frac56, \] whereas the quantum switch achieves \[ P_{\mathrm{success}}^{\mathrm{superposed}}=1. \] The construction is expressed in process-matrix language by a switch process \(W_{\mathrm{sw}}\) containing off-diagonal coherence terms, and operationally by routing the target through Alice then Bob or Bob then Alice depending coherently on the control qubit. Because any causally separable process is bounded by \(P\le 5/6\), observing \(P\approx1\) under the qubit-dimension assumption acts as a semi-device-independent witness of causal nonseparability [1508.07840]. These examples show that the adjective “conditional” ranges from heralding and side information to secrecy predicates and coherent causal control. The 2026 broadcast-channel theorem isolates the QCMI-governed variant with the sharpest channel-coding statement, while the surrounding literature demonstrates that conditional structure has become a recurring design principle across quantum Shannon theory, quantum cryptography, quantum memories, and indefinite-causal-order protocols. Source: https://www.emergentmind.com/topics/conditional-quantum-communication