MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Ashwin Nayak" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

16 documents found, showing 1 through 10. Next 10 →

ATOM

Optimal Lower Bounds for Quantum Automata and Random Access Codes
by Ashwin Nayak — 1999 — In Proceedings of 40th IEEE FOCS
…Optimal lower bounds for quantum automata and random access codes Ashwin Nayak y Computer…
Cited by 46 (6 self) – Add To MetaCart

On Communication Over an Entanglement-Assisted Quantum Channel
by Ashwin Nayak, Julia Salzman — 2002 — In Proceedings of the thirty-fourth annual ACM symposium on Theory of computing
…On communication over an entanglement-assisted quantum channel Ashwin Nayak # Computer Science…
Cited by 8 (2 self) – Add To MetaCart

Accessible versus Holevo information for a binary random variable
by Rahul Jain, U. Waterloo, Ashwin Nayak — 2006
…Accessible versus Holevo Information for a Binary Random Variable Rahul Jain U. Waterloo ∗ Ashwin…
Cited by 1 (1 self) – Add To MetaCart

Quantum complexity of testing group commutativity
by Frédéric Magniez, Ashwin Nayak — 2005 — Proceedings of ICALP’05
…Quantum Complexity of Testing Group Commutativity ⋆ Frédéric Magniez 1 and Ashwin Nayak 2 1 CNRS…
Cited by 17 (4 self) – Add To MetaCart

The quantum query complexity of approximating the median and related statistics
by Ashwin Nayak, Felix Wu — 1999 — STOC'99
…Abstract The quantum query complexity of approximating the median and related statistics * Ashwin…
Cited by 31 (0 self) – Add To MetaCart

The
by Ashwin Nayak Felix Wu — 1998
… and related statistics ∗ Ashwin Nayak † Felix Wu ‡ Abstract Let X = (x0,...,xn−1) be a sequence of n numbers…
Add To MetaCart

Dense quantum coding and a lower bound for 1-way quantum automata
by Andris Ambainis, Ashwin Nayak, Amnon Ta-shma, Umesh Vazirani — 1999 — Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing
… Automata Andris Ambainis ∗ Ashwin Nayak † Amnon Ta-Shma ‡ Umesh Vazirani § Abstract We consider…
Cited by 15 (3 self) – Add To MetaCart

Spatial Codes and the Hardness of String Folding Problems
by Ashwin Nayak, Alistair Sinclair, Uri Zwick — 1998 — Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
…Spatial Codes and the Hardness of String Folding Problems Ashwin Nayak y Alistair Sinclair z…
Cited by 7 (2 self) – Add To MetaCart

Search via quantum walk
by Frédéric Magniez, Ashwin Nayak, Jérémie Rol, Miklos Santha — 2007 — Logic Programming, Proc. of the 1994 Int. Symp
…Search via Quantum Walk ∗ Frédéric Magniez † Ashwin Nayak ‡ Jérémie Roland § Miklos Santha…
Cited by 8 (3 self) – Add To MetaCart

Interaction in Quantum Communication and the Complexity of Set Disjointness
by Hartmut Klauck, Ashwin Nayak, Amnon Ta-shma, David Zuckerman — 2001
…, Ashwin Nayak, Amnon Ta-Shma and David Zuckerman Hartmut is with CWI, P.O. Box 94079, 1090 GB Amsterdam…
Cited by 22 (6 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB