E-LIB Suche - Ergebnisse für: Nayak, Ashwin

1

Optimal Lower Bounds for Quantum Learning via Information T..:

Hadiashar, Shima Bab ; Nayak, Ashwin ; Sinha, Pulkit
IEEE Transactions on Information Theory. 70 (2024) 3 - p. 1876-1896 , 2024

Link: https://doi.org/10.1109/..

2

Comparing IM Residency Application Personal Statements Gene..:

Nair, Vishnu ; Nayak, Ashwin ; Ahuja, Neera...
Journal of General Internal Medicine. , 2024

Link: https://doi.org/10.1007/..

3

Diagnostic reasoning prompts reveal the potential for large..:

Savage, Thomas ; Nayak, Ashwin ; Gallo, Robert..
npj Digital Medicine. 7 (2024) 1 - p. , 2024

Link: https://doi.org/10.1038/..

4

Mutually Unbiased Measurements, Hadamard Matrices, and Supe..:

Farkas, Máté ; Kaniewski, Jędrzej ; Nayak, Ashwin
IEEE Transactions on Information Theory. 69 (2023) 6 - p. 3814-3824 , 2023

Link: https://doi.org/10.1109/..

5

One-Shot Quantum State Redistribution and Quantum Markov Ch..:

Anshu, Anurag ; Bab Hadiashar, Shima ; Jain, Rahul..
IEEE Transactions on Information Theory. 69 (2023) 9 - p. 5788-5804 , 2023

Link: https://doi.org/10.1109/..

6

Quantum Distributed Complexity of Set Disjointness on a Lin:

Magniez, Frédéric ; Nayak, Ashwin
ACM Transactions on Computation Theory. 14 (2022) 1 - p. 1-22 , 2022

Link: https://doi.org/10.1145/..

7

Quantum Distributed Complexity of Set Disjointness on a Lin:

Magniez, Frédéric ; Nayak, Ashwin
ACM Transactions on Computation Theory (TOCT). 14 (2022) 1 - p. 1-22 , 2022

Link: https://dl.acm.org/doi/1..

8

On the Entanglement Cost of One-Shot Compression:

Bab Hadiashar, Shima ; Nayak, Ashwin
Quantum. 4 (2020) - p. 286 , 2020

Link: https://doi.org/10.22331..

9

Online learning of quantum states:

Aaronson, Scott ; Chen, Xinyi ; Hazan, Elad..
Journal of Statistical Mechanics: Theory and Experiment. 2019 (2019) 12 - p. 124019 , 2019

Link: https://doi.org/10.1088/..

10

Noisy Interactive Quantum Communication:

Brassard, Gilles ; Nayak, Ashwin ; Tapp, Alain..
SIAM Journal on Computing. 48 (2019) 4 - p. 1147-1195 , 2019

Link: https://doi.org/10.1137/..

11

Capacity approaching coding for low noise interactive quant..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,

Leung, Debbie ; Nayak, Ashwin ; Shayeghi, Ala... - p. 339-352 , 2018

Link: https://dl.acm.org/doi/1..

12

Augmented index and quantum streaming algorithms for DYCK(2:

, In: Proceedings of the 32nd Computational Complexity Conference,

Nayak, Ashwin ; Touchette, Dave - p. 1-21 , 2017

Link: https://dl.acm.org/doi/1..

13

A search for quantum coin-flipping protocols using optimiza..:

Nayak, Ashwin ; Sikora, Jamie ; Tunçel, Levent
Mathematical Programming. 156 (2015) 1-2 - p. 581-613 , 2015

Link: https://doi.org/10.1007/..

14

Improved bounds for the randomized decision tree Complexity..:

Magniez, Frédéric ; Nayak, Ashwin ; Santha, Miklos...
Random Structures & Algorithms. 48 (2015) 3 - p. 612-638 , 2015

Link: https://doi.org/10.1002/..

15

Recognizing Well-Parenthesized Expressions in the Streaming..:

Magniez, Frédéric ; Mathieu, Claire ; Nayak, Ashwin
SIAM Journal on Computing. 43 (2014) 6 - p. 1880-1905 , 2014

Link: https://doi.org/10.1137/..