Q-score Max-Clique: The First Quantum Metric Evaluation on Multiple
Computational Paradigms
- URL: http://arxiv.org/abs/2302.00639v2
- Date: Mon, 11 Dec 2023 10:54:02 GMT
- Title: Q-score Max-Clique: The First Quantum Metric Evaluation on Multiple
Computational Paradigms
- Authors: Ward van der Schoot, Robert Wezeman, Niels M. P. Neumann, Frank
Phillipson, Rob Kooij
- Abstract summary: We extend the Q-score metric of Atos to the Q-score Max-Clique.
This yields the first application-level metric which allows comparison of three different paradigms of quantum computing.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- 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. We add
to the landscape of quantum metrics by extending the Q-score metric of Atos to
the Q-score Max-Clique. To our knowledge, this yields the first
application-level metric which allows comparison of 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
- 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) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - 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) - Enhancing Quantum Annealing in Digital-Analog Quantum Computing [0.0]
Digital-analog quantum computing (DAQC) offers a promising approach to addressing the challenges of building a practical quantum computer.
We propose an algorithm designed to enhance the performance of quantum annealing.
This study provides an example of how processing quantum data using a quantum circuit can outperform classical data processing, which discards quantum information.
arXiv Detail & Related papers (2023-06-03T09:16:15Z) - 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) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - 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) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - 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.