Quantum signal processing

Quantum Signal Processing is a Hamiltonian simulation algorithm with optimal lower bounds in query complexity. It linearizes the operator of a quantum walk using eigenvalue transformation. The quantum walk takes a constant number of queries. So quantum signal processing's cost depends on the constant number of calls to the quantum walk operator, number of single qubit quantum gates that aid in the eigenvalue transformation and an ancilla qubit.

Eigenvalue transformation

Given a unitary $W|u_{i}\rangle =e^{i\theta _{i}}|u_{i}\rangle$, calculate $A=f(W)=\sum _{i}e^{if(\theta _{i})}\left|u_{i}\right\rangle \langle u_{i}|$. For example, if $W={\begin{bmatrix}e^{i\theta _{1}}&0&0\\0&e^{i\theta _{2}}&0\\0&0&e^{i\theta _{3}}\end{bmatrix}}$, $A={\begin{bmatrix}e^{if(\theta _{1})}&0&0\\0&e^{if(\theta _{2})}&0\\0&0&e^{if(\theta _{3})}\end{bmatrix}}$.

Algorithm

Input: Given a Hamiltonian $H$, define a quantum walk operator $W$ using 2 d-sparse oracles $O_{H}$ and $O_{F}$. $O_{H}$ accepts inputs $j$ and $k$ ($j$ is the row of the Hamiltonian and $k$ is the column) and outputs $\langle j|H\left|k\right\rangle$, so querying $O_{H}|j\rangle |k\rangle |l\rangle =|j\rangle |k\rangle |l\oplus H_{j,k}\rangle$. $O_{F}$ accepts inputs $j$ and $l$ and computes the $l^{\text{th}}$ non-zero element in the $j^{\text{th}}$ row of $H$.

Output: $e^{iHt}$

1. Create an input state $\theta$
2. Define a controlled-gate, $c-W$
3. Repeatedly apply single qubit gates to the ancilla followed applications of $c-W$ to the register that contains $\theta$ $O(td||H||_{\text{max}}+{\frac {\log {\frac {1}{\epsilon }}}{\log \log {\frac {1}{\epsilon }}}})$ times.

See also

• Digital signal processing
• Quantum singular value transformation