Sciweavers

7486 search results - page 15 / 1498
» The Limits of Quantum Computers
Sort
View
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 7 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
STACS
2005
Springer
14 years 1 months ago
Quantum Interactive Proofs with Competing Provers
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
Gus Gutoski, John Watrous
FLOPS
2004
Springer
14 years 27 days ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
CATS
2007
13 years 9 months ago
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate
d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...
Tomoyuki Yamakami
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