Efficient universal programmable quantum measurements

Abstract

A universal programmable detector is a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension d for the ancilla only approximate universal programmability is possible, with "size" d=f(1/e) increasing function of the "accuracy" 1/e. In this letter we show that, much better than the exponential size known in the literature, one can achieve polynomial size. An explicit example with linear size is also presented. Finally, we show that for covariant measurements exact programmability is feasible.

4 pages, RevTex4

References in corpus (2)

• Extremal covariant POVM's
• Experimental realization of a programmable quantum-state discriminator and a phase-covariant quantum multimeter

Cited by in corpus (34)

• Observable measure of quantum coherence in finite dimensional systems
• Transforming quantum operations: quantum supermaps
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum teleportation scheme by selecting one of multiple output ports
• Optimal probabilistic storage and retrieval of unitary channels
• A no-broadcasting theorem for quantum asymmetry and coherence and a trade-off relation for approximate broadcasting
• Witnessing multipartite entanglement by detecting asymmetry
• Convex optimization of programmable quantum computers
• Optimization and learning of quantum programs
• Approximate programmable quantum processors
• Realization of POVMs using measurement-assisted programmable quantum processors
• Programmable unknown quantum-state discriminators with multiple copies of program and data: A Jordan basis approach
• Resource Quantification for the No-Programming Theorem
• Optimal universal programmable detectors for unambiguous discrimination
• Classicality without local discriminability: decoupling entanglement and complementarity
• Conservation-Law-Induced Quantum Limits for Physical Realizations of the Quantum NOT Gate
• Experimental realization of programmable quantum gate
• Programmability of covariant quantum channels
• A prototype of quantum von Neumann architecture
• Convex approximations of quantum channels
• Optimality of programmable quantum measurements
• Success probabilities for universal unambiguous discriminators between unknown pure states
• Communication Cost of Quantum Processes
• Probabilistic storage and retrieval of qubit phase gates
• The Quantum No-Stretching: A geometrical interpretation of the no-cloning theorem
• Quantum Limits of Measurements Induced by Multiplicative Conservation Laws: Extension of the Wigner-Araki-Yanase Theorem
• WAY beyond conservation laws
• Optimal programmable unambiguous discriminator between two unknown latitudinal states
• Notes on Deterministic Programming of Quantum Observables and Channels
• Universal adjointation of isometry operations using conversion of quantum supermaps
• Fundamental limitations on the recoverability of quantum processes
• Application of quantum algorithms to the study of permutations and group automorphisms
• Limitations on post-processing assisted quantum programming
• Quantum Advantage in Storage and Retrieval of Isometry Channels