Ashwin Nayak
- Artificial Intelligence top 1%
- Quantum Computing Algorithms and Architecture 38
- Quantum Information and Cryptography 31
- Machine Learning and Algorithms 8
- Cryptography and Data Security 3
-
- Quantum-Dot Cellular Automata 11
- Complexity and Algorithms in Graphs 6
- Computability, Logic, AI Algorithms 6
-
- Quantum Mechanics and Applications 13
- Statistics and Probability top 10%
- Co-authors
- Andris AmbainisFrédéric MagniezAmnon Ta‐ShmaUmesh VaziraniJohn WatrousAshvin VishwanathEric BachMiklós Sántha
- Cited by
- Artificial IntelligenceComputational Theory and MathematicsAtomic and Molecular Physics, and Optics
- Journals
- IEEE Transactions on Information Theory (7 papers)Quantum Information and Computation (2 papers)SIAM Journal on Computing (2 papers)
- Partner nations
- CanadaUnited StatesFrance
In The Last Decade
Ashwin Nayak
47 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 46
- Artificial Intelligence 1.2k
- Computational Theory and Mathematics 592
- Atomic and Molecular Physics, and Optics 503
- Statistics and Probability 27
- Statistical and Nonlinear Physics 33
Countries citing papers authored by Ashwin Nayak
This map shows the geographic impact of Ashwin Nayak's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ashwin Nayak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ashwin Nayak more than expected).
Fields of papers citing papers by Ashwin Nayak
This network shows the impact of papers produced by Ashwin Nayak. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ashwin Nayak. The network helps show where Ashwin Nayak may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Ashwin Nayak, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 2 | |
| 2 | 2023 | 5 | |
| 3 | 2022 | 2 | |
| 4 | 2021 | 2 | |
| 5 | 2020 | 1 | |
| 6 | Quantum Analogs of Markov Chains | 2015 | 1 |
| 7 | 2014 | 5 | |
| 8 | 2011 | 0 | |
| 9 | The space complexity of recognizing well-parenthesized expressions | 2010 | 1 |
| 10 | 2010 | 34 | |
| 11 | 2010 | 2 | |
| 12 | 2009 | 12 | |
| 13 | On the hitting times of quantum versus random walks | 2008 | 42 |
| 14 | Direct Product Theorems for Communication Complexity via Subdistribution Bounds. | 2007 | 1 |
| 15 | 2006 | 17 | |
| 16 | 2004 | 14 | |
| 17 | 2003 | 97 | |
| 18 | 2001 | 303 | |
| 19 | 1999 | 11 | |
| 20 | 1998 | 5 |
About Ashwin Nayak
Ashwin Nayak is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Atomic and Molecular Physics, and Optics, Statistical and Nonlinear Physics and Statistics and Probability, having authored 48 papers that have together received 1.3k indexed citations. Recurring topics across this work include Quantum Computing Algorithms and Architecture (38 papers), Quantum Information and Cryptography (31 papers), Quantum Mechanics and Applications (13 papers), Quantum-Dot Cellular Automata (11 papers), Machine Learning and Algorithms (8 papers), Complexity and Algorithms in Graphs (6 papers), Computability, Logic, AI Algorithms (6 papers) and Cryptography and Data Security (3 papers). The work is most often cited by research in Artificial Intelligence (1.2k citations), Computational Theory and Mathematics (592 citations), Atomic and Molecular Physics, and Optics (503 citations), Statistics and Probability (27 citations) and Statistical and Nonlinear Physics (33 citations). Ashwin Nayak has collaborated with scholars based in Canada, United States and France. Frequent co-authors include Andris Ambainis, Frédéric Magniez, Amnon Ta‐Shma, Umesh Vazirani, John Watrous, Ashvin Vishwanath, Eric Bach, Miklós Sántha, Jérémie Roland and Hartmut Klauck. Their work appears in journals such as IEEE Transactions on Information Theory, Quantum Information and Computation, SIAM Journal on Computing, Journal of the ACM and Random Structures and Algorithms.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.