142 citations · 634 across the 35 of their papers we have counts for
41 papers
An exponential separation between entanglement-assisted and unassisted one-way quantum communication
Ryan Anselm, Srijita Kundu, Olivier Lalonde +1
A longstanding question in quantum communication complexity is whether some task can be accomplished with a small amount of communication in the presence of entanglement, yet requi…
Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements
Ashwin Nayak, Xingyu Zhou
We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most samples. For sufficiently small ,…
Quaternionic Perfect Sequences and Hadamard Matrices
Aidan Bennett, Curtis Bright, Paul Colinot +1
A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-…
Optimal lower bounds for Quantum Learning via Information Theory
Shima Bab Hadiashar, Ashwin Nayak, Pulkit Sinha
Although a concept class may be learnt more efficiently using quantum samples as compared with classical samples in certain scenarios, Arunachalam and de Wolf (JMLR, 2018) proved t…
Lower Bounds for Learning Quantum States with Single-Copy Measurements
Angus Lowe, Ashwin Nayak
We study the problems of quantum tomography and shadow tomography using measurements performed on individual, identical copies of an unknown -dimensional state. We first revisit…
Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding
Máté Farkas, Jędrzej Kaniewski, Ashwin Nayak
Mutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theo…