Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas

Abstract

The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but generally require ancilla registers, which can dominate the qubit resources. In this paper, we point out a correspondence between Walsh functions and a basis for diagonal operators that gives a simple way to construct efficient circuits for diagonal unitaries without ancillas. This correspondence reduces the problem of constructing the minimal-depth circuit within a given error tolerance, for an arbitrary diagonal unitary $e^{if(\hat{x})}$ in the $|x>$ basis, to that of finding the minimal-length Walsh-series approximation to the function $f(x)$. We apply this approach to the quantum simulation of the classical Eckart barrier problem of quantum chemistry, demonstrating that high-fidelity quantum simulations can be achieved with few qubits and low depth.

8 pages, 7 figures

References in corpus (3)

• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Quantum simulation of the single-particle Schrodinger equation
• Quantum Simulation of Tunneling in Small Systems

Cited by in corpus (65)

• The theory of variational hybrid quantum-classical algorithms
• Quantum Chemistry in the Age of Quantum Computing
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Adiabatic Quantum Simulation of Quantum Chemistry
• High-precision quantum algorithms for partial differential equations
• Exploiting locality in quantum computation for quantum chemistry
• Quantum Computing for Neutrino-nucleus Scattering
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Time-resolved magnetic sensing with electronic spins in diamond
• On the CNOT-complexity of CNOT-PHASE circuits
• Primitive Quantum Gates for Dihedral Gauge Theories
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
• A quantum walk assisted approximate algorithm for bounded NP optimisation problems
• Nonlinear Quantum Neuron: A Fundamental Building Block for Quantum Neural Networks
• Efficient quantum amplitude encoding of polynomial functions
• Quantum Computing for Fusion Energy Science Applications
• Medium induced jet broadening in a quantum computer
• On the complexity of implementing Trotter steps
• Programmable quantum simulation by dynamic Hamiltonian engineering
• Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective
• Reducing the CNOT count for Clifford+T circuits on NISQ architectures
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Simulating Non-Markovian Quantum Dynamics on NISQ Computers Using the Hierarchical Equations of Motion
• Simulating scalar field theories on quantum computers with limited resources
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• Efficient quantum circuits for Toeplitz and Hankel matrices
• Quantum state preparation for multivariate functions
• Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem
• Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
• Solving reaction dynamics with quantum computing algorithms
• Singular value decomposition quantum algorithm for quantum biology
• Forbidden subspaces for level-1 QAOA and IQP circuits
• Rescaling interactions for quantum control
• Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers
• Block encoding bosons by signal processing
• Lower Bounds for the Trotter Error
• Dual unitaries as maximizers of the distance to local product gates
• Characterization, synthesis, and optimization of quantum circuits over multiple-control $\text{Z}$-rotation gates: A systematic study
• Simulating nonlinear optical processes on a superconducting quantum device
• Quantum algorithm for learning secret strings and its experimental demonstration
• Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer
• Qumode transfer between continuous and discrete variable devices
• Efficient state initialization by a quantum spectral filtering algorithm
• A functional basis for efficient physical-layer classical control in quantum processors
• Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry
• Phase context decomposition of diagonal unitaries for higher-dimensional systems
• Impact of dynamics, entanglement, and Markovian noise on the fidelity of few-qubit digital quantum simulation
• Inequality constraints in variational quantum circuits with qudits
• Simulation of the elementary evolution operator with the motional states of an ion in an anharmonic trap
• Quantum spatial search with electric potential : long-time dynamics and robustness to noise
• Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations
• Using quantum computers to identify prime numbers via entanglement dynamics
• Quantum state preparation via piecewise QSVT
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Quantum approximated cloning-assisted density matrix exponentiation
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators
• Comment on arXiv:2307.08384 "Efficient Quantum State Preparation with Walsh Series"
• Quantum Simulation-Based Optimization for Cooling System Design
• Quantum Simulation of Two-Level $PT$-Symmetric Systems Using Hermitian Hamiltonians
• Resource-Efficient Quantum Optimization via Higher-Order Encoding
• Prime Number Identification Demonstrated with Quantum Processors Using a New Rescaling-Based Noise Mitigation Technique
• Quantum algorithm for anisotropic diffusion and convection equations with vector norm scaling
• Koopman and transfer operator techniques from the perspective of quantum theory