2 citations · 2 across the 7 of their papers we have counts for
4 papers · 1 filter
Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding
Amin Shiraz Gilani, Daochen Wang, Pei Wu +1
The edge list model is arguably the simplest input model for graphs, where the graph is specified by a list of its edges. In this model, we study the quantum query complexity of th…
Coherence in Property Testing: Quantum-Classical Collapses and Separations
Fernando Granha Jeronimo, Nir Magrafta, Joseph Slote +1
Understanding the power and limitations of classical and quantum information and how they differ is a fundamental endeavor. In property testing of distributions, a tester is given…
Quantum Merlin-Arthur with an internally separable proof
Roozbeh Bassirian, Bill Fefferman, Itai Leigh +2
We find a modification to QMA where having one quantum proof is strictly less powerful than having two unentangled proofs, assuming EXP NEXP. This gives a new route to prove…
Dimension Independent Disentanglers from Unentanglement and Applications
Fernando G. Jeronimo, Pei Wu
Quantum entanglement is a key enabling ingredient in diverse applications. However, the presence of unwanted adversarial entanglement also poses challenges in many applications. In…