Extending the Q-score to an Application-level Quantum Metric Framework

• URL: http://arxiv.org/abs/2302.00639v3
• Date: Tue, 01 Oct 2024 12:03:36 GMT
• Title: Extending the Q-score to an Application-level Quantum Metric Framework
• Authors: Ward van der Schoot, Robert Wezeman, Niels M. P. Neumann, Frank Phillipson, Rob Kooij,
• Abstract summary: evaluating the performance of quantum devices is an important step towards scaling quantum devices and eventually using them in practice. A prominent quantum metric is given by the Q-score metric of Atos. We show that the Q-score defines a framework of quantum metrics, which allows benchmarking using different problems, user settings and solvers.
• Score: 0.0
• License:
• Abstract: Evaluating the performance of quantum devices is an important step towards scaling quantum devices and eventually using them in practice. The great number of available quantum metrics and the different hardware technologies used to develop quantum computers complicate this evaluation. In addition, different computational paradigms implement quantum operations in different ways. A prominent quantum metric is given by the Q-score metric of Atos. This metric was originally introduced as a standalone way to benchmark devices using the Max-Cut problem. In this work, we show that the Q-score defines a framework of quantum metrics, which allows benchmarking using different problems, user settings and solvers. To showcase the applicability of the framework, we showcase a second Q-score in this framework, called the Q-score Max-Clique. This yields, to our knowledge, the first application-level metric capable of natively comparing three different paradigms of quantum computing. This metric is evaluated on these computational quantum paradigms -- quantum annealing, gate-based quantum computing, and photonic quantum computing -- and the results are compared to those obtained by classical solvers.

Related papers

• Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer [56.435136806763055]
  IQM Quantum Computers is described covering both the QPU and the rest of the full-stack quantum computer. The focus is on a 20-qubit quantum computer featuring the Garnet QPU and its architecture, which we will scale up to 150 qubits. We present QPU and system-level benchmarks, including a median 2-qubit gate fidelity of 99.5% and genuinely entangling all 20 qubits in a Greenberger-Horne-Zeilinger (GHZ) state.
  arXiv  Detail & Related papers  (2024-08-22T14:26:10Z)
• QuAS: Quantum Application Score for benchmarking the utility of quantum computers [0.0]
  This paper presents a revised holistic scoring method called the Quantum Application Score (QuAS) We discuss how to integrate both and thereby obtain an application-level metric that better quantifies the practical utility of quantum computers. We evaluate the new metric on different hardware platforms such as D-Wave and IBM as well as quantum simulators of Quantum Inspire and Rigetti.
  arXiv  Detail & Related papers  (2024-06-06T09:39:58Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering [3.187381965457262]
  We develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the quantum steering effect. Our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory.
  arXiv  Detail & Related papers  (2023-03-14T13:55:06Z)
• Quantum utility -- definition and assessment of a practical quantum advantage [0.0]
  Different use-cases come with different requirements for size, weight, power consumption, or data privacy. This paper aims to incorporate these characteristics into a concept coined quantum utility. It demonstrates the effectiveness and practicality of quantum computers for various applications.
  arXiv  Detail & Related papers  (2023-03-03T18:33:46Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Deterministic and random features for large-scale quantum kernel machine [0.9404723842159504]
  We show that the quantum kernel method (QKM) can be made scalable by using our proposed deterministic and random features. Our numerical experiment, using datasets including $O(1,000) sim O(10,000)$ training data, supports the validity of our method.
  arXiv  Detail & Related papers  (2022-09-05T13:22:34Z)
• Scalable Benchmarks for Gate-Based Quantum Computers [5.735035463793008]
  We develop and release an advanced quantum benchmarking framework. It measures the performance of universal quantum devices in a hardware-agnostic way. We present the benchmark results of twenty-one different quantum devices from IBM, Rigetti and IonQ.
  arXiv  Detail & Related papers  (2021-04-21T18:00:12Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.