Sciweavers

342 search results - page 25 / 69
» Quantum Algorithms
Sort
View
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
15 years 3 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 3 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
ICS
2010
Tsinghua U.
15 years 2 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
15 years 10 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer