Ashwin Nayak

Available identifiers

zbMath Open nayak.ashwinMaRDI QIDQ263218

List of research outcomes

Publication	Date of Publication	Type
Optimal lower bounds for quantum learning via information theory	2024-07-22	Paper
One-shot quantum state redistribution and quantum Markov chains	2024-07-19	Paper
Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding	2024-03-21	Paper
Quantum Distributed Complexity of Set Disjointness on a Line	2022-09-24	Paper
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets	2021-09-07	Paper
Online learning of quantum states	2021-03-16	Paper
Recognizing Well-Parenthesized Expressions in the Streaming Model	2020-05-31	Paper
Augmented Index and Quantum Streaming Algorithms for DYCK(2)	2020-05-26	Paper
Noisy Interactive Quantum Communication	2019-09-02	Paper
Capacity approaching coding for low noise interactive quantum communication	2019-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4633814	2019-05-06	Paper
Communication Complexity of One-Shot Remote State Preparation	2018-09-19	Paper
Short Proofs of the Quantum Substate Theorem	2017-07-12	Paper
The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited	2017-05-16	Paper
The quantum query complexity of approximating the median and related statistics	2016-09-29	Paper
Dense quantum coding and a lower bound for 1-way quantum automata	2016-09-29	Paper
Improved bounds for the randomized decision tree complexity of recursive majority	2016-06-10	Paper
A search for quantum coin-flipping protocols using optimization techniques	2016-04-04	Paper
Dense quantum coding and quantum finite automata	2015-12-07	Paper
One-dimensional quantum walks	2015-02-27	Paper
Interaction in quantum communication and the complexity of set disjointness	2015-02-27	Paper
Recognizing well-parenthesized expressions in the streaming model	2014-08-13	Paper
On the hitting times of quantum versus random walks	2012-04-26	Paper
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority	2011-07-06	Paper
Inverting a permutation is as hard as unordered search	2011-05-24	Paper
Search via Quantum Walk	2011-05-17	Paper
A separation between divergence and Holevo information for ensembles	2010-12-01	Paper
On communication over an entanglement-assisted quantum channel	2010-08-05	Paper
Weak coin flipping with small bias	2009-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q3549657	2009-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q5302084	2009-01-05	Paper
Limits on the ability of quantum states to convey classical messages	2008-12-21	Paper
Interaction in Quantum Communication	2008-12-21	Paper
A Separation between Divergence and Holevo Information for Ensembles	2008-05-27	Paper
Approximate Randomization of Quantum States With Fewer Bits of Key	2008-01-02	Paper
Quantum complexity of testing group commutativity	2007-08-20	Paper
Automata, Languages and Programming	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4250233	1999-08-16	Paper

Research outcomes over time

This page was built for person: Ashwin Nayak