Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
arXiv:2407.16345 · doi:10.1007/s11128-025-04697-7
Abstract
In this article, we compare the methods implementing the real-time evolution operator generated by a unitary diagonal matrix where its entries obey a known underlying real function. When the size of the unitary diagonal matrix is small, a well-known method based on Walsh operators gives a good and precise implementation. In contrast, as the number of qubits grows, the precise one uses exponentially increasing resources, and we need an efficient implementation based on suitable approximate functions. Using piecewise polynomial approximation of the function, we summarize the methods with different polynomial degrees. Moreover, we obtain the overheads of gate count for different methods concerning the error bound and grid parameter (number of qubits). This enables us to analytically find a relatively good method as long as the underlying function, the error bound, and the grid parameter are given. This study contributes to the problem of encoding a known function in the phase factor, which plays a crucial role in many quantum algorithms/subroutines. In particular, we apply our methods to implement the real-time evolution operator for the potential part in the first-quantized Hamiltonian simulation and estimate the resources (gate count and ancillary qubits) regarding the error bound, which indicates that the error coming from the approximation of the potential function is not negligible compared to the error from the Trotter-Suzuki formula.
References in corpus (30)
- Elementary gates for quantum computation
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Variational ansatz-based quantum simulation of imaginary time evolution
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Efficient Simulation of Quantum Systems by Quantum Computers
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Addition on a Quantum Computer
- Quantum arithmetic with the Quantum Fourier Transform
- Simulating chemistry efficiently on fault-tolerant quantum computers
- Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
- Simulations of Many-Body Quantum Systems by a Quantum Computer
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
- Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
- Quantum simulation of the single-particle Schrodinger equation
- Non-adiabatic molecular quantum dynamics with quantum computers
- On the CNOT-complexity of CNOT-PHASE circuits
- Nonunitary quantum circuit
- Linear-depth quantum circuits for multiqubit controlled gates
- Grid-based methods for chemistry simulations on a quantum computer
- Programmable networks for quantum algorithms
- Quantum arithmetic operations based on quantum Fourier transform on signed integers
- Quantum simulation of real-space dynamics
- Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
- Approximating Fractional Time Quantum Evolution
- Quantum Simulation of Tunneling in Small Systems
- Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
- Efficient quantum interpolation of natural data
- Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry
- Phase context decomposition of diagonal unitaries for higher-dimensional systems