Sciweavers

7486 search results - page 21 / 1498
» The Limits of Quantum Computers
Sort
View
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 2 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
UC
2007
Springer
14 years 2 months ago
Taming Non-compositionality Using New Binders
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...
Frédéric Prost
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
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 9 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...