Problems
No problem here has yet been reviewed by a person.
Can one construct a plain-model, efficient, information-theoretically secure one-time unclonable-encryption scheme for one classical bit with exponentially small adversarial advantage?
Englert and Rehacek conjectured which measurement is globally information-optimal for an ensemble of equiangular equiprobable pure states. Their conjecture holds, via the remaining entropy inequalities of Holevo and Utkin.
We prove that every PPT linear map has finite entanglement-breaking index, thereby establishing the eventual entanglement-breaking property of PPT channels in full generality. Furthermore, by utilizing completely positive maps with low…
Does quantum memory give a query-complexity advantage for learning an unknown quantum channel, when protocols without it must measure after each channel use and keep only a classical transcript? It does, and the paper also determines how…
Online Shadow Tomography with log m dependence, while retaining poly(log(d)/ε) dependence. Also, matching the best classical bounds for Adaptive Data Analysis
Whether perfectly complete quantum key agreement can be built from quantumly secure one-way functions in a black-box way. It cannot: for any protocol where Alice and Bob exchange only classical messages, make at most q_A and q_B quantum…
Is the irreversibility of entanglement manipulation robust in the strong-converse sense - a strict separation between the exponential strong-converse distillable entanglement and the entanglement cost, as conjectured by Lami and Regula?…
Does bipartite bound information exist: classical correlations between two parties and an eavesdropper that cost secret bits to create, yet from which no secret key can ever be distilled?
What is the optimal uniform continuity bound for quantum conditional entropy in trace distance, depending only on the dimension of the conditioned system? The sharp bound h_2(δ) + δ log(d^2 - 1) up to δ = 1 - d^-2, conjectured by Wilde, is…