#### Filter Results:

#### Publication Year

1994

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modiies the input, we use a quantum adversary that runs the algorithm with a superposition of inputs. If the algorithm works correctly, its state becomes entangled with the superposition over inputs.… (More)

We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (greater than 7/9), then any 1-way QFA can be simulated by a 1-way reversible automaton. However, quantum automata giving the correct answer with smaller… (More)

- Andris Ambainis, John Watrous UC Berkeley, University of Calgary
- 1999

We introduce 2-way finite automata with quantum and classical states (2qcfa's). This is a variant on the 2-way quantum finite automata (2qfa) model which may be simpler to implement than unrestricted 2qfa's; the internal state of a 2qcfa may include a quantum part that may be in a (mixed) quantum state, but the tape head position is required to be… (More)

We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a quantum analog of the symmetric random walk, which we call the <italic>Hadamard walk</italic>. Several striking differences between the quantum and classical cases are observed. For example, when unrestricted in either direction, the… (More)

We construct a scheme for private information retrieval with k databases and communication complexity O(n 1=(2k?1)).

We set the ground for a theory of quantum walks on graphs-the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obtain a measure of how fast the quantum walk spreads or how confined… (More)

We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N 2/3) query quantum algorithm. This improves the previous O(N 3/4) query quantum algorithm of Buhrman et.al. (quant-ph/0007016) and matches the lower… (More)

We show how to search <i>N</i> items arranged on a √<i>N</i> × √<i>N</i> grid in time <i>O</i>(√<i>N</i> log <i>N</i>), using a discrete time quantum walk. This result for the first time exhibits a significant difference between discrete time and continuous time walks without coin degrees of freedom. since it has been shown recently… (More)

A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N input… (More)

We consider the possibility of encoding <i>m</i> classical bits into many fewer <i>n</i> quantum bits (qubits) so that an arbitrary bit from the original <i>m</i> bits can be recovered with good probability. We show that nontrivial quantum codes exist that have no classical counterparts. On the other hand, we show that quantum encoding cannot save more than… (More)