Spacetime-Efficient Low-Depth Quantum State Preparation with Applications
share
We propose a novel deterministic method for preparing arbitrary quantum states, and we show that it requires asymptotically fewer quantum resources than previous methods. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an N-dimensional state in depth O(log(N)) and spacetime allocation (a metric that accounts for the fact that oftentimes some ancilla qubits need not be active for the entire protocol) O(N), which are both optimal and not simultaneously achieved by previous methods. When compiled into the {H,S,T,CNOT} gate set, it prepares an arbitrary state up to error ϵ in depth O(log(N/ϵ)) and spacetime allocation O(Nlog(log(N)/ϵ)), improving over O(log(N)log(N/ϵ)) and O(Nlog(N/ϵ)), respectively. We illustrate how the reduced spacetime allocation of our protocol enables rapid preparation of many disjoint states with only constant-factor ancilla overhead – O(N) ancilla qubits are reused efficiently to prepare a product state of w N-dimensional states in depth O(w + log(N)) rather than O(wlog(N)), achieving effectively constant depth per state. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations. We provide quantum circuit descriptions of our protocol along with detailed pseudocode.
READ FULL TEXT