A Model for Circuit Execution Runtime And Its Implications for Quantum Kernels At Practical Data Set Sizes

• URL: http://arxiv.org/abs/2307.04980v1
• Date: Tue, 11 Jul 2023 02:38:22 GMT
• Title: A Model for Circuit Execution Runtime And Its Implications for Quantum Kernels At Practical Data Set Sizes
• Authors: Travis L. Scholten, Derrick Perry II, Joseph Washington, Jennifer R. Glick, Thomas Ward
• Abstract summary: We present a model for the total circuit execution time required on quantum circuits. We also introduce the notion of an "effective number of quantum volume layers of a circuit" At current speeds of quantum computers, our model predicts data sets can be processed in order a few hours.
• Score: 0.5906031288935515
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum machine learning (QML) is a fast-growing discipline within quantum computing. One popular QML algorithm, quantum kernel estimation, uses quantum circuits to estimate a similarity measure (kernel) between two classical feature vectors. Given a set of such circuits, we give a heuristic, predictive model for the total circuit execution time required, based on a recently-introduced measure of the speed of quantum computers. In doing so, we also introduce the notion of an "effective number of quantum volume layers of a circuit", which may be of independent interest. We validate the performance of this model using synthetic and real data by comparing the model's predictions to empirical runtime data collected from IBM Quantum computers through the use of the Qiskit Runtime service. At current speeds of today's quantum computers, our model predicts data sets consisting of on the order of hundreds of feature vectors can be processed in order a few hours. For a large-data workflow, our model's predictions for runtime imply further improvements in the speed of circuit execution -- as well as the algorithm itself -- are necessary.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Q-gen: A Parameterized Quantum Circuit Generator [0.6062751776009752]
  We introduce Q-gen, a high-level, parameterized quantum circuit generator incorporating 15 realistic quantum algorithms. Q-gen is an open-source project that serves as the entrance for users with a classical computer science background to dive into the world of quantum computing.
  arXiv  Detail & Related papers  (2024-07-26T12:22:40Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Program Scheduling [48.142860424323395]
  We introduce the Quantum Program Scheduling Problem (QPSP) to improve the utility efficiency of quantum resources. Specifically, a quantum program scheduling method concerning the circuit width, number of measurement shots, and submission time of quantum programs is proposed to reduce the execution latency.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• 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)
• Quantum-Assisted Simulation: A Framework for Developing Machine Learning Models in Quantum Computing [0.0]
  We investigate the history of quantum computing, examine existing QML algorithms, and present a simplified procedure for setting up simulations of QML algorithms. We conduct simulations on a dataset using both traditional machine learning and quantum machine learning approaches.
  arXiv  Detail & Related papers  (2023-11-17T07:33:42Z)
• A Quantum Optical Recurrent Neural Network for Online Processing of Quantum Times Series [0.7087237546722617]
  We show that a quantum optical recurrent neural network (QORNN) can enhance the transmission rate of quantum channels. We also show that our model can counteract similar memory effects if they are unwanted. We run a small-scale version of this last task on the photonic processor Borealis.
  arXiv  Detail & Related papers  (2023-05-31T19:19:25Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Quantum Machine Learning for Software Supply Chain Attacks: How Far Can We Go? [5.655023007686363]
  This paper analyzes speed up performance of QC when applied to machine learning algorithms, known as Quantum Machine Learning (QML) Due to limitations of real quantum computers, the QML methods were implemented on open-source quantum simulators such as Qiskit and IBM Quantum. Interestingly, the experimental results differ to the speed up promises of QC by demonstrating higher computational time and lower accuracy in comparison to the classical approaches for SSC attacks.
  arXiv  Detail & Related papers  (2022-04-04T21:16:06Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)

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.