7 papers
Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion
Maria-Andreea Filip, Nathan Fitzpatrick
We consider a quantum algorithm for ground-state preparation based on a Chebyshev series approximation to the wall function. In a classical setting, this approach is appealing as i…
Shorter width truncated Taylor series for Hamiltonian dynamics simulations
Michelle Wynne Sze, David Zsolt Manrique, David Muñoz Ramo +1
As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order ) makes a good candidate for simulat…
The Quantum Paldus Transform: Efficient Circuits with Applications
JÄdrzej Burkat, Nathan Fitzpatrick
We present the Quantum Paldus Transform: an efficient quantum algorithm for block-diagonalising fermionic, spin-free Hamiltonians in the second quantisation. Our algorithm implemen…
Unification of Finite Symmetries in Simulation of Many-body Systems on Quantum Computers
Victor M. Bastidas, Nathan Fitzpatrick, K. J. Joven +5
Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can results in significant…
Quantum state preparation for multivariate functions
Matthias Rosenkranz, Eric Brunner, Gabriel Marin-Sanchez +5
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variab…
Hamiltonian dynamics simulation using linear combination of unitaries on an ion trap quantum computer
Michelle Wynne Sze, Yao Tang, Silas Dilkes +3
The linear combination of unitaries (LCU) method has proven to scale better than existing product formulas in simulating long time Hamiltonian dynamics. However, given the number o…