Decompositions of general quantum gates

Abstract

Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficiently implement decompositions of general quantum gates. In this chapter, we review the different types of general gate decompositions and slightly improve the best known gate count for the controlled NOT gates to (23/48)4^n in the leading order. In physical realizations, the interaction strength between the qubits can decrease strongly as a function of their distance. Therefore, we also discuss decompositions with the restriction to nearest-neighbor interactions in a linear chain of qubits.

A chapter of a book Quantum Computing: New Research

Cited by in corpus (28)

• Synthesis and Optimization of Reversible Circuits - A Survey
• Quantum Circuit Simplification and Level Compaction
• Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition
• Approaching the theoretical limit in quantum gate decomposition
• Efficient decomposition of unitary matrices in quantum circuit compilers
• An $\Theta (\sqrt{n})$-depth Quantum Adder on a 2D NTC Quantum Computer Architecture
• Quantum circuit design for accurate simulation of qudit channels
• Universal programmable photonic architecture for quantum information processing
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• Quantum circuit synthesis using Householder transformations
• Variational Quantum Eigensolver for SU($N$) Fermions
• Formation of Multipartite Entanglement Using Random Quantum Gates
• Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis
• Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method
• Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
• GAPs for Shallow Implementation of Quantum Finite Automata
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
• Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential
• Convex decomposition of dimension-altering quantum channels
• Quantum Circuit Transformation Based on Tabu Search
• A new algorithm for producing quantum circuits using KAK decompositions
• Enhancing quantum models of stochastic processes with error mitigation
• Quantum Pattern Detection: Accurate State- and Circuit-based Analyses
• Solving coupled Non-linear Schrödinger Equations via Quantum Imaginary Time Evolution
• A Novel Single-Layer Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis