Featuremetric benchmarking: Quantum computer benchmarks based on circuit features

• URL: http://arxiv.org/abs/2504.12575v1
• Date: Thu, 17 Apr 2025 01:49:02 GMT
• Title: Featuremetric benchmarking: Quantum computer benchmarks based on circuit features
• Authors: Timothy Proctor, Anh Tran, Xingxin Liu, Aditya Dhumuntarao, Stefan Seritan, Alaina Green, Norbert M Linke,
• Abstract summary: Benchmarks that concisely summarize the performance of many-qubit quantum computers are essential for measuring progress towards the goal of useful quantum computation.<n>We present a benchmarking framework that is based on quantifying how a quantum computer's performance varies as a function of features of those circuits.
• Score: 1.0842830860169255
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Benchmarks that concisely summarize the performance of many-qubit quantum computers are essential for measuring progress towards the goal of useful quantum computation. In this work, we present a benchmarking framework that is based on quantifying how a quantum computer's performance on quantum circuits varies as a function of features of those circuits, such as circuit depth, width, two-qubit gate density, problem input size, or algorithmic depth. Our featuremetric benchmarking framework generalizes volumetric benchmarking -- a widely-used methodology that quantifies performance versus circuit width and depth -- and we show that it enables richer and more faithful models of quantum computer performance. We demonstrate featuremetric benchmarking with example benchmarks run on IBM Q and IonQ systems of up to 27 qubits, and we show how to produce performance summaries from the data using Gaussian process regression. Our data analysis methods are also of interest in the special case of volumetric benchmarking, as they enable the creation of intuitive two-dimensional capability regions using data from few circuits.

Related papers

• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Modeling Quantum Volume Using Randomized Benchmarking of Room-Temperature NV Center Quantum Registers [0.0]
  We tackle the problem of benchmarking a quantum register based on the NV center in diamond operating at room temperature.<n>Thanks to an all-to-all connectivity the 2 and 3 qubit gates performance is promising and competitive among other platforms.
  arXiv  Detail & Related papers  (2024-12-17T14:43:31Z)
• 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)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• On-Chip Hardware-Aware Quantization for Mixed Precision Neural Networks [52.97107229149988]
  We propose an On-Chip Hardware-Aware Quantization framework, performing hardware-aware mixed-precision quantization on deployed edge devices. For efficiency metrics, we built an On-Chip Quantization Aware pipeline, which allows the quantization process to perceive the actual hardware efficiency of the quantization operator. For accuracy metrics, we propose Mask-Guided Quantization Estimation technology to effectively estimate the accuracy impact of operators in the on-chip scenario.
  arXiv  Detail & Related papers  (2023-09-05T04:39:34Z)
• 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)
• Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques [1.351147045576948]
  We propose to extend the characterization of quantum circuits by including qubit interaction graph properties. Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing configurations of quantum devices.
  arXiv  Detail & Related papers  (2022-12-13T15:24:37Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• 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)
• 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)
• Quantum Computer Benchmarking via Quantum Algorithms [0.0]
  We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution and the simulated noisy and ideal quantum evolutions.
  arXiv  Detail & Related papers  (2021-12-17T11:54:05Z)
• 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)
• 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.