Quantum Multiplexer Simplification for State Preparation

Abstract

The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build the quantum state. Here, we propose an algorithm that detects whether a given quantum state can be factored into substates, increasing the efficiency of compiling the QSP circuit when we initialize states with some level of unentanglement. The simplification is done by eliminating controls of quantum multiplexers, significantly reducing circuit depth and the number of CNOT gates with a better execution and compilation time than the previous QSP algorithms. Considering efficiency in terms of depth and number of CNOT gates, our method is competitive with the methods in the literature. However, when it comes to run-time and compilation efficiency, our result is significantly better, and the experiments show that by increasing the number of qubits, the gap between the temporal efficiency of the methods increases.

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• Strong quantum computational advantage using a superconducting quantum processor
• Synthesis of Quantum Logic Circuits
• Quantum-state preparation with universal gate decompositions
• Quantum Circuits for Isometries
• Quantum computing with Qiskit
• A divide-and-conquer algorithm for quantum state preparation
• Quantum circuits with uniformly controlled one-qubit gates
• Circuit-Based Quantum Random Access Memory for Classical Data
• Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
• Probabilistic Quantum Memories
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Decoherence Bounds on Quantum Computation with Trapped Ions
• Configurable sublinear circuits for quantum state preparation
• Low-rank quantum state preparation
• Efficient Deterministic Preparation of Quantum States Using Decision Diagrams
• Compact quantum kernel-based binary classifier
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications
• Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers