Sciweavers

11547 search results - page 21 / 2310
» Quantum computing and communication
Sort
View
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
15 years 6 months 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
15 years 3 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
QUANTUMCOMM
2009
Springer
15 years 8 months ago
The Case for Quantum Key Distribution
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructur...
Douglas Stebila, Michele Mosca, Norbert Lütke...
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 6 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
FOCS
1999
IEEE
15 years 6 months 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