Sciweavers

934 search results - page 14 / 187
» Quantum Algorithmic Entropy
Sort
View
ISTCS
1997
Springer
13 years 11 months ago
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
Gilles Brassard, Peter Høyer
WSCG
2004
118views more  WSCG 2004»
13 years 9 months ago
New Method for Geometric Constraint Solving Based on the Genetic Quantum Algorithm
This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chrom...
Chunhong Cao, Wenhui Li
SODA
2003
ACM
100views Algorithms» more  SODA 2003»
13 years 9 months ago
Quantum algorithms for some hidden shift problems
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
Wim van Dam, Sean Hallgren, Lawrence Ip
ALT
2006
Springer
14 years 4 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...