Quantum state preparation with multiplicative amplitude transduction

TL;DR

This paper introduces a new quantum state preparation method that reduces resource requirements by using multiplicative amplitude transduction, with two variants optimized for fewer qubits or gates, demonstrated on Ising model distributions.

Contribution

The paper presents a novel quantum state preparation algorithm utilizing multiplicative amplitude transduction, offering variants with fewer qubits or gates, improving efficiency over existing methods.

Findings

Fewer qubits needed for target amplitude precision

Potentially fewer gates in the second variant

Validated on Ising model Boltzmann distribution

Abstract

Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation method that utilizes less quantum computing resource than the existing methods. Two variants of the algorithm with different emphases are introduced. One variant uses fewer qubits and no controlled gates, while the other variant potentially requires fewer gates overall. A general analysis is given to estimate the number of qubits necessary to achieve a desired precision in the amplitudes of the computational basis states. The validity of the algorithm is demonstrated using a prototypical problem of generating Ising model spin configurations according to its Boltzmann distribution.