Related papers: Probabilistic cloning with supplementary informati…

The sequential unambiguous state discrimination (SSD) of two states prepared in arbitrary prior probabilities is studied, and compared with three strategies that allow classical communication. The deviation from equal probabilities…

We derive a lower bound for the optimal fidelity for deterministic cloning a set of n pure states. In connection with states estimation, we obtain a lower bound about average maximum correct states estimation probability.

Quantum cloning of two identical mixed qubits $\rho \otimes \rho $ is studied. We propose the quantum cloning transformations not only for the triplet (symmetric) states but also for the singlet (antisymmetric) state. We can copy these two…

The impossibility of simultaneously cloning non-orthogonal states lies at the foundations of quantum theory. Even when allowing for approximation errors, cloning an arbitrary unknown pure state requires as many initial copies as needed to…

Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation…

State-machine replication, a fundamental approach to fault tolerance, requires replicas to execute commands deterministically, which usually results in sequential execution of commands. Sequential execution limits performance and underuses…

Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be…

Locally indistinguishable states are useful to distribute information among spatially separated parties such that the information is locked. This implies that the parties are not able to extract the information completely via local…

We show that in a cloning process, whether deterministic inexact or probabilistic exact, one can take an arbitrary blank state while still using a fixed cloning machine.

Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning…

Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability…

We consider the class of (N+1)-partite states suitable for protocols where there is a powerful party, the authority, and the other N parties play the same role, namely the state of their system live in the symmetric Hilbert space. We show…

It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. This property ensures the security of quantum key distribution. It is therefore an important task in quantum communication to design and…

In the task of discriminating between nonorthogonal quantum states from multiple copies, the key parameters are the error probability and the resources (number of copies) used. Previous studies have considered the task of minimizing the…

The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…

We introduce the notions of algorithmic mutual information and rarity of quantum states. These definitions enjoy conservation inequalities over unitary transformations and partial traces. We show that a large majority of pure states have…

We consider one copy of a quantum system prepared in one of two non-orthogonal pure product states of multipartite distributed among separated parties. We show that there exist protocols which obtain optimal probability in the sense of…

Although the realization of useful quantum computers poses significant challenges, swift progress in emerging quantum technologies is making this goal realistically approachable. In this context, one of the essential resources is quantum…

An efficient paradigm for multi-party computation (MPC) are protocols structured around access to shared pre-processed computational resources. In this model, certain forms of correlated randomness are distributed to the participants prior…

"Broadcasting", namely distributing information over many users, suffers in-principle limitations when the information is quantum. This poses a critical issue in quantum information theory, for distributed processing and networked…