Sciweavers

523 search results - page 26 / 105
» On the Power of Quantum Proofs
Sort
View
DFT
2006
IEEE
122views VLSI» more  DFT 2006»
15 years 5 months ago
Efficient and Robust Delay-Insensitive QCA (Quantum-Dot Cellular Automata) Design
The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synch...
Minsu Choi, Myungsu Choi, Zachary D. Patitz, Nohpi...
FOCS
2006
IEEE
15 years 8 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
16 years 2 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»
15 years 6 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
CORR
2007
Springer
72views Education» more  CORR 2007»
15 years 1 months ago
A Proof of a Recursion for Bessel Moments
We provide a proof of a conjecture in [2] on the existence and form of linear recursions for moments of powers of the Bessel function K0.
Jonathan M. Borwein, Bruno Salvy