An optimal oracle separation of classical and quantum hybrid schemes

05/10/2022

∙

by   Atsuya Hasegawa, et al.

∙

0

∙

share

Recently, Chia, Chung and Lai (STOC 2020) and Coudron and Menda (STOC 2020) have shown that there exists an oracle 𝒪 such that 𝖡𝖰𝖯^𝒪≠ (𝖡𝖯𝖯^𝖡𝖰𝖭𝖢)^𝒪∪ (𝖡𝖰𝖭𝖢^𝖡𝖯𝖯)^𝒪. In fact, Chia et al. proved a stronger statement: for any depth parameter d, there exists an oracle that separates quantum depth d and 2d+1, when polynomial-time classical computation is allowed. This implies that relative to an oracle, doubling quantum depth gives classical and quantum hybrid schemes more computational power. In this paper, we show that for any depth parameter d, there exists an oracle that separates quantum depth d and d+1, when polynomial-time classical computation is allowed. This gives an optimal oracle separation of classical and quantum hybrid schemes. To prove our result, we consider d-Bijective Shuffling Simon's Problem (which is a variant of d-Shuffling Simon's Problem considered by Chia et al.) and an oracle inspired by an "in-place" permutation oracle.