Resource estimations for the Hamiltonian simulation in correlated electron materials

Kanno, Shu; Endo, Suguru; Utsumi, T.; Tada, Tomofumi

doi:10.1103/physreva.106.012612

Cited by 3 publications

(3 citation statements)

References 72 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work. Qubit and gate resources required for Trotterized Hamiltonian simulation algorithms of fully local Hamiltonians have recently been investigated by Kanno et al 22 . Here, effective Hamiltonians of several unit cells of materials have been constructed starting from a classical description that accounts for the important chemistry of the active space 10 .…”

Section: Simulation Algorithmsmentioning

confidence: 99%

“…This incurs a qubit overhead proportional to the number of unit cells. Importantly, considering that the main problem of current QCs is the presence of gate errors, our approach allows us to achieve a layer depth for single Trotter step that is independent of the size of the system, in stark contrast with the OðN 2=3 cells Þ depth using JW (in a cubic system with nearest neighbour interactions) 22 . Delgado et al recently gave a detailed resource analysis of quantum algorithms for determining properties of battery materials, such as equilibrium voltages and thermal stability 25 .…”

Section: Simulation Algorithmsmentioning

confidence: 99%

“…Interactions acting on large numbers of qubits introduce large circuit overheads in quantum simulation, making them undesirable. For example, under the JW transform-which many naive methods use to estimate algorithmic costs-simulating the dynamics of one of the 2-mode hopping terms may require a quantum circuit whose depth grows with the size of the system 22 . However if the interactions are sparse such that each fermionic mode is involved in a relatively small number of interactions, then these problems may be avoided by a judicious choice of mapping 11,57,58 .…”

Section: Hybrid Fermionic Encoding and Fermionic Swap Networkmentioning

confidence: 99%

See 2 more Smart Citations

Towards near-term quantum simulation of materials

Clinton,

Cubitt,

Flynn

et al. 2024

Nat Commun

View full text Add to dashboard Cite

Determining the ground and excited state properties of materials is considered one of the most promising applications of quantum computers. On near-term hardware, the limiting constraint on such simulations is the requisite circuit depths and qubit numbers, which currently lie well beyond near-term capabilities. Here we develop a quantum algorithm which reduces the estimated cost of material simulations. For example, we obtain a circuit depth improvement by up to 6 orders of magnitude for a Trotter layer of time-dynamics simulation in the transition-metal oxide SrVO3 compared with the best previous quantum algorithms. We achieve this by introducing a collection of connected techniques, including highly localised and physically compact representations of materials Hamiltonians in the Wannier basis, a hybrid fermion-to-qubit mapping, and an efficient circuit compiler. Combined together, these methods leverage locality of materials Hamiltonians and result in a design that generates quantum circuits with depth independent of the system’s size. Although the requisite resources for the quantum simulation of materials are still beyond current hardware, our results show that realistic simulation of specific properties may be feasible without necessarily requiring fully scalable, fault-tolerant quantum computers, providing quantum algorithm design incorporates deeper understanding of the target materials and applications.

show abstract

Section: Simulation Algorithmsmentioning

confidence: 99%

Section: Simulation Algorithmsmentioning

confidence: 99%