Efficient decomposition of unitary matrices in quantum circuit compilers

Abstract

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations, which is key to executing these algorithms on existing quantum computers. The decomposition can be used as an aggressive optimization method for the whole circuit, as well as to test part of an algorithm on a quantum accelerator. For selection and implementation of the decomposition algorithm, perfect qubits are assumed. We base our decomposition technique on Quantum Shannon Decomposition which generates O((3/4)*4^n) controlled-not gates for an n-qubit input gate. The resulting circuits are up to 10 times shorter than other methods in the field. When comparing our implementation to Qubiter, we show that our implementation generates circuits with half the number of CNOT gates and a third of the total circuit length. In addition to that, it is also up to 10 times as fast. Further optimizations are proposed to take advantage of potential underlying structure in the input or intermediate matrices, as well as to minimize the execution time of the decomposition.

13 pages

References in corpus (2)

• Synthesis of Quantum Logic Circuits
• Realization of a General Three-Qubit Quantum Gate

Cited by in corpus (19)

• Approaching the theoretical limit in quantum gate decomposition
• A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions
• A Grover search-based algorithm for the list coloring problem
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
• Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations
• On the sampling complexity of open quantum systems
• Exploring ab initio machine synthesis of quantum circuits
• Hybrid Tree Tensor Networks for quantum simulation
• Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential
• Optimisation-free Classification and Density Estimation with Quantum Circuits
• Universal Approximation Theorem and error bounds for quantum neural networks and quantum reservoirs
• Qsyn: A Developer-Friendly Quantum Circuit Synthesis Framework for NISQ Era and Beyond
• Block encoding of matrix product operators
• Detecting Measurement-Induced Entanglement Transitions With Unitary Mirror Circuits
• Automated Synthesis of Quantum Algorithms via Classical Numerical Techniques
• Optimal and robust error filtration for quantum information processing
• A Novel Single-Layer Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis
• Quantum Circuits in Additive Hilbert Space
• Quantum Encoding of Structured Data with Matrix Product States