Low-rank quantum state preparation

TL;DR

This paper introduces a classical-quantum hybrid algorithm to reduce quantum state preparation circuit depth, improving efficiency and accuracy in encoding data into quantum states, especially on current quantum hardware.

Contribution

It proposes a novel method that offloads complexity to classical computation, enabling more efficient and accurate quantum state preparation compared to existing variational approaches.

Findings

Improved quantum state initialization on current quantum processors.

Reduced circuit depth for state preparation.

Enhanced encoding of probability distributions.

Abstract

Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this problem, for instance, by using variational methods that train a fixed depth circuit with manageable complexity. These methods have their limitations, as the lack of a back-propagation technique and barren plateaus. This work proposes an algorithm to reduce state preparation circuit depth by offloading computational complexity to a classical computer. The initialized quantum state can be exact or an approximation, and we show that the approximation is better on today's quantum processors than the initialization of the original state. Experimental evaluation demonstrates that the proposed method enables more efficient initialization of probability distributions in a quantum state.