Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers

Abstract

Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $|b⟩$. However, efficiently preparing $|b⟩$ is known to be a difficult problem because an arbitrary state of $Q$ qubits generally requires approximately $2^Q$ entangling gates, which results in significant decoherence on today's Noisy Intermediate Scale Quantum (NISQ) computers. We present a deterministic (nonvariational) algorithm that allows one to flexibly reduce the quantum resources required for state preparation in an entanglement efficient manner. Although this comes at the expense of reduced theoretical fidelity, actual fidelities on current NISQ computers might actually be higher due to reduced decoherence. We show this to be true for various cases of interest such as the normal and log-normal distributions. For low entanglement states, our algorithm can prepare states with more than an order of magnitude fewer entangling gates as compared to isometric decomposition.

11 pages, 3 figures, 1 table

References in corpus (7)

• Quantum algorithm for solving linear systems of equations
• Efficient quantum state tomography
• Synthesis of Quantum Logic Circuits
• Quantum Data Fitting
• Quantum-state preparation with universal gate decompositions
• Real- and imaginary-time evolution with compressed quantum circuits
• A divide-and-conquer algorithm for quantum state preparation

Cited by in corpus (7)

• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Discriminating mixed qubit states with collective measurements
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Quantum Multiplexer Simplification for State Preparation
• Optimal Qubit Mapping Search for Encoding Classical Data into Matrix Product State Representation with Minimal Loss
• Tensor Network Efficiently Representing Schmidt Decomposition of Quantum Many-Body States
• Quantum Encoding of Structured Data with Matrix Product States