Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Nayak, Ashwin - Institute for Quantum Computing & Faculty of Mathematics, University of Waterloo
The space complexity of recognizing well-parenthesized expressions in the streaming model
A Quantum Algorithm for the Ferromagnetic Ising (Manuscript in preparation)
Accessible versus Holevo Information for a Binary Random U. Waterloo
Inverting a permutation is as hard as unordered search Ashwin Nayak
Search via Quantum Walk Frederic Magniez
A Separation between Divergence and Holevo Information for Ensembles
Quantum Complexity of Testing Group Commutativity
Interaction in Quantum Communication Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma and David Zuckerman
Invertible Quantum Operations and Perfect Encryption of Quantum States
Limits on the ability of quantum states to convey classical Ashwin Nayak
arXiv:quant-ph/0512024v12Dec2005 Experimental implementation of heat-bath algorithmic cooling using solid-state
Information Processing Letters 89 (2004) 131135 www.elsevier.com/locate/ipl
Improved bounds for the randomized decision tree complexity of recursive Frederic Magniez
On the hitting times of quantum versus random walks Frederic Magniez
A Separation between Divergence and Holevo Information for Ensembles
Approximate Randomization of Quantum States With Fewer Bits of Key
Optimal lower bounds for quantum automata and random access codes Ashwin Nayak
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract)
Checking Matrix Identities (2006; Buhrman, Spalek) Ashwin Nayak, University of Waterloo and Perimeter Institute for Theoretical Physics,
Comment on ``Probabilistic Quantum Memories'' In a series of similar articles [13] Trugenberger
A short proof of the Quantum Substate Theorem National U. Singapore
Dense Quantum Coding and a Lower Bound for l-way Quantum Automata And& Ambainis * Ashwin Nayak + Amnon Ta-Shma T Umesh Vazimni 5
The quantum query complexity of approximating the median and related statistics *
Dense Quantum Coding and Quantum Finite Automata ANDRIS AMBAINIS
Interacting boson problems can be QMA-hard Tzu-Chieh Wei,1, 2
Bit-commitment-based quantum coin flipping Ashwin Nayak*
Recognizing Well-Parenthesized Expressions in the Streaming Model
Direct Product Theorems for Classical Communication Complexity via Subdistribution Bounds
Quantum Complexity of Testing Group Commutativity
Search via Quantum Walk Frederic Magniez