Quantum Filtering and Discrimination between Sets of Boolean Functions
Authors:
- 25 June 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 90 (25) , 257901
Abstract
In quantum state filtering one wants to determine whether an unknown quantum state, which is chosen from a known set of states, , is either a specific state, say , or one of the remaining states, . We present the optimal solution to this problem, in terms of generalized measurements, for the case that the filtering is required to be unambiguous. As an application, we propose an efficient, probabilistic quantum algorithm for distinguishing between sets of Boolean functions, which is a generalization of the Deutsch-Jozsa algorithm.
Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Optimum unambiguous discrimination between subsets of nonorthogonal quantum statesPhysical Review A, 2002
- Minimum-error discrimination between subsets of linearly dependent quantum statesPhysical Review A, 2002
- Quantum state discriminationContemporary Physics, 2000
- Optimal distinction between non-orthogonal quantum statesJournal of Physics A: General Physics, 1998
- Unambiguous discrimination between linearly independent quantum statesPhysics Letters A, 1998
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum cryptography using any two nonorthogonal statesPhysical Review Letters, 1992
- How to differentiate between non-orthogonal statesPhysics Letters A, 1988
- Overlap and distinguishability of quantum statesPhysics Letters A, 1988
- How to differentiate between non-orthogonal statesPhysics Letters A, 1987