2005/01/20 by Jihane Mimih, Mark Hillery · 13 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Cluster state #Combinatorics #Computer science #Mathematics #Measure (data warehouse) #Multipartite #Physics #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Quantum state #Qubit #Simple (philosophy) #State (computer science) #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.71.012329
published in Physical Review A 71(1) (American Physical Society)
openalex publication_date 2005/01/20 · arxiv created 2005/01/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We initially consider a quantum system consisting of two qubits, which can be in one of two nonorthogonal states \ensuremath|\ensuremathΨ0⟩ and \ensuremath|\ensuremathΨ1⟩. We distribute the qubits to two parties, Alice and Bob. They each measure their qubits and then compare their measurement results to determine which state they were sent. This procedure is error-free, which implies that it must sometimes fail. In addition, no quantum memory is required; it is not necessary for one of the qubits to be stored until the result of the measurement on the other is known. We consider the cases in which, should failure occur, both parties receive a failure signal or only one does. In the latter case, if the two states share the same Schmidt basis, the states can be discriminated with the same failure probability that would be obtained if the qubits were measured together. This scheme is sufficiently simple that it can be generalized to multipartite qubit, and qudit, states. Applications to quantum secret sharing are discussed. Finally, we present an optical scheme to experimentally realize the protocol in the case of two qubits.