6 citations · 6 across the 1 of their papers we have counts for
2 papers
quant-ph2019
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…
cs.CC2018★ 6 cited
Oracle Separations for Quantum Statistical Zero-Knowledge
Sanketh Menda, John Watrous
This paper investigates the power of quantum statistical zero knowledge interactive proof systems in the relativized setting. We prove the existence of an oracle relative to which…