Ashwin Nayak - RankMe

84 papers A* 16A 2B 1C 1Journal 60Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Quaternionic Perfect Sequences and Hadamard Matrices. CoRR Aidan Bennett, Curtis Bright, Paul Colinot, Ashwin Nayak
2025	J	`jnl`	Lower Bounds for Learning Quantum States with Single-Copy Measurements. ACM Trans. Comput. Theory Ashwin Nayak, Angus Lowe
2024	J	`jnl`	Optimal Lower Bounds for Quantum Learning via Information Theory. IEEE Trans. Inf. Theory Shima Bab Hadiashar, Ashwin Nayak, Pulkit Sinha
2024	J	`jnl`	Proper vs Improper Quantum PAC learning. CoRR Ashwin Nayak, Pulkit Sinha
2023	J	`jnl`	Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding. IEEE Trans. Inf. Theory Máté Farkas, Jedrzej Kaniewski, Ashwin Nayak
2023	J	`jnl`	One-Shot Quantum State Redistribution and Quantum Markov Chains. IEEE Trans. Inf. Theory Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette
2023	J	`jnl`	Optimal lower bounds for Quantum Learning via Information Theory. CoRR Shima Bab Hadiashar, Ashwin Nayak, Pulkit Sinha
2023	J	`jnl`	Rigidity of Superdense Coding. ACM Trans. Quantum Comput. Ashwin Nayak, Henry Yuen
2022	J	`jnl`	Deterministic algorithms for the hidden subgroup problem. Quantum Inf. Comput. Ashwin Nayak
2022	J	`jnl`	Lower bounds for learning quantum states with single-copy measurements. CoRR Angus Lowe, Ashwin Nayak
2022	J	`jnl`	Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding. CoRR Máté Farkas, Jedrzej Kaniewski, Ashwin Nayak
2022	J	`jnl`	Quantum Distributed Complexity of Set Disjointness on a Line. ACM Trans. Comput. Theory Frédéric Magniez, Ashwin Nayak
2021	J	`jnl`	Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets. IEEE Trans. Inf. Theory Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
2021	J	`jnl`	Deterministic Algorithms for the Hidden Subgroup Problem. CoRR Ashwin Nayak
2021	B	`conf`	One-Shot Quantum State Redistribution and Quantum Markov Chains. ISIT Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette
2021	J	`jnl`	One-shot quantum state redistribution and quantum Markov chains. CoRR Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette
2020	J	`jnl`	Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets. CoRR Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
2020	J	`jnl`	On the Entanglement Cost of One-Shot Compression. Quantum Shima Bab Hadiashar, Ashwin Nayak
2020	A*	`conf`	Quantum Distributed Complexity of Set Disjointness on a Line. ICALP Frédéric Magniez, Ashwin Nayak
2020	J	`jnl`	Quantum Distributed Complexity of Set Disjointness on a Line. CoRR Frédéric Magniez, Ashwin Nayak
2019	J	`jnl`	Noisy Interactive Quantum Communication. SIAM J. Comput. Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger
2019	J	`jnl`	On the Entanglement Cost of One-Shot Compression. CoRR Shima Bab Hadiashar, Ashwin Nayak
2018	A*	`conf`	Capacity approaching coding for low noise interactive quantum communication. STOC Debbie W. Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu
2018	J	`jnl`	Communication Complexity of One-Shot Remote State Preparation. CoRR Shima Bab Hadiashar, Ashwin Nayak, Renato Renner
2018	J	`jnl`	Communication Complexity of One-Shot Remote State Preparation. IEEE Trans. Inf. Theory Shima Bab Hadiashar, Ashwin Nayak, Renato Renner
2018	A*	`conf`	Online Learning of Quantum States. NeurIPS Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, Ashwin Nayak
2018	J	`jnl`	Online Learning of Quantum States. CoRR Scott Aaronson, Xinyi Chen, Elad Hazan, Ashwin Nayak
2017	A	`conf`	Augmented Index and Quantum Streaming Algorithms for DYCK(2). CCC Ashwin Nayak, Dave Touchette
2016	J	`jnl`	A search for quantum coin-flipping protocols using optimization techniques. Math. Program. Ashwin Nayak, Jamie Sikora, Levent Tunçel
2016	J	`jnl`	Augmented Index and Quantum Streaming Algorithms for DYCK(2). CoRR Ashwin Nayak, Dave Touchette
2016	J	`jnl`	Improved bounds for the randomized decision tree Complexity of recursive majority. Random Struct. Algorithms Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
2016	—	`ch.`	Quantum Algorithms for Matrix Multiplication and Product Verification. Encyclopedia of Algorithms Robin Kothari, Ashwin Nayak
2016	—	`ch.`	Quantum Analogues of Markov Chains. Encyclopedia of Algorithms Ashwin Nayak, Peter C. Richter, Mario Szegedy
2015	J	`jnl`	Quantum and classical coin-flipping protocols based on bit-commitment and their point games. CoRR Ashwin Nayak, Jamie Sikora, Levent Tunçel
2014	J	`jnl`	A search for quantum coin-flipping protocols using optimization techniques. CoRR Ashwin Nayak, Jamie Sikora, Levent Tunçel
2014	A*	`conf`	Noisy Interactive Quantum Communication. FOCS Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger
2014	J	`jnl`	Recognizing Well-Parenthesized Expressions in the Streaming Model. SIAM J. Comput. Frédéric Magniez, Claire Mathieu, Ashwin Nayak
2014	J	`jnl`	The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited. IEEE Trans. Inf. Theory Rahul Jain, Ashwin Nayak
2013	J	`jnl`	Improved bounds for the randomized decision tree complexity of recursive majority. CoRR Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao
2012	J	`jnl`	On the Hitting Times of Quantum Versus Random Walks. Algorithmica Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha
2012	J	`jnl`	Short Proofs of the Quantum Substate Theorem. IEEE Trans. Inf. Theory Rahul Jain, Ashwin Nayak
2011	J	`jnl`	A short proof of the Quantum Substate Theorem CoRR Rahul Jain, Ashwin Nayak
2011	—	`conf`	Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
2011	J	`jnl`	Inverting a Permutation is as Hard as Unordered Search. Theory Comput. Ashwin Nayak
2011	J	`jnl`	Search via Quantum Walk. SIAM J. Comput. Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
2010	J	`jnl`	A separation between divergence and Holevo information for ensembles. Math. Struct. Comput. Sci. Rahul Jain, Ashwin Nayak, Yi Su
2010	J	`jnl`	Improved bounds for the randomized decision tree complexity of recursive majority. Electron. Colloquium Comput. Complex. Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao
2010	J	`jnl`	Inverting a permutation is as hard as unordered search CoRR Ashwin Nayak
2010	J	`jnl`	Inverting a permutation is as hard as unordered search. Electron. Colloquium Comput. Complex. Ashwin Nayak
2010	A*	`conf`	Recognizing well-parenthesized expressions in the streaming model. STOC Frédéric Magniez, Claire Mathieu, Ashwin Nayak
2010	J	`jnl`	The space complexity of recognizing well-parenthesized expressions CoRR Rahul Jain, Ashwin Nayak
2010	J	`jnl`	The space complexity of recognizing well-parenthesized expressions. Electron. Colloquium Comput. Complex. Rahul Jain, Ashwin Nayak
2009	J	`jnl`	Foreword from the Guest Editors. Algorithmica Frédéric Magniez, Ashwin Nayak
2009	A*	`conf`	On the hitting times of quantum versus random walks. SODA Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha
2009	J	`jnl`	Recognizing well-parenthesized expressions in the streaming model CoRR Frédéric Magniez, Claire Mathieu, Ashwin Nayak
2009	J	`jnl`	Recognizing well-parenthesized expressions in the streaming model. Electron. Colloquium Comput. Complex. Frédéric Magniez, Claire Mathieu, Ashwin Nayak
2009	J	`jnl`	Special Section on Foundations of Computer Science. SIAM J. Comput. Matthew Andrew, Ashwin Nayak, Rajmohan Rajaraman
2008	C	`conf`	A Separation between Divergence and Holevo Information for Ensembles. TAMC Rahul Jain, Ashwin Nayak, Yi Su
2008	A*	`conf`	Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC Rahul Jain, Hartmut Klauck, Ashwin Nayak
2008	J	`jnl`	On the hitting times of quantum versus random walks. CoRR Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha
2008	—	`ch.`	Quantum Algorithm for Checking Matrix Identities. Encyclopedia of Algorithms Ashwin Nayak
2007	J	`jnl`	Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electron. Colloquium Comput. Complex. Rahul Jain, Hartmut Klauck, Ashwin Nayak
2007	J	`jnl`	Interaction in Quantum Communication. IEEE Trans. Inf. Theory Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
2007	J	`jnl`	Invertible quantum operations and perfect encryption of quantum states. Quantum Inf. Comput. Ashwin Nayak, Pranab Sen
2007	J	`jnl`	Quantum Complexity of Testing Group Commutativity. Algorithmica Frédéric Magniez, Ashwin Nayak
2007	A*	`conf`	Search via quantum walk. STOC Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
2006	J	`jnl`	Limits on the ability of quantum states to convey classical messages. J. ACM Ashwin Nayak, Julia Salzman
2006	J	`jnl`	Search via Quantum Walk. CoRR Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha
2005	A*	`conf`	Quantum Complexity of Testing Group Commutativity. ICALP Frédéric Magniez, Ashwin Nayak
2004	J	`jnl`	Weak coin flipping with small bias. Inf. Process. Lett. Iordanis Kerenidis, Ashwin Nayak
2002	J	`jnl`	Dense quantum coding and quantum finite automata. J. ACM Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
2002	A	`conf`	On Communication over an Entanglement-Assisted Quantum Channel. CCC Ashwin Nayak, Julia Salzman
2002	A*	`conf`	On communication over an entanglement-assisted quantum channel. STOC Ashwin Nayak, Julia Salzman
2001	A*	`conf`	Interaction in quantum communication and the complexity of set disjointness. STOC Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
2001	A*	`conf`	One-dimensional quantum walks. STOC Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous
2000	J	`jnl`	Interaction in Quantum Communication Complexity CoRR Ashwin Nayak, Amnon Ta-Shma, David Zuckerman
1999	A*	`conf`	Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. STOC Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
1999	A*	`conf`	Optimal Lower Bounds for Quantum Automata and Random Access Codes. FOCS Ashwin Nayak
1999	J	`jnl`	Optimal lower bounds for quantum automata and random access codes CoRR Ashwin Nayak
1999	J	`jnl`	Spatial Codes and the Hardness of String Folding Problems. J. Comput. Biol. Ashwin Nayak, Alistair Sinclair, Uri Zwick
1999	A*	`conf`	The Quantum Query Complexity of Approximating the Median and Related Statistics. STOC Ashwin Nayak, Felix Wu
1998	J	`jnl`	Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata CoRR Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani
1998	A*	`conf`	Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). SODA Ashwin Nayak, Alistair Sinclair, Uri Zwick
1998	J	`jnl`	The quantum query complexity of approximating the median and related statistics CoRR Ashwin Nayak, Felix Wu