A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark

Abstract

In order to quantify the relative performance of different testbed quantum computing devices, it is useful to benchmark them using a common protocol. While some benchmarks rely on the performance of random circuits and are generic in nature, here we instead propose and implement a practical, application-based benchmark. In particular, our protocol calculates the energy of the ground state in the single particle subspace of a 1-D Fermi Hubbard model, a problem which is efficient to solve classically. We provide a quantum ansatz for the problem that is provably able to probe the full single particle subspace for a general length 1-D chain and scales efficiently in number of gates and measurements. Finally, we demonstrate and analyze the benchmark performance on superconducting and ion trap testbed hardware from three hardware vendors and with up to 24 qubits.

11 pages, 9 figures, Combined Appendix

References in corpus (11)

• A Quantum Approximate Optimization Algorithm
• An introduction to quantum machine learning
• Randomized Benchmarking of Quantum Gates
• Characterization of addressability by simultaneous randomized benchmarking
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
• A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution
• Preparing Bethe Ansatz Eigenstates on a Quantum Computer
• An application benchmark for fermionic quantum simulations

Cited by in corpus (4)

• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• QUARK: A Framework for Quantum Computing Application Benchmarking
• AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer