An Efficient Algorithm for Sparse Quantum State Preparation

Generating quantum circuits that prepare specific states is an essential part of quantum compilation. Algorithms that solve this problem for general states generate circuits at grow exponentially in the number of qubits. However, in contrast to general states, many practically relevant states are sp...

Full description

Saved in:
Bibliographic Details
Published in:2021 58th ACM/IEEE Design Automation Conference (DAC) pp. 433 - 438
Main Authors: Gleinig, Niels, Hoefler, Torsten
Format: Conference Proceeding
Language:English
Published: IEEE 05.12.2021
Subjects:
Circuit Synthesis
Design automation
Quantum circuit
Quantum Compilation
Quantum Computing
Quantum state
Qubit
State Preparation
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Generating quantum circuits that prepare specific states is an essential part of quantum compilation. Algorithms that solve this problem for general states generate circuits at grow exponentially in the number of qubits. However, in contrast to general states, many practically relevant states are sparse in the standard basis. In this paper we show how sparsity can be used for efficient state preparation. We present a polynomial-time algorithm that generates polynomial-size quantum circuits (linear in the number of nonzero coefficients times number of qubits) that prepare given states, making computer-aided design of sparse state preparation scalable.
DOI:10.1109/DAC18074.2021.9586240