General measurements with limited resources and their application to quantum unambiguous state discrimination
arXiv:2009.05276 · doi:10.1007/s11128-024-04468-w
Abstract
In this report, we present a framework for implementing an arbitrary -outcome generalized quantum measurement (POVM) on an -qubit register as a sequence of two-outcome measurements requiring only single ancillary qubit. Our procedure offers a particular construction for the two-outcome partial measurements which can be composed into a full implementation of the measurement on any gate architecture. This implementation in general requires classical feedback; we present specific cases when this is not the case. We apply this framework on the unambiguous state discrimination and analyze possible strategies. In the simplest case, it gives the same construction as is known, if we opt for performing conclusiveness measurement first. However, it also offers possibility of performing measurement for one of the state outcomes first, leaving conclusiveness measurement for later. This shows flexibility of presented framework and opens possibilities for further optimization. We present discussion also on biased qubit case as well as general case of unambiguous quantum state discrimination in higher dimension.
27 pages, 8 figures
References in corpus (8)
- Mutually unbiased bases and symmetric informationally complete measurements in Bell experiments
- Binary search trees for generalized measurement
- Spherical Code Key Distribution Protocols for Qubits
- Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
- Implementation of a general single-qubit positive operator-valued measure on a circuit-based quantum computer
- Implementation of quantum measurements using classical resources and only a single ancillary qubit
- Implementation of discrete positive operator valued measures on linear optical systems using cosine-sine decomposition
- Simulation of positive operator-valued measures and quantum instruments via quantum state preparation algorithms