Entanglement is not necessary for perfect discrimination between unitary operations

DOI10.1103/PHYSREVLETT.98.100503MaRDI QIDQ3107901zbMATH OpenWikidataFDO

Authors Runyao Duan, Yuan Feng, Mingsheng Ying

Publication date 26 December 2011

Published in Physical Review Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0601150

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40)

Abstract: We show that a unitary operation (quantum circuit) secretely chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations is required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.

Recommendations

• Unitary transformations can be distinguished locally
• Quantum channel discrimination without entanglement
• Determination of locally perfect discrimination for two-qubit unitary operations
• Unambiguous discrimination among oracle operators
• Single-shot discrimination of quantum unitary processes

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• On the Power of Quantum Computation
• Quantum computing without entanglement
• Rapid solution of problems by quantum computation
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

Cited in

(23)

• Exact quantum search by parallel unitary discrimination schemes
• Determination of locally perfect discrimination for two-qubit unitary operations
• Quantum channel discrimination without entanglement
• The SWITCH test for discriminating quantum evolutions
• Unambiguous discrimination among oracle operators
• On the discrimination of qubit channels
• scientific article; zbMATH DE number 5510501 (Why is no real title available?)
• A hybrid quantum key distribution protocol based on extended unitary operations and fountain codes
• Publisher’s Note: Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations [Phys. Rev. Lett.PRLTAO0031-900798, 100503 (2007)]
• Semantic embedding for quantum algorithms
• Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
• Unitary transformations can be distinguished locally
• Optimal discrimination between quantum operations
• Amortized channel divergence for asymptotic quantum channel discrimination
• Fidelity and Fisher information on quantum channels
• Perfect discrimination of projective measurements with the rank of all projectors being one
• Eavesdropping and improvement to multiparty quantum secret sharing with collective eavesdropping-check
• Query complexity of unitary operation discrimination
• Distinguishing quantum operations having few Kraus operators
• Ideal quantum Reading of optical memories
• Discrimination of POVMs with rank-one effects
• Identification of a reversible quantum gate: assessing the resources
• Tutorial review. Discrimination of quantum states

This page was built for publication: Entanglement is not necessary for perfect discrimination between unitary operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107901)