#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1995

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (37)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ashwin Nayak
- FOCS
- 1999

Consider the finite regular language Ln = {w0 | w ∈ {0, 1}, |w| ≤ n}. In [3] it was shown that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum finite automaton (QFA) for it has size 2 . This was based on the fact that the evolution of a QFA is required to be reversible. When arbitrary intermediate… (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)

- Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
- J. ACM
- 2002

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)

- Ashwin Nayak, Felix Wu
- STOC
- 1999

Let X = (x0, . . . , xn−1) be a sequence of n numbers. For ǫ > 0, we say that xi is an ǫapproximate median if the number of elements strictly less than xi, and the number of elements strictly greater than xi are each less than (1+ǫ)n/2. We consider the quantum query complexity of computing an ǫ-approximate median, given the sequence X as an oracle. We prove… (More)

- Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
- SIAM J. Comput.
- 2007

We propose a new method for designing quantum search algorithms forfinding a "marked" element in the state space of a classical Markovchain. The algorithm is based on a quantum walk à la Szegedy [25] that is defined in terms of the Markov chain. The main new idea is to apply quantum phase estimation to the quantumwalk in order to implement an… (More)

We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that nontrivial quantum encodings exist that have no classical counterparts. On the other hand, we show that quantum encodings cannot be much more succint as compared… (More)

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider quantum walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the “Hadamard walk”. In particular, we show that after t time steps, the probability distribution on… (More)

- Frédéric Magniez, Ashwin Nayak
- Algorithmica
- 2005

We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pak, who gave a randomized algorithm involving O(k) group operations. We construct a quite optimal quantum algorithm for this problem whose complexity is in $\tilde{O}(k^{2/3})$ . The… (More)

- Frédéric Magniez, Claire Mathieu, Ashwin Nayak
- Electronic Colloquium on Computational Complexity
- 2009

Motivated by a concrete problem and with the goal of understanding the relationship between the complexity of streaming algorithms and the computational complexity of formal languages, we investigate the problem Dyck(s) of checking matching parentheses, with s different types of parenthesis.
We present a one-pass randomized streaming algorithm for Dyck(2)… (More)

- Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha
- Algorithmica
- 2009

The hitting time of a classical random walk (Markov chain) is the time required to detect the presence of—or equivalently, to find—a marked state. The hitting time of a quantum walk is subtler to define; in particular, it is unknown whether the detection and finding problems have the same time complexity. In this paper we define new Monte Carlo type… (More)