Optimality of programmable quantum measurements
arXiv:quant-ph/0602084 · doi:10.1103/PhysRevA.73.052315
Abstract
We prove that for a programmable measurement device that approximates every POVM with an error , the dimension of the program space has to grow at least polynomially with . 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 (11)
- Programmable quantum gate arrays
- Randomizing quantum states: Constructions and applications
- Quantum multimeters: A programmable state discriminator
- Probabilistic implementation of universal quantum processors
- The volume of separable states is super-doubly-exponentially small
- Universal measurement apparatus controlled by quantum software
- Multiparty data hiding of quantum information
- Efficient universal programmable quantum measurements
- Probabilistic quantum multimeters
- Random subspaces for encryption based on a private shared Cartesian frame
- Improving performance of probabilistic programmable quantum processors
Cited by in corpus (14)
- Quantum teleportation scheme by selecting one of multiple output ports
- Optimal probabilistic storage and retrieval of unitary channels
- Optimal universal programming of unitary gates
- Fundamental energy requirement of reversible quantum operations
- Asymptotic performance of port-based teleportation
- Resource Quantification for the No-Programming Theorem
- Programmability of covariant quantum channels
- Probabilistic storage and retrieval of qubit phase gates
- Infinite-Dimensional Programmable Quantum Processors
- Notes on Deterministic Programming of Quantum Observables and Channels
- Universal adjointation of isometry operations using conversion of quantum supermaps
- Limitations on post-processing assisted quantum programming
- Port-Based State Preparation and Applications
- Quantum Advantage in Storage and Retrieval of Isometry Channels