Linear-depth quantum circuits for multiqubit controlled gates

Abstract

Quantum circuit depth minimization is critical for practical applications of circuit-based quantum computation. In this work, we present a systematic procedure to decompose multiqubit controlled unitary gates, which is essential in many quantum algorithms, to controlled-NOT and single-qubit gates with which the quantum circuit depth only increases linearly with the number of control qubits. Our algorithm does not require any ancillary qubits and achieves a quadratic reduction of the circuit depth against known methods. We show the advantage of our algorithm with proof-of-principle experiments on the IBM quantum cloud platform.

References in corpus (25)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Supervised learning with quantum enhanced feature spaces
• The theory of variational hybrid quantum-classical algorithms
• Quantum support vector machine for big data classification
• Validating quantum computers using randomized model circuits
• Quantum computing for finance: overview and prospects
• Efficient Simulation of Quantum Systems by Quantum Computers
• Quantum convolutional neural network for classical data classification
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum-state preparation with universal gate decompositions
• Implementing a distance-based classifier with a quantum interference circuit
• Option Pricing using Quantum Computers
• Quantum Circuits for Isometries
• Quantum circuits with uniformly controlled one-qubit gates
• Circuit-Based Quantum Random Access Memory for Classical Data
• On the robustness of bucket brigade quantum RAM
• Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
• The theory of the quantum kernel-based binary classifier
• Circuit-based quantum random access memory for classical data with continuous amplitudes
• Reducing the Depth of Linear Reversible Quantum Circuits
• Compact quantum kernel-based binary classifier
• Depth-Optimized Reversible Circuit Synthesis

Cited by in corpus (22)

• Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture
• Synthesizing efficient circuits for Hamiltonian simulation
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• On efficient quantum block encoding of pseudo-differential operators
• Automatic Generation of an Efficient Less-Than Oracle for Quantum Amplitude Amplification
• Optimizing Gate Decomposition for High-Level Quantum Programming
• Jet Discrimination with Quantum Complete Graph Neural Network
• Quantum state preparation for multivariate functions
• Machine-learning-inspired quantum optimal control of nonadiabatic geometric quantum computation via reverse engineering
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
• Block encoding of matrix product operators
• Linear decomposition of approximate multi-controlled single qubit gates
• Efficient application of the factorized form of the unitary coupled-cluster ansatz for the variational quantum eigensolver algorithm by using linear combination of unitaries
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Quadratic speed-ups in quantum kernelized binary classification
• Expressivity of deterministic quantum computation with one qubit
• Efficient Sparse State Preparation via Quantum Walks
• Phases and phase transition in Grover's algorithm with systematic noise
• Classification and transformations of quantum circuit decompositions for permutation operations
• Single-Qudit Quantum Neural Networks for Multiclass Classification
• Grover Adaptive Search with Spin Variables
• Time-frequency-correlated Native CCZ Gate in Superconducting Circuits