How many copies are needed for gate discrimination?
- Giulio Chiribella ,
- Giacomo Mauro D'Ariano ,
- Martin Roetteler
in Proceedings 8th Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC'13)
2013 | Proceedings 8th Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC'13) edition
We address the problem of finding the minimum number of queries needed to perfectly identify an unknown gate within a finite set of alternatives. We provide a series of upper and lower bounds, by establishing a connection with the task of unambiguous discrimination, where one does not tolerate errors but allows for an inconclusive result. Our bounds show that the minimum number of queries needed for perfect discrimination is significantly smaller than the number required by the best known strategy based on pairwise tests.