Optimality of programmable quantum measurements

Abstract

We prove that for a programmable measurement device that approximates every POVM with an error $\le \delta$, the dimension of the program space has to grow at least polynomially with $\frac{1}{\delta }$. In the case of qubits we can improve the general result by showing a linear growth. This proves the optimality of the programmable measurement devices recently designed in [G. M. D'Ariano and P. Perinotti, Phys. Rev. Lett. \textbf{94}, 090401 (2005)].

References in corpus (4)

• Randomizing quantum states: Constructions and applications
• The volume of separable states is super-doubly-exponentially small
• Multiparty data hiding of quantum information
• Random subspaces for encryption based on a private shared Cartesian frame

Cited by in corpus (1)

• Quantum teleportation scheme by selecting one of multiple output ports