Quantum Circuits for Isometries

Abstract

We consider the decomposition of arbitrary isometries into a sequence of single-qubit and Controlled-NOT (C-NOT) gates. In many experimental architectures, the C-NOT gate is relatively 'expensive' and hence we aim to keep the number of these as low as possible. We derive a theoretical lower bound on the number of C-NOT gates required to decompose an arbitrary isometry from m to n qubits, and give three explicit gate decompositions that achieve this bound up to a factor of about two in the leading order. We also perform some bespoke optimizations for certain cases where m and n are small. In addition, we show how to apply our result for isometries to give decomposition schemes for arbitrary quantum operations and POVMs via Stinespring's theorem. These results will have an impact on experimental efforts to build a quantum computer, enabling them to go further with the same resources.

10+11 pages, 4 tables, many circuits, v2: a new decomposition has been added, v3: minor changes, v4: small correction to the counts in Theorem 1, and updated numbering to match journal version. The decompositions in this work have now been implemented (see arXiv:1904.01072)

References in corpus (7)

• High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
• High-fidelity quantum logic gates using trapped-ion hyperfine qubits
• Synthesis of Quantum Logic Circuits
• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• Quantum-state preparation with universal gate decompositions
• Sinkhorn normal form for unitary matrices
• How many CNOT gates does it take to generate a three-qubit state ?

Cited by in corpus (109)

• Circuit-centric quantum classifiers
• Variational quantum algorithms for nonlinear problems
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• A divide-and-conquer algorithm for quantum state preparation
• Sample-optimal tomography of quantum states
• Supervised quantum machine learning models are kernel methods
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Circuit-Based Quantum Random Access Memory for Classical Data
• Lower bounds on the non-Clifford resources for quantum computations
• Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Theory for Equivariant Quantum Neural Networks
• Preparation of matrix product states with log-depth quantum circuits
• Universal discriminative quantum neural networks
• Compiling quantum algorithms for architectures with multi-qubit gates
• Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation
• Universal qudit gate synthesis for transmons
• Quantum Channel Construction with Circuit Quantum Electrodynamics
• Quantum linear systems algorithms: a primer
• Optimal Strategies of Quantum Metrology with a Strict Hierarchy
• Linear-depth quantum circuits for multiqubit controlled gates
• Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
• Approaching the theoretical limit in quantum gate decomposition
• Efficient decomposition of unitary matrices in quantum circuit compilers
• Quantum Circuits for Sparse Isometries
• MoG-VQE: Multiobjective genetic variational quantum eigensolver
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Exact and practical pattern matching for quantum circuit optimization
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Quantum Simulation of Nuclear Inelastic Scattering
• Digital Quantum Simulation of Non-Equilibrium Quantum Many-Body Systems
• High-fidelity realization of the AKLT state on a NISQ-era quantum processor
• Double sparse quantum state preparation
• Quantum Circuits for Quantum Channels
• Generative machine learning with tensor networks: benchmarks on near-term quantum computers
• Shorter quantum circuits via single-qubit gate approximation
• Universal quantum multi-qubit entangling gates with auxiliary spaces
• Low-rank quantum state preparation
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• Drastic Circuit Depth Reductions with Preserved Adversarial Robustness by Approximate Encoding for Quantum Machine Learning
• Enabling Dataflow Optimization for Quantum Programs
• Efficient Deterministic Preparation of Quantum States Using Decision Diagrams
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Quantum algorithms for grid-based variational time evolution
• Implementing efficient selective quantum process tomography of superconducting quantum gates on the IBM quantum processor
• Entanglement cost and entangling power of bipartite unitary and permutation operators
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Approximate encoding of quantum states using shallow circuits
• Quantum circuit synthesis using Householder transformations
• Heuristics for Quantum Compiling with a Continuous Gate Set
• Quantum-classical eigensolver using multiscale entanglement renormalization
• Introduction to UniversalQCompiler
• Fully-Optimized Quantum Metrology: Framework, Tools, and Applications
• Hamiltonian Simulation of Quantum Beats in Radical Pairs Undergoing Thermal Relaxation on Near-term Quantum Computers
• Simulating open quantum dynamics on an NMR quantum processor using the Sz.-Nagy dilation algorithm
• Automatic Generation of an Efficient Less-Than Oracle for Quantum Amplitude Amplification
• Variational quantum state discriminator for supervised machine learning
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data
• Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers
• Optimizing Gate Decomposition for High-Level Quantum Programming
• Nonlocality activation in a photonic quantum network
• Quantum state preparation for multivariate functions
• High-fidelity, multi-qubit generalized measurements with dynamic circuits
• Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm
• Exploring ab initio machine synthesis of quantum circuits
• Robust and Resource-Efficient Quantum Circuit Approximation
• Solving the Hele-Shaw flow using the Harrow-Hassidim-Lloyd algorithm on superconducting devices: A study of efficiency and challenges
• Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
• Quantifying Superpositions Between Quantum Evolutions
• Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems
• Convex decomposition of dimension-altering quantum channels
• Numerical circuit synthesis and compilation for multi-state preparation
• An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications
• Probabilistic state synthesis based on optimal convex approximation
• Quantum density estimation with density matrices: Application to quantum anomaly detection
• Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
• Quantum circuit simulation of superchannels
• Quantum encoder for fixed Hamming-weight subspaces
• Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians
• The State Preparation of Multivariate Normal Distributions using Tree Tensor Network
• Braiding fractional quantum Hall quasiholes on a superconducting quantum processor
• Quantum Multiplexer Simplification for State Preparation
• Linear decomposition of approximate multi-controlled single qubit gates
• Weighted Quantum Channel Compiling through Proximal Policy Optimization
• Quantum Pattern Detection: Accurate State- and Circuit-based Analyses
• Enhanced Predictive Capability for Chaotic Dynamics by Modified Quantum Reservoir Computing
• Dynamics and computation in linear open quantum walks
• Typical Machine Learning Datasets as Low-Depth Quantum Circuits
• Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo
• Experimental demonstration of the Bell-type inequalities for four qubit Dicke state using IBM Quantum Processing Units
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates
• Evolution of Entanglement Witness of Dicke State under Noise and Error Mitigation
• Automated Synthesis of Quantum Algorithms via Classical Numerical Techniques
• Simultaneous Quantum Machine Learning Training and Architecture Discovery
• Three-Qubit State Preparation: Classification and Explicit Circuits
• Shot-based quantum encoding: a data-loading paradigm for quantum neural networks
• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• A Spectral Quantum Algorithm for Numerical Differentiation and Integration
• Nonlinear path-following via the asymptotic numerical method on a quantum processor
• Schmidt quantum compressor
• Quantum Encoding of Structured Data with Matrix Product States
• A weighted quantum ensemble of homogeneous quantum classifiers
• Trainable Quantum Neural Network for Multiclass Image Classification with the Power of Pre-trained Tree Tensor Networks
• Sample Optimal and Memory Efficient Quantum State Tomography
• Optimizing State Preparation for Variational Quantum Regression on NISQ Hardware
• Block Encoding of Sparse Matrices via Coherent Permutation
• Quantum phase estimation with optimal confidence interval using three control qubits
• Tucker iterative quantum state preparation
• Error-Tolerant Quantum State Discrimination: Optimization and Quantum Circuit Synthesis