Sciweavers

934 search results - page 90 / 187
» Quantum Algorithmic Entropy
Sort
View
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 9 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
14 years 1 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 3 months ago
The second harmonic generation case-study as a gateway for es to quantum control problems
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
Ofer M. Shir, Thomas Bäck
AVI
2004
13 years 10 months ago
Quantum web fields and molecular meanderings: visualising web visitations
This paper describes two visualisation algorithms that give an impression of current activity on a web site. Both focus on giving a sense of the trail of individual visitors withi...
Geoffrey Ellis, Alan J. Dix
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 3 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...