Quantum state certification

Authors:

Abstract: We consider the problem of quantum state certification, where one is given

n

copies of an unknown

d

-dimensional quantum mixed state

h o

, and one wants to test whether

h o

is equal to some known mixed state

s i g m a

or else is

e p s i l o n

-far from

s i g m a

. The goal is to use notably fewer copies than the

O m e g a (d^{2})

needed for full tomography on

h o

(i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using

n = O (d / e p s i l o n)

copies, and one with respect to trace distance using

n = O (d / e p s i l o n^{2})

copies. The latter algorithm also applies when

s i g m a

is unknown as well. These copy complexities are optimal up to constant factors.

Recommendations

Cited In (10)

This page was built for publication: Quantum state certification