The Quantum Formalization Drive

The von Neumann entropy at the output of a bosonic channel with thermal noise is analyzed. Coherent-state inputs are conjectured to minimize this output entropy. Physical and mathematical evidence in support of the conjecture is provided. A stronger conjecture--that output states resulting from coherent-state inputs majorize the output states from other…

The information capacities and ``distillability'' of a quantum channel are studied in the presence of auxiliary resources. These include prior entanglement shared between the sender and receiver and free classical bits of forward and backward communication. Inequalities and trade-off curves are derived. In particular an alternative proof is given that in…

We show how to compute or at least to estimate various capacity-related quantities for Bosonic Gaussian channels. Among these are the coherent information, the entanglement assisted classical capacity, the one-shot classical capacity, and a new quantity involving the transpose operation, shown to be a general upper bound on the quantum capacity, even…

We present a simplified framework for proving sequential composability in the quantum setting. In particular, we give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damgard et al. (FOCS '05, CRYPTO '07) showed how to securely implement bit…

By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gaussian states. In particular, these bounds are useful when the Gaussian states are unitarily inequivalent, i.e., they differ in their symplectic invariants.

After proving a general no-cloning theorem for black boxes, we derive the optimal universal cloning of unitary transformations, from one to two copies. The optimal cloner is realized by quantum channels with memory, and greately outperforms the optimal measure-and-reprepare cloning strategy. Applications are outlined, including two-way quantum cryptographic…

In this paper we develop two types of tools to deal with differentiability properties of vectors in continuous representations $\pi \: G \to \GL(V)$ of an infinite dimensional Lie group $G$ on a locally convex space $V$. The first class of results concerns the space $V^\infty$ of smooth vectors. If $G$ is a Banach--Lie group, we define a topology on the space $V^\infty$…

We address the problem of the information-disturbance trade-off associated to the estimation of a quantum transformation, and show how the extraction of information about the a black box causes a perturbation of the corresponding input-output evolution. In the case of a black box performing a unitary transformation, randomly distributed according to the…

We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1 -> 2 learning of the measurement, otherwise the task is…

A definition of the Schmidt number of a state of an infinite dimensional bipartite quantum system is given and properties of the corresponding family of Schmidt classes are considered. The existence of states with a given Schmidt number such that any their countable convex decomposition does not contain pure states with finite Schmidt rank is established.…

We study quantum learning algorithms for quantum measurements. The optimal learning algorithm is derived for arbitrary von Neumann measurements in the case of training with one or two examples. The analysis of the case of three examples reveals that, differently from the learning of unitary gates, the optimal algorithm for learning of quantum measurements…

A consistent functional calculus approach to the spectral theorem for strongly commuting normal operators on Hilbert spaces is presented. In contrast to the common approaches using projection-valued measures or multiplication operators, here the functional calculus is not treated as a subordinate but as the central concept. Based on five simple axioms for a…

We consider three different communication tasks for quantum broadcast channels, and we determine the capacity region of a Hadamard broadcast channel for these various tasks. We define a Hadamard broadcast channel to be such that the channel from the sender to one of the receivers is entanglement-breaking and the channel from the sender to the other receiver…

We prove the existence of a universal recovery channel that approximately recovers states on a v. Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I v. Neumann algebras by Junge at al. [arXiv:1509.07127]. We broadly follow their…

We present an efficient machine learning (ML) algorithm for predicting any unknown quantum process $\mathcal{E}$ over $n$ qubits. For a wide range of distributions $\mathcal{D}$ on arbitrary $n$-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process~$\mathcal{E}$, with a small average error over…

Let $\mathfrak{g}$ be a real finite-dimensional Lie algebra containing pointed generating invariant closed convex cones. We determine those derivations $D$ of $\mathfrak{g}$ which induce a 3-grading of the form $\mathfrak{g} = \mathfrak{g}_{-1} \oplus \mathfrak{g}_0 \oplus \mathfrak{g}_1$ on $\mathfrak{g}$ such that the $(\pm 1)$-eigenspaces $\mathfrak{g}_{\pm 1}$ of $D$ ar…