Searching for authors named "Ashwin Nayak" – sorted by Relevance.
-
Optimal Lower Bounds for Quantum Automata and Random Access Codes
- 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
- 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
- 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
- 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
- Abstract The quantum query complexity of approximating the median and related statistics * Ashwin
- Cited by 31 (0 self) – Add To MetaCart
-
The
- 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
- 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
- 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
- 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
- , 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

