Sciweavers

934 search results - page 8 / 187
» Quantum Algorithmic Entropy
Sort
View
DAC
2004
ACM
14 years 8 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
COCO
2007
Springer
142views Algorithms» more  COCO 2007»
14 years 1 months ago
Quantum t-designs: t-wise Independence in the Quantum World
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...
Andris Ambainis, Joseph Emerson
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 7 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 7 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
DSN
2004
IEEE
13 years 11 months ago
Fault Tolerant Computation on Ensemble Quantum Computers
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual com...
P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, F...