相关论文: On quantum coding for ensembles of mixed states
We study the fully entangled fraction of quantum states. An upper bound is obtained for arbitrary dimensional bipartite systems. This bound is shown to be exact for the case of two-qubit systems. An inequality related the fully entangled…
We study an optimized measurement which discriminates N mixed quantum states occurring with given prior robabilities. The measurement yields the maximum achievable confidence for each of the N conclusive outcomes, thereby keeping the…
We pose the question whether the asymptotic equivalence between quantum cloning and quantum state estimation, valid at single-copy level, still holds when all the copies are examined jointly. For an N-to-M cloner, we consider the overall…
The N to M (M>N) universal quantum broadcasting of mixed states are proposed for qubits system. The broadcasting of mixed states is universal and optimal in the sense that the shrinking factor is independent of input state and achieves the…
In this short note, I show how a recent result of Alhejji and Smith [arXiv:1909.00787] regarding an optimal uniform continuity bound for classical conditional entropy leads to an optimal uniform continuity bound for quantum conditional…
The optimization of measurements for the state distinction problem has recently been applied to the theory of quantum algorithms with considerable successes, including efficient new quantum algorithms for the non-abelian hidden subgroup…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
We investigate the optimal distribution of quantum information over multipartite systems in asymmetric settings. We introduce cloning transformations that take $N$ identical replicas of a pure state in any dimension as input, and yield a…
In this work, we consider optimal state discrimination for a quantum system that interacts with an environment, i.e., states evolve under a quantum channel. We show the conditions on a quantum channel and an ensemble of states such that a…
We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive…
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can…
The Schmidt coefficients capture all entanglement properties of a pure bipartite state and therefore determine its usefulness for quantum information processing. While the quantification of the corresponding properties in mixed states is…
The relative error of cloning of quantum states with arbitrary prior probabilities is considered. It is assumed that the ancilla may contain some a priori information about the input state to be cloned. The lower bound on the relative error…
We consider measurement-based quantum computation using the state of a spin-lattice system in equilibrium with a thermal bath and free to evolve under its own Hamiltonian. Any single qubit measurements disturb the system from equilibrium…
We provide a quantum benchmark for teleportation and storage of single-mode squeezed states with zero displacement and a completely unknown degree of squeezing along a given direction. For pure squeezed input states, a fidelity higher than…
We study the fully entangled fraction of a quantum state. An upper bound is obtained for arbitrary bipartite system. This upper bound only depends on the Frobenius norm of the state.
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…
Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing…
We consider the unambiguous discrimination of multipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition to realize the…
We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to…