loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
Quantum t-designs: t-wise Independence in the Quantum World
San Diego, California
June 13-March 16
ISBN: 0-7695-2780-9
ASCII Text
x 
 
Andris Ambainis, Joseph Emerson, "Quantum t-designs: t-wise Independence in the Quantum World," Computational Complexity, Annual IEEE Conference on, pp. 129-140, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2007.26,
author = {Andris Ambainis and Joseph Emerson},
title = {Quantum t-designs: t-wise Independence in the Quantum World},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2007},
issn = {1093-0159},
pages = {129-140},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2007.26},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - Quantum t-designs: t-wise Independence in the Quantum World
SN - 1093-0159
SP129
EP140
A1 - Andris Ambainis,
A1 - Joseph Emerson,
PY - 2007
KW - null
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
Andris Ambainis, University of Waterloo, Canada
Joseph Emerson, University of Waterloo, Canada
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 statedistinction problem considered by Sen (quant-ph/0512085), which is relevant to solving certain instances of the hidden subgroup problem.
Citation:
Andris Ambainis, Joseph Emerson, "Quantum t-designs: t-wise Independence in the Quantum World," ccc, pp.129-140, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.