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.

arXiv comment11 pages, 9 figures, Combined Appendix

References in corpus (36)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• A Quantum Approximate Optimization Algorithm
• Quantum Chemistry in the Age of Quantum Computing
• An introduction to quantum machine learning
• Randomized Benchmarking of Quantum Gates
• Engineered 2D Ising interactions on a trapped-ion quantum simulator with hundreds of spins
• Hartree-Fock on a superconducting qubit quantum computer
• Validating quantum computers using randomized model circuits
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum optimization using variational algorithms on near-term quantum devices
• Scalable Noise Estimation with Random Unitary Operators
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Characterization of addressability by simultaneous randomized benchmarking
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Accelerated Variational Quantum Eigensolver
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• The one-dimensional Hubbard model: A reminiscence
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Quantum algorithms to simulate many-body physics of correlated fermions
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• A volumetric framework for quantum computer benchmarks
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
• 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
• Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
• 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