Computations with greater Quantum depth are strictly more powerful (relative to an oracle)

DOI10.1145/3357713.3384269OpenAlexW2973746486WikidataQ130915459 ScholiaQ130915459MaRDI QIDQ5144975

Sanketh Menda, Matthew Coudron

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.10503

zbMATH Keywords

quantum walkhybrid quantum computationJozsa's conjecturewelded tree problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Quantum depth in the random oracle model

This page was built for publication: Computations with greater Quantum depth are strictly more powerful (relative to an oracle)