Searching for authors named "Andris Ambainis" – sorted by Relevance.
48 documents found, showing 1 through 10.
Next 10 →
-
On Learning Formulas in the Limit and With Assurance
- …We consider the learning of formulas in the model of [2, 5]. We show that, in this model, a formula f can be learned in the limit if and only if :f can be learned with assurance. 1 Introduction Barzdins, Freivalds and Smith[2] introduced a learning model for inferring formulas of first order pre…
- Add To MetaCart
-
Some Results on Mathematical Konane
- …Introduction This project studies mathematical Konane in three directions. First, it is shown that, for some 1 \Theta n Konane positions, fragments separated by 2 empty squares can be treated as separate positions. Although these fragments can interact, the moves causing interaction always give wo…
- Add To MetaCart
-
Set Constraints
- …This project surveys set constraints and their use for program analysis. It is shown how to construct set constraints from a program and how to solve them. Then, ideas for scaling these methods to analyze larger programs are described. 1 …
- Add To MetaCart
-
A better lower bound for quantum algorithms searching an ordered list
- …We show that any quantum algorithm searching an ordered list of n elements needs to examine at least log n/12-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem.…
- Cited by 14 (2 self) – Add To MetaCart
-
A New Protocol and Lower Bounds for Quantum Coin Flipping
- …We present a new protocol and two lower bounds for quantum coin ipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum protocols. For arbitrary quantum protocols, we show that if a …
- Cited by 18 (2 self) – Add To MetaCart
-
A new quantum lower bound method, with an application to strong direct product theorem for quantum search
- …We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it to prove a new and optimal strong direct product theorem for 2-sided error quantum algorithms computing …
- Cited by 6 (1 self) – Add To MetaCart
-
Probabilistic inductive inference: a survey
- …Inductive inference is a recursion-theoretic theory of learning, first developed by E. M. Gold (1967). This paper surveys developments in probabilistic inductive inference. We mainly focus on finite inference of recursive functions, since this simple paradigm has produced the most interesting (and m…
- Cited by 1 (0 self) – Add To MetaCart
-
Any AND-OR formula of size n can be evaluated in time N 1/2+o(1) on a quantum computer
- …For any AND-OR formula of size N, there exists a bounded-error N 1 2 +o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or “approximately balanced,” formulas can be evaluated in O ( √ N) queries, which is optimal. It foll…
- Cited by 2 (1 self) – Add To MetaCart
-
Quantum Lower Bounds by Quantum Arguments
- …this paper. The computation starts with a state j0i. Then, we apply U 0 , O, : : :, O, U T and measure the nal state. The result of the computation is the rightmost bit of the state obtained by the measurement. The quantum computation computes f with bounded error if, for every x = (x 1 ; : : : ; xN…
- Cited by 83 (5 self) – Add To MetaCart
-
Quantum walks and their algorithmic applications
- …Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications. 1…
- Cited by 17 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
