Sciweavers

523 search results - page 4 / 105
» On the Power of Quantum Proofs
Sort
View
DM
2008
93views more  DM 2008»
13 years 5 months ago
Nonbinary quantum error-correcting codes from algebraic curves
We give a new exposition and proof of a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes with ...
Jon-Lark Kim, Judy Walker
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...
JUCS
2006
137views more  JUCS 2006»
13 years 5 months ago
Progress in Quantum Computational Cryptography
: Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. ...
Akinori Kawachi, Takeshi Koshiba
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 23 days ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
MSCS
2006
106views more  MSCS 2006»
13 years 5 months ago
LQP: the dynamic logic of quantum information
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...
Alexandru Baltag, Sonja Smets