arXiv subjects

Liuhang Ye

Publications and source records attributed to Liuhang Ye.

4 recordsLinked to original sources

arXiv2026

Quantum de Finetti theorems for states and channels in any distance measure

Standard finite quantum de Finetti theorems approximate the $k$-system marginals of permutation-invariant states of $n$-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of operator inequalities, implying bounds in every Schatten norm and for every quantum Rényi divergence satisfying data processing. In the standard case, for fixed local dimension, our $k/n$ error bound in max-relative entropy improves on the previously best known $k^2/n$ scaling, even in the classical setting. The operator-inequality approach is particularly suited to study channel de Finetti representations because operator order between Choi states is equivalent to completely positive (CP) order between the underlying channels. For permutation-covariant channels $N^{(n)}:A^{\otimes n}\to B^{\otimes n}$, where $d_A=\dim A$, we prove that the $k$-system reduced channel is CP-dominated by a mixture of tensor-power channels with error $O(k/\sqrt{n})$ and polynomial dependence on the local dimensions, addressing a question raised by Berta et al. [Math. Program. 194, 781-829 (2022)]. Under the no-signalling condition, we also prove an exponential channel de Finetti theorem where the approximating mixture consists of Choi-almost-iid channels, whose normalized Choi states are almost-iid in the sense of Mazzola-Sutter-Renner. In the case of $r$ defects, the representation error is at most $\mathrm{poly}(n)\bigl(2d_A^4k^3/(nr^2)\bigr)^{(r+1)/2}$ and decays exponentially in $n$ for a suitable choice of parameters $r$ and $k$.

quant-ph↗

arXiv2026

Robust classical and quantum communication over almost-iid channels

The independent and identically distributed (iid) paradigm for asymptotic communication through quantum channels describes $n$ uses of a channel $Φ$ by $Φ^{\otimes n}$. Since exact tensor-power behaviour is an idealization, we ask whether the asymptotic capacities of $Φ$ remain achievable for channel sequences that are almost-iid along $Φ$. We consider sequences of Choi-almost-iid channels whose normalized Choi states are Mazzola-Sutter-Renner (MSR) almost-iid along the normalized Choi state of $Φ$, with defect parameters $r_n=o(n)$. In Renner's exponential de Finetti theorem for quantum states, almost-iid states appear in the approximating mixture and motivate the MSR almost-iid class. Choi-almost-iid channels play the corresponding role in an exponential de Finetti theorem for quantum channels established in a companion paper. In this paper, we prove that the universal unassisted classical and quantum capacities of the class of Choi-almost-iid channels along $Φ$ equal those of the channel $Φ$. Here universality is within this class: for each rate below the relevant capacity, a code sequence depending on $Φ$ and the rate, but not on the particular channel sequence, achieves vanishing error for every sequence in the class.

quant-ph↗

arXiv2026

Strong converse bounds on the classical identification capacity of the qubit depolarizing channel

A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an identification error necessarily converges to one. Converse bounds for identification are notoriously difficult to obtain for fully quantum channels. The only previously known converse bound, due to Atif, Pradhan and Winter [Int.~J.~Quantum Inf.~22(5):2440013, 2024], has the unsatisfactory feature of remaining strictly positive even for a completely noisy channel, for which identification is clearly impossible. We derive strong (and hence also weak) converse bounds, for the qubit depolarizing channel with noise parameter $p$, that vanish as $p\to 1$, thereby yielding the correct behavior in the completely noisy limit. Moreover, in the setting of simultaneous classical identification under the constraint of complete product measurements, our converse bound matches the corresponding achievability bound, and establishes that in this case the identification capacity equals the classical capacity of the channel.

quant-ph↗

arXiv2025

Events and their Localisation are Relative to a Lab

The notions of events and their localisation fundamentally differ between quantum theory and general relativity, reconciling them becomes even more important and challenging in the context of quantum gravity where a classical spacetime background can no longer be assumed. We therefore propose an operational approach drawing from quantum information, to define events and their localisation relative to a Lab, which in particular includes a choice of physical degree of freedom (the reference) providing a generalised notion of "location". We define a property of the reference, relative measurability, that is sensitive to correlations between the Lab's reference and objects of study. Applying this proposal to analyse the quantum switch (QS), a process widely associated with indefinite causal order, we uncover differences between classical and quantum spacetime realisations of QS, rooted in the relative measurability of the associated references and possibilities for agents' interventions. Our analysis also clarifies a longstanding debate on the interpretation of QS experiments, demonstrating how different conclusions stem from distinct assumptions on the Labs. This provides a foundation for a more unified view of events, localisation, and causality across quantum and relativistic domains.

quant-ph↗