LMLana Mineh

Lana Mineh

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Lana Mineh has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Benchmarking a wide range of optimisers for solving the Fermi-Hubbard model using the variational quantum eigensolver

    by Benjamin Dm Jones, Lana Mineh, Ashley Montanaro

    We numerically benchmark 30 optimisers on 372 instances of the variational quantum eigensolver for solving the Fermi-Hubbard system with the Hamiltonian variational ansatz. We rank the optimisers with respect to metrics such as final energy achieved and function calls needed to get within a certain tolerance level, and find that the best-performing optimisers are variants of gradient descent such as Momentum and ADAM (using finite difference), SPSA, CMAES, and BayesMGD. We perform gradient analysis, and observe that the step size for finite difference has a very significant impact. We also consider using simultaneous perturbation (inspired by SPSA) as a gradient subroutine: here finite difference can lead to a more precise estimate of the ground state but uses more calls, whereas simultaneous perturbation can converge quicker but may be less precise in the later stages. Finally, we study the quantum natural gradient algorithm: we implement this method for 1-dimensional Fermi-Hubbard systems, and find that whilst it can reach a lower energy with fewer iterations, this improvement is typically lost when taking total function calls into account. Our method involves performing careful hyperparameter sweeping on 4 instances. We present a variety of analysis and figures, detailed optimiser notes, and discuss future directions.


  • Open Access

    Accelerating the variational quantum eigensolver using parallelism

    by Lana Mineh, Ashley Montanaro

    Quantum computers are getting larger and larger, but device fidelities may not be able to keep up with the increase in qubit numbers. One way to make use of a large device that has a limited gate depth is to run many small circuits simultaneously. In this paper we detail our investigations into running circuits in parallel on the Rigetti Aspen-M-1 device. We run two-qubit circuits in parallel to solve a simple instance of the Hubbard model using the variational quantum eigensolver (VQE). We present results for running up to 33 circuits in parallel (66 qubits), showing that with the use of error mitigation techniques it is possible to make use of, and gain a real-time speedup from, parallelisation on current quantum hardware. We obtain a speedup by 18× for exploring the VQE energy landscape, and by more than 8× for running VQE optimisation.


  • Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver

    by Lana Mineh, Ashley Montanaro

    Calculating the ground state properties of a Hamiltonian can be mapped to the problem of finding the ground state of a smaller Hamiltonian through the use of embedding methods. These embedding techniques have the ability to drastically reduce the problem size, and hence the number of qubits required when running on a quantum computer. However, the embedding process can produce a relatively complicated Hamiltonian, leading to a more complex quantum algorithm. In this paper we carry out a detailed study into how density matrix embedding theory (DMET) could be implemented on a quantum computer to solve the Hubbard model. We consider the variational quantum eigensolver (VQE) as the solver for the embedded Hamiltonian within the DMET algorithm. We derive the exact form of the embedded Hamiltonian and use it to construct efficient ansatz circuits and measurement schemes. We conduct detailed numerical simulations up to 16 qubits, the largest to date, for a range of Hubbard model parameters and find that the combination of DMET and VQE is effective for reproducing ground state properties of the model.


  • Top Cited Papers

    Strategies for solving the Fermi-Hubbard model on near-term quantum computers

    by Chris Cade, Lana Mineh, Ashley Montanaro, Stasja Stanisic

    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 using variational methods has been predicted to be one of the first applications of near-term quantum computers. Here we carry out a detailed analysis and optimization of the complexity of variational quantum algorithms for finding the ground state of the Hubbard model, including costs associated with mapping to a real-world hardware platform. The depth complexities we find are substantially lower than previous work. We performed extensive numerical experiments for systems with up to 12 sites. The results suggest that the variational ansätze we used—an efficient variant of the Hamiltonian variational ansatz and a generalization thereof—will be able to find the ground state of the Hubbard model with high fidelity in relatively low quantum circuit depths. Our experiments include the effect of realistic measurements and depolarizing noise. If our numerical results on small lattice sizes are representative of the somewhat larger lattices accessible to near-term quantum hardware, they suggest that optimizing over quantum circuits with a gate depth less than a thousand could be sufficient to solve instances of the Hubbard model beyond the capacity of classical exact diagonalization.