Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack

• URL: http://arxiv.org/abs/2006.01273v3
• Date: Tue, 16 Mar 2021 13:06:21 GMT
• Title: Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Authors: Daniel Mills, Seyon Sivarajah, Travis L. Scholten, Ross Duncan
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing systems need to be benchmarked in terms of practical tasks they would be expected to do. Here, we propose 3 "application-motivated" circuit classes for benchmarking: deep (relevant for state preparation in the variational quantum eigensolver algorithm), shallow (inspired by IQP-type circuits that might be useful for near-term quantum machine learning), and square (inspired by the quantum volume benchmark). We quantify the performance of a quantum computing system in running circuits from these classes using several figures of merit, all of which require exponential classical computing resources and a polynomial number of classical samples (bitstrings) from the system. We study how performance varies with the compilation strategy used and the device on which the circuit is run. Using systems made available by IBM Quantum, we examine their performance, showing that noise-aware compilation strategies may be beneficial, and that device connectivity and noise levels play a crucial role in the performance of the system according to our benchmarks.

Related papers

• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• 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)
• Benchmarking a trapped-ion quantum computer with 30 qubits [0.2276773223605655]
  We benchmark a single-chain 30-qubit trapped-ion quantum computer with all-to-all operations. We build a system-level model to predict the application benchmarking data through direct simulation. This highlights that as quantum computers move toward larger and higher-quality devices, characterization becomes more challenging.
  arXiv  Detail & Related papers  (2023-08-09T17:02:55Z)
• 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)
• Quantum-classical processing and benchmarking at the pulse-level [0.0]
  We discuss the requirements for quantum-classical processing at the pulse-level. We propose well-defined performance benchmarks for quantum control systems. We expect the metrics defined in this work to continue to push the boundaries of quantum computing via control systems.
  arXiv  Detail & Related papers  (2023-03-07T11:32:38Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• 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)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• 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)

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.