A quantum hamiltonian simulation benchmark

Abstract

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of $n$-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an `optimal' simulation time $t^{\text{opt}}\approx 4.81$, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

arXiv comment35 pages, 9 figures

References in corpus (33)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Characterizing Quantum Supremacy in Near-Term Devices
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Robust randomized benchmarking of quantum processes
• Validating quantum computers using randomized model circuits
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Toward the first quantum simulation with quantum speedup
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Information Scrambling in Computationally Complex Quantum Circuits
• Average-case complexity versus approximate simulation of commuting quantum computations
• Characterizing large-scale quantum computers via cycle benchmarking
• Nearly optimal lattice simulation by product formulas
• Near-optimal ground state preparation
• Faster quantum simulation by randomization
• Measuring the Capabilities of Quantum Computers
• Efficient phase-factor evaluation in quantum signal processing
• Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
• Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
• Decoupling with random quantum circuits
• Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
• Hamiltonian simulation in the low-energy subspace
• Fast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
• Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
• Hamiltonian simulation with nearly optimal dependence on spectral norm

Cited by in corpus (12)

• Benchmarking quantum computers
• Realization of quantum signal processing on a noisy quantum computer
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Integration of Quantum Accelerators with High Performance Computing -- A Review of Quantum Programming Tools
• Dissipative Preparation of Many-Body Quantum States: Towards Practical Quantum Advantage
• Infinite quantum signal processing
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
• Quantum circuits for partial differential equations in Fourier space
• Quantum approximated cloning-assisted density matrix exponentiation
• Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors