Sciweavers

700 search results - page 39 / 140
» An Introduction to Quantum Computing
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
13 years 7 months ago
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)
ly abstract model for a quantum unctional language (extended abstract) Peter Selinger1 ,2 Dalhousie University, Halifax, Nova Scotia, Canada Beno^it Valiron3 University of Ottawa, ...
Peter Selinger, Benoît Valiron
FOCS
2000
IEEE
13 years 11 months ago
Succinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
John Watrous
STOC
2000
ACM
97views Algorithms» more  STOC 2000»
14 years 2 days ago
Quantum lower bounds by quantum arguments
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
Andris Ambainis
ISCA
2006
IEEE
107views Hardware» more  ISCA 2006»
14 years 1 months ago
Distributed Arithmetic on a Quantum Multicomputer
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and t...
Rodney Van Meter, Kae Nemoto, W. J. Munro, Kohei M...
TCS
2012
12 years 3 months ago
Better short-seed quantum-proof extractors
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversa...
Avraham Ben-Aroya, Amnon Ta-Shma