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

DOI10.1142/S0219749922500125OpenAlexW4224857506WikidataQ114072377 ScholiaQ114072377MaRDI QIDQ5868359

Ioannis G. Karafyllidis, Georgios D. Varsamis

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

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

Related Items (1)

Hitting times of quantum and classical random walks in potential spaces

Cites Work

• Universal Computation by Multiparticle Quantum Walk
• Quantum computer simulator based on the circuit model of quantum computation
• Quantum Transport: Atom to Transistor

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