The following pages link to Ashwin Nayak (Q263218):
Displayed 37 items.
- A search for quantum coin-flipping protocols using optimization techniques (Q263220) (← links)
- Item:Q263218 (redirect page) (← links)
- Weak coin flipping with small bias (Q1029065) (← links)
- On the hitting times of quantum versus random walks (Q2429358) (← links)
- Quantum complexity of testing group commutativity (Q2642314) (← links)
- Improved bounds for the randomized decision tree Complexity of recursive majority (Q2811168) (← links)
- Dense quantum coding and a lower bound for 1-way quantum automata (Q2819570) (← links)
- The quantum query complexity of approximating the median and related statistics (Q2819571) (← links)
- Recognizing well-parenthesized expressions in the streaming model (Q2875152) (← links)
- The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited (Q2986125) (← links)
- Search via Quantum Walk (Q2999859) (← links)
- Inverting a permutation is as hard as unordered search (Q3002827) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- A separation between divergence and Holevo information for ensembles (Q3060198) (← links)
- Dense quantum coding and quantum finite automata (Q3455539) (← links)
- A Separation between Divergence and Holevo Information for Ensembles (Q3502676) (← links)
- Limits on the ability of quantum states to convey classical messages (Q3546307) (← links)
- Interaction in Quantum Communication (Q3548810) (← links)
- (Q3549657) (← links)
- On communication over an entanglement-assisted quantum channel (Q3579193) (← links)
- (Q4250233) (← links)
- (Q4633814) (← links)
- Communication Complexity of One-Shot Remote State Preparation (Q4682799) (← links)
- Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets (Q4958242) (← links)
- Augmented Index and Quantum Streaming Algorithms for DYCK(2) (Q5111153) (← links)
- Recognizing Well-Parenthesized Expressions in the Streaming Model (Q5112586) (← links)
- One-dimensional quantum walks (Q5175951) (← links)
- Interaction in quantum communication and the complexity of set disjointness (Q5175960) (← links)
- Capacity approaching coding for low noise interactive quantum communication (Q5230301) (← links)
- Noisy Interactive Quantum Communication (Q5232323) (← links)
- Short Proofs of the Quantum Substate Theorem (Q5271899) (← links)
- (Q5302084) (← links)
- Approximate Randomization of Quantum States With Fewer Bits of Key (Q5432053) (← links)
- Automata, Languages and Programming (Q5716755) (← links)
- Online learning of quantum states (Q5854122) (← links)
- Quantum Distributed Complexity of Set Disjointness on a Line (Q5868887) (← links)
- Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding (Q6199202) (← links)