25 citations · 92 across the 16 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
quant-ph2019★ 25 cited
Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)
Matthew Coudron, Sanketh Menda
A conjecture of Jozsa (arXiv:quant-ph/0508124) states that any polynomial-time quantum computation can be simulated by polylogarithmic-depth quantum computation interleaved with po…
quant-ph2019★ 3 cited
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
Matthew Coudron, William Slofstra
We study the problem of approximating the commuting-operator value of a two-player non-local game. It is well-known that it is -complete to decide whether the classica…
quant-ph2019
Universality of EPR pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion
Matthew Coudron, Aram W. Harrow
Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EP…