New Research on the Resource Theory of Quantum Channels
Recent research by a team at Southern University of Science and Technology (SUSTech) introduced a new resource theory of quantum channels and applied it to study communication over …
Application of the resource theory of channels to communication scenarios
A resource theory built around communication-useless constant channels yields operational results for one-shot channel coding and simulation, and clarifies the role of nonsignaling …
ryuji-takagi
Entanglement Detection via Direct-Sum Majorization Uncertainty Relations
In this paper we investigate the relationship between direct-sum majorization formulation of uncertainty relations and entanglement, for the case of two observables. Our primary …
Optimal verification of two-qubit pure states
This work completely characterizes optimal local verification of any two-qubit pure state, showing that two-way classical communication reaches the power of separable measurements …
Uncertainty relations in the presence of quantum memory for mutually unbiased measurements
In a work by Berta et al. [Phys. Rev. A 90, 062127 (2014)], uncertainty relations in the presence of quantum memory were formulated for mutually unbiased bases using conditional …
One-dimensional lackadaisical quantum walks
In this paper, we study the properties of lackadaisical quantum walks (LQWs) on a line. This model was first proposed in ([Wong et al., J. Phys. A: Math. Theor. 48 435304, …
Grover walks on a line with absorbing boundaries
In this paper, we study Grover walks on a line with one and two absorbing boundaries. In particular, we present some results for the absorbing probabilities in both a semi-finite …
A Novel Quantum Random Number Generation Algorithm Used by Smartphone Camera
A smartphone-camera protocol turns photon detection into a practical source of quantum random numbers and incorporates algorithmic postprocessing for usable output.
nan-wu
On Four Non-Computable Decision Problems
Four decision problems are analyzed through the limits of algorithmic computability, identifying cases for which no general deciding procedure can exist.