Description
The quantum simulation of quantum systems in materials science and quantum chemistry would have a considerable impact on both our understanding and industrial applications.
Such scientific and commercially relevant sized quantum simulations will require large scale fault tolerant quantum computers, and thus it is crucial that algorithms and compilation methods are improved to lower the resource costs to achieve these quantum advantages in the near future.
When compiling quantum circuits for quantum algorithms there are many Implementation choices to make that trade off space and time.
In this work we investigate resource estimates for such choices under physically defensible error models for Quantum Phase Estimation in utility scale material simulation.
We analyse how these trade offs stack up when Error Correction and Fault tolerant Quantum Computation are considered including magic state factories, routing and idling.
We analyse a parallel windowing method in Qubitised Quantum Phase Estimation and how to best make these Implementation choices given surface code and 2D grid nearest neighbour architecture.
| I am the presenting author | Yes |
|---|