Application-Aware Benchmarking on NISQ Hardware using Expectation Value Fidelities

• URL: http://arxiv.org/abs/2410.01505v2
• Date: Tue, 18 Mar 2025 12:06:21 GMT
• Title: Application-Aware Benchmarking on NISQ Hardware using Expectation Value Fidelities
• Authors: Joseph Harris, Peter K. Schuhmacher,
• Abstract summary: We present a low-cost protocol for benchmarking applications on generic quantum hardware in the circuit model.<n>We consider the specific example of simulating a kicked-Ising model on superconducting hardware, showing our benchmark to be more accurate than predictions which use the gate error data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a low-cost protocol for benchmarking applications on generic quantum hardware in the circuit model. Using families of Clifford circuits which mimic the application circuit structure, we are able to predict how measured expectation value fidelities scale with circuit depth. We consider the specific example of simulating a kicked-Ising model on superconducting hardware, showing our benchmark to be more accurate than predictions which use the gate error data obtained through randomized benchmarking. We also demonstrate how our work can be used to benchmark the performance and limitations of quantum error mitigation techniques. Our method is targeted at applications which have a natural decomposition in terms of Pauli rotations, but can be applied to any input circuit with this decomposition.

Related papers

• Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity [1.457374602200336]
  We introduce the concept of ergodicity to random circuit sampling and find that the Haar random quantum circuit satisfies an ergodicity condition. For noise random circuits, we prove that the ergodicity holds fors of degree $t$ with positive coefficients and when the random circuits form a unitary $2t$-design. This suggests that ergodicity is a property that can be exploited to certify a quantum chip.
  arXiv  Detail & Related papers  (2025-02-13T07:04:50Z)
• Empowering Large Scale Quantum Circuit Development: Effective Simulation of Sycamore Circuits [0.0]
  This work demonstrates that circuits as large and complex as the random circuit sampling (RCS) circuits can be effectively simulated with high fidelity on classical systems commonly available to developers. This capability empowers researchers and developers to build, debug, and execute large-scale quantum circuits ahead of the general availability of low-error rate quantum computers or deploy commercial-grade applications.
  arXiv  Detail & Related papers  (2024-11-19T00:13:44Z)
• Benchmarking bosonic and fermionic dynamics [0.6030884970981524]
  We introduce a versatile framework for randomized analog benchmarking of bosonic and fermionic quantum devices. We discuss the scheme's efficiency, derive theoretical performance guarantees and showcase the protocol with numerical examples.
  arXiv  Detail & Related papers  (2024-08-20T18:00:30Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Learning to rank quantum circuits for hardware-optimized performance enhancement [0.0]
  We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits. We compare our method to two common approaches: random layout selection and a publicly available baseline called Mapomatic. Our best model leads to a $1.8times$ reduction in selection error when compared to the baseline approach and a $3.2times$ reduction when compared to random selection.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• Scalable Full-Stack Benchmarks for Quantum Computers [0.0]
  We introduce a technique for creating efficient benchmarks from any set of quantum computations. Our benchmarks assess the integrated performance of a quantum processor's classical compilation algorithms.
  arXiv  Detail & Related papers  (2023-12-21T18:31:42Z)
• Deep Quantum Circuit Simulations of Low-Energy Nuclear States [51.823503818486394]
  We present advances in high-performance numerical simulations of deep quantum circuits. circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.
  arXiv  Detail & Related papers  (2023-10-26T19:10:58Z)
• Predictive Models from Quantum Computer Benchmarks [0.0]
  holistic benchmarks for quantum computers are essential for testing and summarizing the performance of quantum hardware. We introduce a general framework for building predictive models from benchmarking data using capability models. Our case studies use data from cloud-accessible quantum computers and simulations of noisy quantum computers.
  arXiv  Detail & Related papers  (2023-05-15T17:00:23Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• A Herculean task: Classical simulation of quantum computers [4.12322586444862]
  This work reviews the state-of-the-art numerical simulation methods that emulate quantum computer evolution under specific operations. We focus on the mainstream state-vector and tensor-network paradigms while briefly mentioning alternative methods.
  arXiv  Detail & Related papers  (2023-02-17T13:59:53Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Faster Born probability estimation via gate merging and frame optimisation [3.9198548406564604]
  Outcome probabilities of any quantum circuit can be estimated using Monte Carlo sampling. We propose two classical sub-routines: circuit gate optimisation and frame optimisation. We numerically demonstrate that our methods provide improved scaling in the negativity overhead for all tested cases of random circuits.
  arXiv  Detail & Related papers  (2022-02-24T14:18:34Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Application-Oriented Performance Benchmarks for Quantum Computing [0.0]
  benchmarking suite is designed to be readily accessible to a broad audience of users. Our methodology is constructed to anticipate advances in quantum computing hardware that are likely to emerge in the next five years.
  arXiv  Detail & Related papers  (2021-10-07T01:45:06Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack [0.0]
  Quantum computing systems need to be benchmarked in terms of practical tasks they would be expected to do. We propose 3 "application-motivated" circuit classes for benchmarking: deep, shallow, and square. We quantify the performance of quantum computing system in running circuits from these classes using several figures of merit.
  arXiv  Detail & Related papers  (2020-06-01T21:21:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.