Efficient decomposition of quantum gates

Abstract

Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is $O(4^n)$ which coincides with the theoretical lower bound.

4 pages, 2 figures

References in corpus (6)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Mechanics helps in searching for a needle in a haystack
• Elementary gates for quantum computation
• Two-Bit Gates are Universal for Quantum Computation
• Multi-bit gates for quantum computing
• Optimal multiqubit operations for Josephson charge qubits

Cited by in corpus (100)

• Circuit-centric quantum classifiers
• Synthesis of Quantum Logic Circuits
• Quantum Circuits for General Multiqubit Gates
• Quantum-state preparation with universal gate decompositions
• Experimental Quantum Generative Adversarial Networks for Image Generation
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Quantum circuits with uniformly controlled one-qubit gates
• Asymptotically Optimal Quantum Circuits for d-level Systems
• Using Quantum Computers for Quantum Simulation
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Characterization of two-qubit perfect entanglers
• Clustering of conditional mutual information for quantum Gibbs states above a threshold temperature
• Improving Hamiltonian encodings with the Gray code
• Synthesis of Multivalued Quantum Logic Circuits by Elementary Gates
• Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
• Simple factorization of unitary transformations
• Algorithmic complexity and entanglement of quantum states
• Efficient Grover search with Rydberg blockade
• Approaching the theoretical limit in quantum gate decomposition
• Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer
• Simulating Open Quantum System Dynamics on NISQ Computers with Generalized Quantum Master Equations
• Efficient decomposition of unitary matrices in quantum circuit compilers
• Stabilizing multiple topological fermions on a quantum computer
• Highly Efficient Processing Multi-photon States
• 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
• Constructive Quantum Shannon Decomposition from Cartan Involutions
• Models of quantum computation and quantum programming languages
• Quantum Pseudorandomness and Classical Complexity
• Quantum Circuits for Quantum Channels
• Realization of a General Three-Qubit Quantum Gate
• Learning quantum states and unitaries of bounded gate complexity
• Controlled-Controlled-Phase Gates for Superconducting Qubits Mediated by a Shared Tunable Coupler
• Unitary transformations can be identified locally
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• Universal programmable photonic architecture for quantum information processing
• A Grover search-based algorithm for the list coloring problem
• Optimal synthesis of multivalued quantum circuit
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Simulation of mirror inversion of quantum states in an XY spin chain using NMR
• Implementation of group-covariant POVMs by orthogonal measurements
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• Approximate encoding of quantum states using shallow circuits
• Here comes the SU(N): multivariate quantum gates and gradients
• Minimal computational-space implementation of multi-round quantum protocols
• Optimization of CNOT circuits on limited connectivity architecture
• Experimental implementation of optimal linear-optical controlled-unitary gates
• Quantum circuit synthesis using Householder transformations
• Quantum random walks without walking
• Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of Quantum State Transfer
• Parallel quantum trajectories via forking for sampling without redundancy
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• Quantum state preparation for multivariate functions
• Quantum circuit synthesis via a random combinatorial search
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing
• Geometrical, topological and dynamical description of $\mathcal{N}$ interacting spin-$\mathtt{s}$ under long-range Ising model and their interplay with quantum entanglement
• Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
• Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor
• Algebraic Characterization of CNOT-Based Quantum Circuits with its Applications on Logic Synthesis
• Synergistic Dynamical Decoupling and Circuit Design for Enhanced Algorithm Performance on Near-Term Quantum Devices
• Near-optimal quantum circuit construction via Cartan decomposition
• Demonstrating quantum algorithm acceleration with NMR quantum computer
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
• Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
• A Method to Calculate Correlation for Density Functional Theory on a Quantum Processor
• Quantum Simulation of Simple Many-Body Dynamics
• Quantum circuit simulation of superchannels
• Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
• Algorithmic Primitives for Quantum-Assisted Quantum Control
• Quantum-Logic Synthesis of Hermitian Gates
• Quantum Games and Programmable Quantum Systems
• Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry
• Quantum advantage in temporally flat measurement-based quantum computation
• Constructing three-qubit unitary gates in terms of Schmidt rank and CNOT gates
• Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Quantum Data Loading
• DisQu: Investigating the Impact of Disorder in Quantum Generative Models
• Minimum Synthesis Cost of CNOT Circuits
• Optimal and robust error filtration for quantum information processing
• A Novel Single-Layer Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis
• Compiling universal quantum circuits
• Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
• Collective unitary evolution with linear optics by Cartan decomposition
• Simulation of Lennard-Jones Potential on a Quantum Computer
• Physically motivated decompositions of single-qutrit gates
• Optimizing State Preparation for Variational Quantum Regression on NISQ Hardware
• Quantum Eigenvalue Estimation for Irreducible Non-negative Matrices
• Trainable Quantum Neural Network for Multiclass Image Classification with the Power of Pre-trained Tree Tensor Networks
• A fractal set from the binary reflected Gray code
• A Reed Muller-based approach for optimization of general binary quantum multiplexers
• New perspectives on quantum kernels through the lens of entangled tensor kernels
• Optimizing Quantum Transformation Matrices: A Block Decomposition Approach for Efficient Gate Reduction
• Quantum circuit synthesis with SQiSW
• Time series generation for option pricing on quantum computers using tensor network
• Approximate quantum gates compiling with self-navigation algorithm
• Optimized General Uniform Quantum State Preparation
• Hierarchies among genuine multipartite entangling capabilities of quantum gates