Computing the lowest eigenstate of tight-binding Hamiltonians using quantum walks

DOI10.1142/S0219749922500125MaRDI QIDQ5868359zbMATH OpenOpenAlexWikidataFDO

Authors Georgios D. Varsamis, Ioannis G. Karafyllidis

Publication date 20 September 2022

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219749922500125

zbMATH Keywords

ground statequantum walkstight-binding Hamiltonians

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Sums of independent random variables; random walks (60G50) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum gates (81P65) Quantum computation (81P68) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Atomic physics (81V45) Statistical mechanics of nanostructures and nanoparticles (82D80)

Recommendations

• A quantum algorithm for obtaining the lowest eigenstate of a Hamiltonian assisted with an ancillary qubit system
• Approximating ground and excited state energies on a quantum computer
• Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
• An algebraic quantum circuit compression algorithm for Hamiltonian simulation
• The variational quantum eigensolver: a review of methods and best practices

Cites work

• Quantum computer simulator based on the circuit model of quantum computation
• Quantum Transport: Atom to Transistor
• Universal computation by multiparticle quantum walk

Cited in

(1)

• Hitting times of quantum and classical random walks in potential spaces

This page was built for publication: Computing the lowest eigenstate of tight-binding Hamiltonians using quantum walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868359)