Sciweavers

5334 search results - page 8 / 1067
» Communicating quantum processes
Sort
View
FOCS
2008
IEEE
13 years 9 months ago
Quantum Multi Prover Interactive Proofs with Communicating Provers
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
CCR
2004
102views more  CCR 2004»
13 years 8 months ago
Infrastructure for the quantum internet
A team of researchers from the Massachusetts Institute of Technology (MIT) and Northwestern University (NU) is developing a system for long-distance, high-fidelity qubit teleporta...
Seth Lloyd, Jeffrey H. Shapiro, Franco N. C. Wong,...
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 1 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
CEC
2003
IEEE
14 years 1 months ago
Exploring the search space of quantum programs
Here we present a first study of search spaces and fitness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa proble...
André Leier, Wolfgang Banzhaf
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 8 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck