Sciweavers

508 search results - page 12 / 102
» Poly-locality in quantum computing
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
13 years 8 months ago
Semantic Abstraction and Quantum Computation
abstraction and quantum computation Alessandra Di Pierro1 Dipartimento di Informatica University of Pisa Pisa, Italy Herbert Wiklicky2 Department of Computing Imperial College Lond...
Alessandra Di Pierro, Herbert Wiklicky
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
14 years 25 days ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
DAGSTUHL
2006
13 years 10 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 8 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
FOCS
1999
IEEE
14 years 27 days ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
John Watrous