Nondestructive discrimination of Bell states between distant parties

Abstract

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, and it might be required to determine them separately at each location, without inline communication between parties. We present a scheme for discriminating an arbitrary Bell state distributed to two distant parties without destroying it. The scheme requires two entangled states that are pre-shared between the parties, and we show that without these ancillary resources, the probability of non-destructively discriminating the Bell state is bounded by 1/4, which is the same as random guessing. Furthermore, we demonstrate a proof-of-principle experiment through an IonQ quantum computer that our scheme can surpass classical bounds when applied to practical quantum processor.

9 pages including Appendix, 7 figures and 2 tables

References in corpus (14)

• Quantum entanglement
• Experimental quantum teleportation
• Quantum cryptography: Public key distribution and coin tossing
• Measurement-device-independent quantum key distribution
• Advances in Quantum Cryptography
• Secure quantum key distribution with realistic devices
• Side-channel-free quantum key distribution
• Continuous entanglement distribution over a transnational 248 km fibre link
• Highly efficient entanglement swapping and teleportation at telecom wavelength
• Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer
• A nondestructive Bell-state measurement on two distant atomic qubits
• Informationally symmetrical Bell state preparation and measurement
• Equitable multiparty quantum communication without a trusted third party
• Quantum Delocalised-Interactions