Quantum theory of unambiguous measurements
Michal Sedl\'ak

TL;DR
This paper develops a comprehensive framework for unambiguous quantum discrimination, solving tasks like state comparison, state identification, and channel comparison using optimal linear optics setups and prior information.
Contribution
It introduces a unified framework for unambiguous discrimination problems and provides optimal solutions for state and channel comparison using linear optics.
Findings
Optimal unambiguous comparison of unknown quantum states achieved.
Proposed linear optics setups are simple and optimal for specific discrimination tasks.
Analysis of noise effects on the performance of the discrimination schemes.
Abstract
In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the discrimination among finite number of alternatives as the discrimination among finite number of average constituents. Using this framework I solve several unambiguous tasks. I present a solution to optimal unambiguous comparison of two ensembles of unknown quantum states. I consider two cases: 1) The two unknown states are arbitrary pure states of qudits. 2) Alternatively, they are coherent states of single-mode optical fields. For this case I propose simple and optimal experimental setup composed of beam-splitters and a photodetector. As a second tasks I consider an unambiguous identification (UI) of coherent states. In this task identical quantum systems are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
