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 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.

[1]  Robert Wille,et al.  Make it reversible: Efficient embedding of non-reversible functions , 2017, Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017.

[2]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[3]  Scott Aaronson,et al.  Multilinear formulas and skepticism of quantum computing , 2003, STOC '04.

[4]  Robert Wille,et al.  Synthesis of reversible circuits with minimal lines for large functions , 2012, 17th Asia and South Pacific Design Automation Conference.

[5]  Gerhard W. Dueck,et al.  Reversible cascades with minimal garbage , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  D. Hofman,et al.  How to build the thermofield double state , 2018, Journal of High Energy Physics.

[7]  Robert Wille,et al.  Reducing the number of lines in reversible circuits , 2010, Design Automation Conference.

[8]  Torsten Hoefler,et al.  Embedding Functions Into Reversible Circuits: A Probabilistic Approach to the Number of Lines , 2019, 2019 56th ACM/IEEE Design Automation Conference (DAC).

[9]  Michele Mosca,et al.  Quantum Networks for Generating Arbitrary Quantum States , 2001, OFC 2001.

[10]  Mikko Möttönen,et al.  Transformation of quantum states using uniformly controlled rotations , 2004, Quantum Inf. Comput..

[11]  Robert Wille,et al.  Embedding of Large Boolean Functions for Reversible Logic , 2014, ACM J. Emerg. Technol. Comput. Syst..

[12]  Robert Wille,et al.  Determining the minimal number of lines for large reversible circuits , 2011, 2011 Design, Automation & Test in Europe.

[13]  A. Harrow,et al.  Quantum algorithm for linear systems of equations. , 2008, Physical review letters.

[14]  V.V. Shende,et al.  Synthesis of quantum-logic circuits , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[16]  Robert Wille,et al.  Logic Synthesis for Quantum State Generation , 2016, 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL).

[17]  Francesco Petruccione,et al.  A divide-and-conquer algorithm for quantum state preparation , 2020, Scientific Reports.

[18]  J. Cirac,et al.  Three qubits can be entangled in two inequivalent ways , 2000, quant-ph/0005115.

[19]  Amnon Ta-Shma,et al.  Adiabatic quantum state generation and statistical zero knowledge , 2003, STOC '03.

[20]  E. Knill.  Approximation by Quantum Circuits , 1995 .