Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry
arXiv:2310.06676 · doi:10.7566/JPSJ.93.054002
Abstract
During the noisy intermediate-scale quantum (NISQ) era, it is important to optimize the quantum circuits in circuit depth and gate count, especially entanglement gates, including the CNOT gate. Among all the unitary operators, diagonal unitary matrices form a special class that plays a crucial role in many quantum algorithms/subroutines. Based on a natural gate set {CNOT, Rz}, quantum circuits for general diagonal unitary matrices were discussed in several previous works, and an optimal synthesis algorithm was proposed in terms of circuit depth. In this paper, we are interested in the implementation of diagonal unitary matrices with reflection symmetry, which has promising applications, including the realization of real-time evolution for first quantized Hamiltonians by quantum circuits. Owing to such a symmetric property, we show that the quantum circuit in the existing work can be further simplified and propose a constructive algorithm that optimizes the entanglement gate count. Compared to the previous synthesis methods for general diagonal unitary matrices, the quantum circuit by our proposed algorithm achieves nearly half the reduction in both the gate count and circuit depth.
arXiv comment21 pages
References in corpus (24)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Strong quantum computational advantage using a superconducting quantum processor
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Hartree-Fock on a superconducting qubit quantum computer
- Synthesis of Quantum Logic Circuits
- Benchmarking an 11-qubit quantum computer
- Quantum advantage with shallow circuits
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Efficient Simulation of Quantum Systems by Quantum Computers
- Efficient decomposition of quantum gates
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- Asymptotically Optimal Quantum Circuits for d-level Systems
- Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
- Non-adiabatic molecular quantum dynamics with quantum computers
- Grid-based methods for chemistry simulations on a quantum computer
- Programmable networks for quantum algorithms
- The Efficient Preparation of Normal Distributions in Quantum Registers
- Quantum arithmetic operations based on quantum Fourier transform on signed integers
- Quantum simulation of real-space dynamics
- Exhaustive search for optimal molecular geometries using imaginary-time evolution on a quantum computer
- Decoupling with random diagonal unitaries
- Phase context decomposition of diagonal unitaries for higher-dimensional systems