|
Volumn 102, Issue 19, 2009, Pages
|
Are random pure states useful for quantum computation?
|
Author keywords
[No Author keywords available]
|
Indexed keywords
CLASSICAL CONTROLS;
CLUSTER STATE;
COMPUTING POWER;
ERROR COMPUTATIONS;
MEASUREMENT-BASED QUANTUM COMPUTATIONS;
POLYNOMIAL-TIME;
PROBABILISTIC POLYNOMIAL TIME;
PURE STATE;
QUANTUM COMPUTATIONS;
RANDOM BITS;
RANDOM STATE;
COMPUTATIONAL LINGUISTICS;
DC MOTORS;
QUANTUM COMPUTERS;
QUANTUM THEORY;
POLYNOMIAL APPROXIMATION;
|
EID: 65549153263
PISSN: 00319007
EISSN: 10797114
Source Type: Journal
DOI: 10.1103/PhysRevLett.102.190502 Document Type: Article |
Times cited : (133)
|
References (17)
|