Related papers: Separability of very noisy mixed states and implic…
The probability that a generic real, complex or quaternionic two-qubit state is separable can be considered to be the sum of three contributions. One is from those states that are absolutely separable, that is those (which can not be…
General wisdom tells us that if two quantum states are ``macroscopically distinguishable'' then their superposition should be hard to observe. We make this intuition precise and general by quantifying the difficulty to observe the quantum…
We compute the probability that a bipartite quantum state is separable by Monte Carlo sampling. This is carried out for rebits, qubits and quaterbits. We sampled $5\times 10^{11}$ points for each of these three cases. The results strongly…
We derive the optimal universal broadcasting for mixed states of qubits. We show that the nobroadcasting theorem cannot be generalized to more than a single input copy. Moreover, for four or more input copies it is even possible to purify…
We develop connections between generalised notions of entanglement and quantum computational devices where the measurements available are restricted, either because they are noisy and/or because by design they are only along Pauli…
We qualify the entanglement of arbitrary mixed states of bipartite quantum systems by comparing global and marginal mixednesses quantified by different entropic measures. For systems of two qubits we discriminate the class of maximally…
The question of the generation of random mixed states is discussed, aiming for the computation of probabilistic characteristics of composite finite dimensional quantum systems. Particularly, we consider the generation of the random…
If a pure state of a qubit pair is developed over the four basis states, it is known that an equality between the four coefficients of that development exists if and only if that state is unentangled. This paper considers an arbitrary pure…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.
Noisy computation and reversible computation have been studied separately, and it is known that they are as powerful as unrestricted computation. We study the case where both noise and reversibility are combined and show that the combined…
We consider a quantum system with a finite number of distinguishable quantum states, which may be partitioned freely by a number of quantum particles, assumed to be maximally entangled. We show that if we partition the system into a number…
The problem of discriminating with minimum error between two mixed quantum states is reviewed, with emphasize on the detection operators necessary for performing the measurement. An analytical result is derived for the minimum probability…
The task of state discrimination for a set of mutually orthogonal pure states is trivial if one has access to the corresponding sharp (projection-valued) measurement, but what if we are restricted to an unsharp measurement? Given that any…
We show that higher order inter-group covariances involving even number of qubits are necessarily positive semidefinite for N qubit separable states, which are completely symmetric under permutations of the qubits. This identification leads…
We consider the problem of broadcasting arbitrary states of radiation modes from N to M>N copies by a map that preserves the average value of the field and optimally reduces the total noise in conjugate variables. For N>=2 the broadcasting…
We study how much noise can be tolerated by a universal gate set before it loses its quantum-computational power. Specifically we look at circuits with perfect stabilizer operations in addition to imperfect non-stabilizer gates. We prove…
The quantum probability distribution arising from single-copy von Neumann measurements on an arbitrary two-qubit state is decomposed into the local and nonlocal parts, in the approach of Elitzur, Popescu and Rohrlich [A. Elitzur, S.…
While the recent demonstration of accurate computations of classically intractable simulations on noisy quantum processors brings quantum advantage closer, there is still the challenge of demonstrating it for practical problems. Here we…
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…
It is shown that the set of rank r separable states is measure zero within the set of low rank states provided r is less than an upper bound which depends upon the number of particles and the dimensions of the spaces they are modelled on.…