Related papers: Comment on "Optimal convex approximations of quant…
Quantum coherence (QCh) is considered to be a key ingredient in quantum resource theories and also plays a pivotal role in the design and implementation of various information processing tasks. Consequently, it becomes important for us to…
We study the problem of entanglement-assisted quantum state redistribution in the one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in terms of the max-relative entropy and the…
We consider a quantum state shared between many distant locations, and define a quantum information processing primitive, state merging, that optimally merges the state into one location. As announced in [Horodecki, Oppenheim, Winter,…
Whenever we do not have an informationally complete set of measurements, the estimate of a quantum state can not be uniquely determined. In this case, among the density matrices compatible with the available data, it is commonly preferred…
The completeness of quantum state space, is usually expressed as \sum_{m=0}^{\infty}|m><m|=1, where {|m>} is selected set of quantum states (basis). Density matrix |m><m| describes a pure quantum state. In this paper, by virtue of the…
The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation…
We present a necessary and sufficient condition for the reachable set, i.e., the set of states reachable from a ball of initial states at some time, of an ordinary differential equation to be convex. In particular, convexity is guaranteed…
We investigate generalized measurements, based on positive-operator-valued measures, and von Neumann measurements for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. In particular, we…
Symmetric quantum states are fascinating objects. They correspond to multipartite systems that remain invariant under particle permutations. This symmetry is reflected in their compact mathematical characterisation but also in their unique…
In contrast to the wide-spread opinion that any separable quantum state satisfies every classical probabilistic constraint, we present a simple example where a separable quantum state does not satisfy the original Bell inequality although…
For many applications the presence of a quantum advantage crucially depends on the availability of resourceful states. Although the resource typically depends on the particular task, in the context of multipartite systems entangled quantum…
The mixed states are important in quantum optics since they frequently appear in the decoherence problems. When one of the components of the system is prepared in the mixed state and the evolution operator of this system is not available,…
Variational inequality problems allow for capturing an expansive class of problems, including convex optimization problems, convex Nash games and economic equilibrium problems, amongst others. Yet in most practical settings, such problems…
This paper presents self-contained proofs of the strong subadditivity inequality for quantum entropy and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps.…
We study the optimal way to estimate the quantum expectation value of a physical observable when a finite number of copies of a quantum pure state are presented. The optimal estimation is determined by minimizing the squared error averaged…
A method for deriving accurate analytic approximations for Markovian open quantum systems was recently introduced in [F. Lucas and K. Hornberger, Phys. Rev. Lett. 110, 240401 (2013)]. Here, we present a detailed derivation of the underlying…
Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly…
Recent advances in quantum technology facilitate the realization of information processing using quantum computers at least on the small and intermediate scales of up to several dozens of qubits. We investigate entanglement cost required…
We discuss the problem of estimating a general (mixed) qubit state. We give the optimal guess that can be inferred from any given set of measurements. For collective measurements and for a large number $N$ of copies, we show that the error…