Quantum-state preparation with universal gate decompositions

Abstract

In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when judging the complexity of the circuit: the total number of CNOT gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of CNOT gates from 2^n to 23/24 2^n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 CNOT gates to 9 and the depth from 11 to 5 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

5 pages, 1 figure

References in corpus (12)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Elementary gates for quantum computation
• Synthesis of Quantum Logic Circuits
• Quantum Circuits for General Multiqubit Gates
• Experimental realization of Dicke states of up to six qubits for multiparty quantum networking
• Minimal Universal Two-qubit Quantum Circuits
• Efficient decomposition of quantum gates
• Process tomography of ion trap quantum gates
• Quantum circuits with uniformly controlled one-qubit gates
• Constructive Quantum Shannon Decomposition from Cartan Involutions
• Entanglement changing power of two-qubit unitary operations
• Towards optimization of quantum circuits

Cited by in corpus (152)

• Circuit-centric quantum classifiers
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• Quantum Computing for Finance: State of the Art and Future Prospects
• Experimental Quantum Generative Adversarial Networks for Image Generation
• An Artificial Neuron Implemented on an Actual Quantum Processor
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Option Pricing using Quantum Computers
• Quantum Circuits for Isometries
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Quantum noise protects quantum classifiers against adversaries
• Quantum Adversarial Machine Learning
• Quantum Algorithm Implementations for Beginners
• Quantum federated learning through blind quantum computing
• A Threshold for Quantum Advantage in Derivative Pricing
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Optimal Blind Quantum Computation
• Quantum implementation of an artificial feed-forward neural network
• Minimally-Entangled State Preparation of Localized Wavefunctions on Quantum Computers
• Classical-to-quantum convolutional neural network transfer learning
• Lipkin model on a quantum computer
• Optimal Strategies of Quantum Metrology with a Strict Hierarchy
• Linear-depth quantum circuits for multiqubit controlled gates
• Efficient State Preparation for Quantum Amplitude Estimation
• Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
• Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies
• Quantum Circuits for Sparse Isometries
• Configurable sublinear circuits for quantum state preparation
• Practical Quantum K-Means Clustering: Performance Analysis and Applications in Energy Grid Classification
• Quantum algorithms for approximate function loading
• Digital Quantum Simulation of Non-Equilibrium Quantum Many-Body Systems
• Probing entanglement across the energy spectrum of a hard-core Bose-Hubbard lattice
• The Efficient Preparation of Normal Distributions in Quantum Registers
• Double sparse quantum state preparation
• Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• Grover search revisited; application to image pattern matching
• Universal Adversarial Examples and Perturbations for Quantum Classifiers
• Non-IID Quantum Federated Learning with One-shot Communication Complexity
• Approximate Quantum Circuit Synthesis using Block-Encodings
• Quantum Circuits for Quantum Channels
• Algorithm for the solution of the Dirac equation on digital quantum computers
• Low-rank quantum state preparation
• Fast Black-Box Quantum State Preparation
• Hybrid classical-quantum linear solver using Noisy Intermediate-Scale Quantum machines
• Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
• An efficient quantum algorithm for preparation of uniform quantum superposition states
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
• Scalable Benchmarks for Gate-Based Quantum Computers
• Automatically Differentiable Quantum Circuit for Many-qubit State Preparation
• Efficient Deterministic Preparation of Quantum States Using Decision Diagrams
• Representation of binary classification trees with binary features by quantum circuits
• Sparse Quantum State Preparation for Strongly Correlated Systems
• A duplication-free quantum neural network for universal approximation
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• Implementing efficient selective quantum process tomography of superconducting quantum gates on the IBM quantum processor
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Approximate complex amplitude encoding algorithm and its application to data classification problems
• Approximate encoding of quantum states using shallow circuits
• Circuit complexity of quantum access models for encoding classical data
• Quantum Monte Carlo for Economics: Stress Testing and Macroeconomic Deep Learning
• Experimental implementation of optimal linear-optical controlled-unitary gates
• Quantum circuit synthesis using Householder transformations
• Efficient and fail-safe quantum algorithm for the transport equation
• Supervised Learning with Quantum Measurements
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications
• Quantum algorithms for scientific computing
• Introduction to UniversalQCompiler
• Fully-Optimized Quantum Metrology: Framework, Tools, and Applications
• Quantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems
• Quantum Generative Models for Small Molecule Drug Discovery
• Efficient explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations
• Parallel quantum trajectories via forking for sampling without redundancy
• Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data
• Automatic quantum circuit encoding of a given arbitrary quantum state
• Simulating noisy quantum channels via quantum state preparation algorithms
• Quantum Causal Unravelling
• Encoding classical data into a quantum computer
• A Quantum Algorithm for Shapley Value Estimation
• Quantum circuit synthesis via a random combinatorial search
• Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm
• Quantum state preparation for multivariate functions
• Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions
• Quantum and Quantum-Inspired Stereographic K Nearest-Neighbour Clustering
• Enhancing Quantum Field Theory Simulations on NISQ Devices with Hamiltonian Truncation
• Near-term Efficient Quantum Algorithms for Entanglement Analysis
• State preparation of AGP on a quantum computer without number projection
• Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor
• Efficient quantum interpolation of natural data
• Improved iterative quantum algorithm for ground-state preparation
• Solving reaction dynamics with quantum computing algorithms
• Simulation of positive operator-valued measures and quantum instruments via quantum state preparation algorithms
• Ansatz-Independent Variational Quantum Classifier
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
• Spin-s Dicke states and their preparation
• A Quantum Simulation Approach to Implementing Nuclear Density Functional Theory via Imaginary Time Evolution
• Quantum Support Vector Machines for Continuum Suppression in B Meson Decays
• Verification of Quantum Systems using Barrier Certificates
• Quantum Algorithm For Estimating Eigenvalue
• Variational simulation of the Lipkin-Meshkov-Glick model on a neutral atom quantum computer
• Convex decomposition of dimension-altering quantum channels
• Noise-Aware Quantum Amplitude Estimation
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• Numerical circuit synthesis and compilation for multi-state preparation
• Probabilistic state synthesis based on optimal convex approximation
• Quantum Pathways for Charged Track Finding in High-Energy Collisions
• Assisted quantum simulation of open quantum systems
• Synthesizing quantum circuits via numerical optimization
• Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
• Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
• Initial-state-dependent quantum speed limit for dissipative state preparation: Framework and optimization
• Efficient Quantum Circuits based on the Quantum Natural Gradient
• Quantum encoder for fixed Hamming-weight subspaces
• Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Conditions for a quadratic quantum speedup in nonlinear transforms with applications to energy contract pricing
• Quantum Multiplexer Simplification for State Preparation
• Quantum circuits for partial differential equations in Fourier space
• Block encoding of matrix product operators
• Efficient explicit circuit for quantum state preparation of piecewise continuous functions
• Preparing Many Copies of a Quantum State in the Black-Box Model
• Full Characterization of the Depth Overhead for Quantum Circuit Compilation with Arbitrary Qubit Connectivity Constraint
• Quantum-Enhanced Simulation-Based Optimization for Newsvendor Problems
• QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation
• Linear decomposition of approximate multi-controlled single qubit gates
• A universal duplication-free quantum neural network
• Entanglement Properties of Quantum Superpositions of Smooth, Differentiable Functions
• Quantum control without quantum states
• Efficient Sparse State Preparation via Quantum Walks
• Benchmarking quantum tomography completeness and fidelity with machine learning
• Quantum Pattern Detection: Accurate State- and Circuit-based Analyses
• Typical Machine Learning Datasets as Low-Depth Quantum Circuits
• Constructing three-qubit unitary gates in terms of Schmidt rank and CNOT gates
• A time-marching quantum algorithm for simulation of the nonlinear Lorenz dynamics
• Constant-time Quantum Algorithm for Homology Detection in Closed Curves
• Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Quantum Data Loading
• Conditional Generative Models for Learning Stochastic Processes
• Three-Qubit State Preparation: Classification and Explicit Circuits
• Single magnon excited states of a Heisenberg spin-chain using a quantum computer
• Quantum State Preparation Of Multiconfigurational States For Quantum Chemistry
• Suppressing decoherence in quantum state transfer with unitary operations
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates
• Comparing Algorithms for Loading Classical Datasets into Quantum Memory
• A general approach to quantum integration of cross sections in high-energy physics
• Solving coupled Non-linear Schrödinger Equations via Quantum Imaginary Time Evolution
• Thermality versus objectivity: can they peacefully coexist?
• Efficient implementation of single particle Hamiltonians in exponentially reduced qubit space
• Bethe ansatz on a quantum computer?
• Optimizing State Preparation for Variational Quantum Regression on NISQ Hardware
• Optimizing Quantum Transformation Matrices: A Block Decomposition Approach for Efficient Gate Reduction
• Robust and optimal loading of general classical data into quantum computers
• Schmidt quantum compressor