Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems
is a prominent target for quantum computers. However, accurately representing the Fermi …
is a prominent target for quantum computers. However, accurately representing the Fermi …
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
The Fermi-Hubbard model is of fundamental importance in condensed-matter physics, yet is
extremely challenging to solve numerically. Finding the ground state of the Hubbard model …
extremely challenging to solve numerically. Finding the ground state of the Hubbard model …
Quantum algorithms to simulate many-body physics of correlated fermions
Simulating strongly correlated fermionic systems is notoriously hard on classical computers.
An alternative approach, as proposed by Feynman, is to use a quantum computer. We …
An alternative approach, as proposed by Feynman, is to use a quantum computer. We …
Quantum-optimal-control-inspired ansatz for variational quantum algorithms
A central component of variational quantum algorithms (VQAs) is the state-preparation
circuit, also known as ansatz or variational form. This circuit is most commonly designed …
circuit, also known as ansatz or variational form. This circuit is most commonly designed …
Block locally optimal preconditioned eigenvalue xolvers (BLOPEX) in HYPRE and PETSc
AV Knyazev, ME Argentati, I Lashuk… - SIAM Journal on Scientific …, 2007 - SIAM
We describe our software package Block Locally Optimal Preconditioned Eigenvalue
Xolvers (BLOPEX) recently publicly released. BLOPEX is available as a stand-alone serial …
Xolvers (BLOPEX) recently publicly released. BLOPEX is available as a stand-alone serial …
[PDF][PDF] Accelerating the LOBPCG method on GPUs using a blocked sparse matrix vector product.
H Anzt, S Tomov, JJ Dongarra - SpringSim (HPS), 2015 - researchgate.net
This paper presents a heterogeneous CPU-GPU implementation for a sparse iterative
eigensolver–the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG). For …
eigensolver–the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG). For …
Feedback-based quantum algorithms for ground state preparation
The ground state properties of quantum many-body systems are a subject of interest across
chemistry, materials science, and physics. Thus, algorithms for finding ground states can …
chemistry, materials science, and physics. Thus, algorithms for finding ground states can …
Compressed variational quantum eigensolver for the fermi-hubbard model
A Montanaro, S Stanisic - arXiv preprint arXiv:2006.01179, 2020 - arxiv.org
The Fermi-Hubbard model is a plausible target to be solved by a quantum computer using
the variational quantum eigensolver algorithm. However, problem sizes beyond the reach of …
the variational quantum eigensolver algorithm. However, problem sizes beyond the reach of …
On the performance and energy efficiency of sparse linear algebra on GPUs
H Anzt, S Tomov, J Dongarra - The International Journal of …, 2017 - journals.sagepub.com
In this paper we unveil some performance and energy efficiency frontiers for sparse
computations on GPU-based supercomputers. We compare the resource efficiency of …
computations on GPU-based supercomputers. We compare the resource efficiency of …
Communication-overlap techniques for improved strong scaling of gyrokinetic Eulerian code beyond 100k cores on the K-computer
Plasma turbulence research based on five-dimensional (5D) gyrokinetic simulations is one
of the most critical and demanding issues in fusion science. To pioneer new physics regimes …
of the most critical and demanding issues in fusion science. To pioneer new physics regimes …