DeepAI AI Chat
Log In Sign Up

Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)

by   Matthew Coudron, et al.

A conjecture of Jozsa states that any polynomial-time quantum computation can be simulated by polynomial-depth classical computation interleaved with logarithmic-depth quantum computation. This conjecture is a remarkable statement about the unresolved potential of combining classical and quantum computation. As a counterpoint we show that the Welded Tree Problem, which is an oracle problem that can be solved in quantum polynomial time as shown by Childs et al., cannot be solved in the class which Jozsa describes. Therefore, even when interleaved with arbitrary polynomial-time classical computation, greater "Quantum Depth" leads to strictly greater computational ability in this relativized setting.


page 1

page 2

page 3

page 4


An optimal oracle separation of classical and quantum hybrid schemes

Recently, Chia, Chung and Lai (STOC 2020) and Coudron and Menda (STOC 20...

On the Need for Large Quantum Depth

Near-term quantum computers are likely to have small depths due to short...

Oracle separations of hybrid quantum-classical circuits

An important theoretical problem in the study of quantum computation, th...

Cryptanalysis of Three Quantum Money Schemes

We investigate the security assumptions behind three public-key quantum ...

Quantum generalizations of the polynomial hierarchy with applications to QMA(2)

The polynomial-time hierarchy (PH) has proven to be a powerful tool for ...


We show that the class MIP* of languages that can be decided by a classi...

Type-two polynomial-time and restricted lookahead

This paper provides an alternate characterization of type-two polynomial...