A divide-and-conquer algorithm for quantum state preparation

Understand

Advantages in several fields of research and industry are expected with the rise of quantum computers.

• However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups.
• Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector.
• Here, we show that it is possible to load an N-dimensional vector with a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits.