By Topic

How Many Copies are Needed for State Discrimination?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Aram W. Harrow ; Department of Computer Science & Engineering, University of Washington, Seattle, WA, USA ; Andreas Winter

The paper presents a problem motivated by the hidden subgroup problem, for which the "standard approach" is to use the oracle to produce the coset state. Abstractly, one is given a set of quantum states on a d-dimensional Hilbert space, with the property that the pairwise fidelities are bounded. The question is: How many copies of the unknown state does one need to be able to distinguish them all with high reliability? The minimal state will depend on the precise geometric position of the states relative to each other, but useful bounds can be obtained simply in terms of the number N and the fidelity F.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 1 )