Nearly optimal quantum circuits for Boolean oracles

Abstract

Quantum oracle of Boolean functions is one of the central bridges between classical and quantum algorithms, but the study focusing at quantum circuit optimization of such oracle is yet closed. In this paper, we propose nearly optimal tradeoffs among circuit size, circuit depth and ancilla count, for quantum oracles of three kinds of Boolean functions: general total Boolean functions with output size $b$: with $1\le m\le \hat{I}˜\left(\frac{2^n}{n}\right)$ ancilla, size $\mathcal{O}\left(\frac{b{2}^n}{\log (n+m)}\right)$, depth $\mathcal{O}\left(\frac{b{2}^n}{n+m}\right)$; partial Boolean functions of effective support size $d$ and output size $b$: with $\hat{I}˜\left(\log d\right)\le m\le \hat{I}˜\left(d\right)$ ancilla, size $\mathcal{O}\left(n\log d+bd\right)$, depth $\mathcal{O}\left(\frac{n\log n\log d}{n+m}+\log n+\frac{d(\log d+b\log m)}{m}\right)$; sparse Boolean functions of true input size $d$: with $\hat{I}˜\left(\log n+\log d\right)\le m\le \hat{I}˜\left(\frac{nd}{\log d}\right)$ ancilla, size $\mathcal{O}\left(n^2\log d+\frac{nd}{\log (\log d+m/n)}\right)$, depth $\mathcal{O}\left(\frac{n^2\log n\log d}{n+m}+\log n+\frac{nd}{m}\right)$. All the size and depth bounds are asymptotically optimal up to logarithmic factors in the corresponding ancilla count regions. We hope these results find applications in scenarios where classical procedures are needed to be embedded into quantum circuits, such as QROM implementation and quantum algorithm design.

Topics & keywords