Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR07-013 | 6th February 2007 00:00

Quantum t-designs: t-wise independence in the quantum world

RSS-Feed




TR07-013
Authors: Andris Ambainis, Joseph Emerson
Publication: 9th February 2007 17:22
Downloads: 1480
Keywords: 


Abstract:

A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a state. We give efficient constructions for approximate quantum t-designs for arbitrary t.

We then show that an approximate 4-design provides a derandomization of the state-distinction problem considered by Sen (Complexity'05), which is relevant to solving certain instances of the hidden subgroup problem.



ISSN 1433-8092 | Imprint