Sciweavers

233 search results - page 4 / 47
» Interactive Proofs For Quantum Computations
Sort
View
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
13 years 7 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
13 years 11 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...
SPAA
2003
ACM
13 years 11 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 5 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo
ITICSE
2010
ACM
13 years 7 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