Sotabase
Home
Researchers
Career
·
CEO Co-founder
,
Auditrol
2024–
·
Former Postdoc
,
California Institute of Technology
Publications
(81)
One-dimensional quantum walks
Symposium on the Theory of Computing · 2001
615
cited
Search via quantum walk
Symposium on the Theory of Computing · 2006
453
cited
Optimal lower bounds for quantum automata and random access codes
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · 1999
315
cited
Dense quantum coding and quantum finite automata
JACM · 2002
248
cited
The quantum query complexity of approximating the median and related statistics
Symposium on the Theory of Computing · 1998
187
cited
Quantum Walk on the Line
2000
166
cited
Dense quantum coding and a lower bound for 1-way quantum automata
Symposium on the Theory of Computing · 1998
164
cited
Online learning of quantum states
Neural Information Processing Systems · 2018
99
cited
Quantum Complexity of Testing Group Commutativity
Algorithmica · 2005
99
cited
On the Hitting Times of Quantum Versus Random Walks
Algorithmica · 2008
97
cited
MedAlign: A Clinician-Generated Dataset for Instruction Following with Electronic Medical Records
AAAI Conference on Artificial Intelligence · 2023
81
cited
Interaction in quantum communication and the complexity of set disjointness
Symposium on the Theory of Computing · 2001
74
cited
Bit-commitment-based quantum coin flipping
2002
61
cited
Recognizing well-parenthesized expressions in the streaming model
Symposium on the Theory of Computing · 2009
58
cited
Invertible quantum operations and perfect encryption of quantum states
Quantum information & computation · 2006
57
cited
Interacting boson problems can be QMA hard.
Physical Review Letters · 2009
50
cited
MedHELM: Holistic Evaluation of Large Language Models for Medical Tasks
arXiv.org · 2025
47
cited
Interaction in Quantum Communication
IEEE Transactions on Information Theory · 2006
44
cited
Limits on the ability of quantum states to convey classical messages
JACM · 2006
36
cited
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract
Symposium on the Theory of Computing · 2008
35
cited
Show all 81 papers →
Sotabase
Ashwin Nayak | Researcher Profile | Sotabase | Sotabase