Sciweavers

934 search results - page 12 / 187
» Quantum Algorithmic Entropy
Sort
View
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 7 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
ISMVL
2007
IEEE
102views Hardware» more  ISMVL 2007»
14 years 1 months ago
A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic
We generalize the binary Deutsch-Jozsa algorithm to nvalued logic using the quantum Fourier transform. Our algorithm is not only able to distinguish between constant and balanced ...
Yale Fan
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
ENTCS
2008
90views more  ENTCS 2008»
13 years 7 months ago
Quantum Data and Control Made Easier
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
Michael Lampis, Kyriakos G. Ginis, Michalis A. Pap...
ITICSE
2010
ACM
13 years 9 months ago
What did qubits ever do for me: an answer for CS2 students
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
Michael Main, Robert Frohardt, Yingdan Huang