Probabilistic quantum multimeters
- 8 March 2004
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 69 (3) , 032302
Abstract
We propose quantum devices that can realize probabilistically different projective measurements on a qubit. The desired measurement basis is selected by the quantum state of a program register. First we analyze the phase-covariant multimeters for a large class of program states and then the universal multimeters for a special choice of program. In both cases we start with deterministic but error-prone devices and then proceed to devices that never make a mistake but from time to time give an inconclusive result. These multimeters are optimized (for a given type of program) with respect to the minimum probability of an inconclusive result. This concept is further generalized to multimeters that minimize the error rate for a given probability of an inconclusive result (or vice versa). Finally, we propose a generalization for qudits.Keywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Quantum gate arrays can be programmed to evaluate the expectation value of any operatorPhysical Review A, 2003
- Programmable quantum measurement device that approximates all projective measurements on a qubitFortschritte der Physik, 2003
- Comparison of two unknown pure quantum statesPhysics Letters A, 2002
- Universal Measurement Apparatus Controlled by Quantum SoftwarePhysical Review Letters, 2002
- Implementation of quantum maps by programmable quantum processorsPhysical Review A, 2002
- Quantum-controlled measurement device for quantum-state discriminationPhysical Review A, 2002
- Quantum learning and universal quantum matching machinePhysical Review A, 2002
- Storing Quantum Dynamics in Quantum States: A Stochastic Programmable GatePhysical Review Letters, 2002
- Probabilistic implementation of universal quantum processorsPhysical Review A, 2002
- Programmable Quantum Gate ArraysPhysical Review Letters, 1997