Double sparse quantum state preparation

Abstract

Initializing classical data in a quantum device is an essential step in many quantum algorithms. As a consequence of measurement and noisy operations, some algorithms need to reinitialize the prepared state several times during its execution. In this work, we propose a quantum state preparation algorithm called CVO-QRAM with computational cost O(kM), where M is the number of nonzero probability amplitudes and $k$ is the maximum number of bits with value 1 in the patterns to be stored. The proposed algorithm can be an alternative to create sparse states in future NISQ devices.

References in corpus (5)

• Quantum algorithm for solving linear systems of equations
• Synthesis of Quantum Logic Circuits
• Quantum-state preparation with universal gate decompositions
• Circuit-Based Quantum Random Access Memory for Classical Data
• Circuit-based quantum random access memory for classical data with continuous amplitudes

Cited by in corpus (19)

• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• A Divide-and-Conquer Approach to Dicke State Preparation
• Low-rank quantum state preparation
• Efficient Deterministic Preparation of Quantum States Using Decision Diagrams
• Sparse Quantum State Preparation for Strongly Correlated Systems
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Efficient and fail-safe quantum algorithm for the transport equation
• High ground state overlap via quantum embedding methods
• Simulating noisy quantum channels via quantum state preparation algorithms
• Simulation of positive operator-valued measures and quantum instruments via quantum state preparation algorithms
• Quantum encoder for fixed Hamming-weight subspaces
• Group Sparse Matrix Optimization for Efficient Quantum State Transformation
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers
• Efficient Sparse State Preparation via Quantum Walks
• Quantum State Preparation Of Multiconfigurational States For Quantum Chemistry
• Comparing Algorithms for Loading Classical Datasets into Quantum Memory
• Single magnon excited states of a Heisenberg spin-chain using a quantum computer
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates
• Quantum Encoding of Structured Data with Matrix Product States