Doubling Efficiency of Hamiltonian Simulation via Generalized Quantum Signal Processing
arXiv:2401.10321 · doi:10.1103/PhysRevA.110.012612
Abstract
Quantum signal processing provides an optimal procedure for simulating Hamiltonian evolution on a quantum computer using calls to a block encoding of the Hamiltonian. In many situations it is possible to control between forward and reverse steps with almost identical cost to a simple controlled operation. We show that it is then possible to reduce the cost of Hamiltonian simulation by a factor of 2 using the recent results of generalised quantum signal processing.
arXiv comment9 pages, no figures
References in corpus (9)
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Efficient quantum algorithms for simulating sparse Hamiltonians
- On the relationship between continuous- and discrete-time quantum walk
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Quantum Algorithm for Spectral Measurement with Lower Gate Count
- Quantum Phase Processing and its Applications in Estimating Phase and Entropies
Cited by in corpus (10)
- Halving the Cost of Quantum Algorithms with Randomization
- Block encoding bosons by signal processing
- Complementary polynomials in quantum signal processing
- The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver
- On multivariate polynomials achievable with quantum signal processing
- Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
- Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
- Quantum Simulation of Nuclear Dynamics in First Quantization
- Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
- An adversary bound for quantum signal processing