Numerical circuit synthesis and compilation for multi-state preparation

Abstract

Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given state from a fixed input state, called "state preparation"; and circuits to implement a given unitary operation, for example by "unitary synthesis". In this paper we solve a more general problem: the transformation of a set of $m$ states to another set of $m$ states, which we call "multi-state preparation". State preparation and unitary synthesis are special cases; for state preparation, $m=1$, while for unitary synthesis, $m$ is the dimension of the full Hilbert space. We generate and optimize circuits for multi-state preparation numerically. In cases where a top-down approach based on matrix decompositions is also possible, our method finds circuits with substantially (up to 40%) fewer two-qubit gates. We discuss possible applications, including efficient preparation of macroscopic superposition ("cat") states and synthesis of quantum channels.

arXiv commentv3: fixed two references; v2: Added to discussion in Sections IIA and VIB; v1: 10 pages, 2 figures

References in corpus (32)

• Quantum Computing in the NISQ era and beyond
• Persistent entanglement in arrays of interacting particles
• Suppressing quantum errors by scaling a surface code logical qubit
• Synthesis of Quantum Logic Circuits
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Chaos and complexity by design
• Optimal Quantum Circuits for General Two-Qubit Gates
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• High-Fidelity Entanglement and Detection of Alkaline-Earth Rydberg Atoms
• Quantum-state preparation with universal gate decompositions
• Two-qubit silicon quantum processor with operation fidelity exceeding 99%
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• A quantum linear system algorithm for dense matrices
• Quantum Circuits for Isometries
• A divide-and-conquer algorithm for quantum state preparation
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Demonstration of a High-Fidelity CNOT for Fixed-Frequency Transmons with Engineered ZZ Suppression
• Quantum circuits with uniformly controlled one-qubit gates
• Approximation by Quantum Circuits
• High fidelity two-qubit gates on fluxoniums using a tunable coupler
• Machine learning of noise-resilient quantum circuits
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Symmetric Rydberg controlled-Z gates with adiabatic pulses
• Scalable High-Performance Fluxonium Quantum Processor
• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Optimal quantum circuit synthesis from Controlled-U gates
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits
• Approximate Quantum Circuit Synthesis using Block-Encodings
• How many CNOT gates does it take to generate a three-qubit state ?
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• Efficient quantum gate decomposition via adaptive circuit compression

Cited by in corpus (3)

• Adaptive variational simulation for open quantum systems
• Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor
• Quantum phase estimation with optimal confidence interval using three control qubits