Decomposition of Unitary Matrices for Finding Quantum Circuits: Application to Molecular Hamiltonians

Abstract

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuits on classical computers. Here, we use the group leaders optimization algorithm to decompose a given unitary matrix into a proper-minimum cost quantum gate sequence. We test the method on the known decompositions of Toffoli gate, the amplification step of the Grover search algorithm, the quantum Fourier transform, and the sender part of the quantum teleportation. Using this procedure, we present the circuit designs for the simulation of the unitary propagators of the Hamiltonians for the hydrogen and the water molecules. The approach is general and can be applied to generate the sequence of quantum gates for larger molecular systems.

References in corpus (6)

• Simulated Quantum Computation of Molecular Energies
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Simulating chemistry using quantum computers
• Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Group Leaders Optimization Algorithm

Cited by in corpus (21)

• Quantum Simulation
• Hartree-Fock on a superconducting qubit quantum computer
• Qudits and high-dimensional quantum computing
• Gate count estimates for performing quantum chemistry on small quantum computers
• Hybrid quantum-classical approach to correlated materials
• Emerging quantum computing algorithms for quantum chemistry
• Five Two-Qubit Gates Are Necessary for Implementing Toffoli Gate
• Quantum Circuit Design for Solving Linear Systems of Equations
• Quantum Phase Estimation with Time-Frequency Qudits in a Single Photon
• Universal Programmable Quantum Circuit Schemes to Emulate an Operator
• Drastic Circuit Depth Reductions with Preserved Adversarial Robustness by Approximate Encoding for Quantum Machine Learning
• A Universal Quantum Circuit Scheme For Finding Complex Eigenvalues
• An Ancilla Based Quantum Simulation Framework for Non-Unitary Matrices
• Variational quantum iterative power algorithms for global optimization
• Towards the speed limit of high fidelity 2-qubit gates
• A genetic-algorithm-based method to find the unitary transformations for any de- sired quantum computation and application to a one-bit oracle decision problem
• Statistical Approach to Quantum Phase Estimation
• Multiple Network Alignment on Quantum Computers
• Optical Quantum Computing
• Quantum Algorithm For Solving Nonlinear Algebraic Equations
• Quantum Eigenvalue Estimation for Irreducible Non-negative Matrices