Searcharxiv⌕ Search

arXiv · 2610.04831

Entanglement-of-formation potentials for feedback-assisted classical communication and randomness distillation

Abstract

We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation. For a finite-dimensional quantum channel without initial shared entanglement, an exact amortization theorem bounds the increase of message information plus entanglement remaining across the communicating laboratories. This proves a classical-feedback capacity bound using a mixed-convex-roof expression previously studied by Winter and Yang in the context of potential capacities. We determine the capacity of flagged mixtures of noiseless and entanglement-breaking channels, improve a published depolarizing-channel converse, and evaluate the new bound exactly for the amplitude damping channel. A state analogue gives a finite-blocklength upper bound on the net shared randomness obtainable with one-way classical communication. Amplitude-damping Choi states provide exact benchmarks, while a full-rank generalized amplitude-damping Choi state demonstrates a useful improvement where we do not evaluate the operational rate exactly. We also distinguish one-way from two-way randomness distillation: a two-round weak-measurement protocol strictly exceeds the exact one-way rate of every nontrivial qubit isotropic state. The protocol preserves quantum side information during its first decoding and extracts additional randomness in the reverse direction. This shows why the one-way state potential is not a general two-way converse. Together, these results establish a common entanglement-based approach to sharper communication and randomness bounds, while revealing how retained quantum correlations enable two-way distillation to surpass one-way limits.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark M. Wilde. 2026-10-04. Entanglement-of-formation potentials for feedback-assisted classical communication and randomness distillation. https://arxiv.org/abs/2610.04831

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Quantum Eraser Paradox

The Delayed-Choice Quantum Eraser experiment is commonly interpreted as implying that in quantum mechanics a choice made at one time can influence an earlier event. We here suggest an extension of the experiment that results in a paradox when analysed in a local realist interpretation combined with backward causation (``dynamical retrocausality''). We argue that resolving the paradox requires giving up the idea that, in quantum mechanics, a choice can influence the past in this way, and that it instead requires a violation of Statistical Independence without (what most people think of as) retrocausality. Finally, we propose an implementation of the experiment that we believe to be possible with existing technology. This new experiment can distinguish between different types of hidden-variables theories in a way that Bell-type tests cannot: unlike in a Bell test, the measurement setting here is set by an earlier outcome, which makes the consistency of the backwards influence itself testable. We classify the fixed-point (consistency-enforcing) hidden-variables models of the experiment, which can reproduce quantum mechanics only if the backwards influence has no observable effect.

quant-ph↗

Quantum simulation of wave optics in weakly inhomogeneous media using block-encoding

We propose a quantum algorithm that simulates the propagation of a light field through a weakly inhomogeneous medium. In the paraxial approximation, the wave equation in an inhomogeneous material takes the form of the Schrödinger equation with a time-dependent Hamiltonian. This reduction is used to simulate wave optical dynamics on a quantum computer. Beam propagator operators for a short propagation distance are constructed using an efficient and flexible block-encoding that enables the simulation of various optical setups. The algorithm is showcased by simulating the propagation of a one-dimensional Gaussian beam through a lens of finite thickness, and the resulting spherical aberration is demonstrated.

quant-ph↗

Clifford gates with logical transversality for self-dual CSS codes

Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical gate of a high-rate code can be fault-tolerantly implemented using transversal physical gates, but its logical operation may depend on the choice of a symplectic basis that defines logical Pauli operators of the code. In this work, we focus on $[\![n,k,d]\!]$ self-dual Calderbank-Shor-Steane (CSS) codes with $k \geq 1$ and prove necessary and sufficient conditions for the code to have a symplectic basis such that (1) transversal logical Hadamard gates $\bigotimes_{j=1}^{k} \bar{H}_j$ can be implemented by transversal physical Hadamard gates $\bigotimes_{i=1}^{n} H_i$, and (2) for any $(a_1,\dots,a_k)\in\{-1,1\}^k$, transversal logical phase gates $\bigotimes_{j=1}^{k} \bar{S}_j^{a_j}$ can be implemented by transversal physical phase gates $\bigotimes_{i=1}^{n} S_i^{b_i}$ for some $(b_1,\dots,b_n)\in\{-1,1\}^n$. Self-dual CSS codes satisfying the conditions include any codes with odd $n$. We also generalize the idea to concatenated self-dual CSS codes and show that certain logical Clifford gates have multiple transversal implementations, each by logical gates at a different level of concatenation. Several applications of our results for fault-tolerant quantum computation with low overhead are also provided.

quant-ph↗