5
talks
0
committee roles
0
leadership roles
2021–2024
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
|
Efficient Quantum Simulation of Solid-State Materials via Pseudopotentials ↗
|
TQC 2024 | regular | ▸Dominic Berry, Nicholas Rubin, Ahmed Elnabawy, Gabriele Ahlers, Eugene DePrince, Christian Gogolin, Ryan Babbush |
First-quantized plane-wave representations provide a very promising approach for quantum algorithms for solid state materials. Pseudopotentials provide a method of further reducing the complexity by avoiding the need to simulate highly localized core orbitals. The complicated functional form of pseudopotentials constitutes a major challenge for the design of quantum algorithms. In this work we provide new techniques to efficiently implement pseudopotentials in quantum algorithms, with orders of magnitude improvement in complexity. Our methods include a high-accuracy QROM interpolation of the exponential function, combined with QROM for the pseudopotential parameters and coherent arithmetic. Moreover, we generalize prior methods to enable the simulation of materials defined by non-cubic unit cells. Finally, we combine these techniques to estimate the resources for block encoding required for simulating commercially relevant instances of heterogeneous catalysis. |
|||
| Quantum computation of stopping power for inertial fusion target design | TQC 2024 | regular | ▸Nicholas Rubin, Dominic Berry, Alina Kononov, Fionn Malone, Tanuj Khattar, Alec White, Hartmut Neven, Ryan Babbush, Andrew Baczewski |
Stopping power is the rate at which a material absorbs the kinetic energy of a charged particle passing through it – one of many properties needed over a wide range of thermodynamic conditions in modeling inertial fusion implosions. First-principles stopping calculations are classically challenging because they involve the dynamics of large electronic systems far from equilibrium, with accuracies that are particularly difficult to constrain and assess in the warm-dense conditions preceding ignition. Here, we describe a protocol for using a fault-tolerant quantum computer to calculate stopping power from a first-quantized representation of the electrons and projectile. Our approach builds upon the electronic structure block encodings of Su et al. [PRX Quantum 2, 040332 2021], adapting and optimizing those algorithms to estimate observables of interest from the non-Born-Oppenheimer dynamics of multiple particle species at finite temperature. We also work out the constant factors associated with a novel implementation of a high-order Trotter approach to simulating a grid representation of these systems. Ultimately, we report logical qubit requirements and leading-order Toffoli costs for computing the stopping power of various projectile/target combinations relevant to interpreting and designing inertial fusion experiments. We estimate that scientifically interesting and classically intractable stopping power calculations can be quantum simulated with roughly the same number of logical qubits and about one hundred times more Toffoli gates than is required for state-of-the-art quantum simulations of industrially relevant molecules such as FeMoco or P450. |
|||
| Matchgate Shadows for Fermionic Quantum Simulation | QIP 2023 | regular | ▸Kianna Wan, William Huggins, Ryan Babbush |
| Efficient quantum computation of chemistry through tensor hypercontraction | QIP 2021 | regular | Dominic Berry, Craig Gidney, William Huggins, Jarrod McClean, Nathan Wiebe, Ryan Babbush |
Abstract We show how to achieve the highest efficiency yet for simulations with arbitrary basis sets by using a representation of the Coulomb operator known as tensor hypercontraction (THC). We use THC to express the Coulomb operator in a non-orthogonal basis, which we are able to block encode by separately rotating each term with angles that are obtained via QROM. Our algorithm has the best complexity scaling for an arbitrary basis, as well as the best complexity for the specific case of FeMoCo. By optimising the surface code resources, we show that FeMoCo can be simulated using about 4 million physical qubits and 3.5 days of runtime, assuming 1 s cycle times and physical gate error rates no worse than 0.1%. |
|||
| Even more efficient quantum computations of chemistry through tensor hypercontraction | TQC 2021 | regular | Dominic Berry, Craig Gidney, William Huggins, Jarrod McClean, Nathan Wiebe, Ryan Babbush |
Collaborators
| Co-author | Joint talks |
|---|---|
| Ryan Babbush | 5 |
| Dominic Berry | 4 |
| William Huggins | 3 |
| Craig Gidney | 2 |
| Jarrod McClean | 2 |
| Nathan Wiebe | 2 |
| Nicholas Rubin | 2 |
| Ahmed Elnabawy | 1 |
| Alec White | 1 |
| Alina Kononov | 1 |
| Andrew Baczewski | 1 |
| Christian Gogolin | 1 |
| Eugene DePrince | 1 |
| Fionn Malone | 1 |
| Gabriele Ahlers | 1 |
| Hartmut Neven | 1 |
| Kianna Wan | 1 |
| Tanuj Khattar | 1 |