Related papers: Distinguishing two-qubit states using local measur…
Identifying Bell states without destroying it is frequently dealt with in nowadays quantum technologies such as quantum communication and quantum computing. In practice, quantum entangled states are often distributed among distant parties,…
The discrimination of quantum processes, including quantum states, channels, and superchannels, is a fundamental topic in quantum information theory. It is often of interest to analyze the optimal performance that can be achieved when…
It is possible for two parties, Alice and Bob, to establish a secure communication link by sharing an ensemble of entangled particles, and then using these particles to generate a secret key. One way to establish that the particles are…
We solve the problem of the optimal cloning of pure entangled two-qubit states with a fixed degree of entanglement using local operations and classical communication. We show, that amazingly, classical communication between the parties can…
We study the prepare-and-measure scenario in which Alice transmits a quantum system to Bob, who then performs a quantum measurement. The quantum state of the system is unknown to Bob, and the measurement is unknown to Alice. It has recently…
We investigate the internal logic of a quantum computer with two qubits, in the two particular cases of non-entanglement (separable states) and maximal entanglement (Bell's states). To this aim, we consider an internal (reversible)…
For two symmetric quantum states one may be interested in maximizing the overlap under local operations applied to one of them. The question arises whether the maximal overlap can be obtained by applying the same local operation to each…
Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states. This classification concerns the entanglement properties of a single copy of the state. Accordingly, we say…
We address perfect discrimination of two separable states. When available states are restricted to separable states, we can theoretically consider a larger class of measurements than the class of measurements allowed in quantum theory. The…
We describe and realize an experimental procedure for assessing the incompatibility of two qubit measurements. The experiment consists in a state discrimination task where either measurement is used according to some partial intermediate…
We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC), and provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be…
Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate…
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…
We investigate the possibility of simulating partially entangled two qubit states by separable states of higher spins. First, we show that all partially entangled isotropic states can be simulated classically. We further investigate…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and…
We investigate local distinguishability of quantum states by use of the convex analysis about joint numerical range of operators on a Hilbert space. We show that any two orthogonal pure states are distinguishable by local operations and…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
We study randomized and quantum efficiency lower bounds in communication complexity. These arise from the study of zero-communication protocols in which players are allowed to abort. Our scenario is inspired by the physics setup of Bell…
We show how one can solve the problem of discriminating between qubit states. We use the quantum state discrimination duality theorem and the Bloch sphere representation of qubits which allows for an easy geometric and analytical…
Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output. In this work, we consider the setting where the two parties (a classical…