Assessing the Requirements for Industry Relevant Quantum Computation

• URL: http://arxiv.org/abs/2408.02587v1
• Date: Mon, 5 Aug 2024 16:00:49 GMT
• Title: Assessing the Requirements for Industry Relevant Quantum Computation
• Authors: Anna M. Krol, Marvin Erdmann, Ewan Munro, Andre Luckow, Zaid Al-Ars,
• Abstract summary: We use open-source tools to assess the requirements for industry-relevant quantum computation. We base our figures of merit on current technology, as well as theoretical high-fidelity scenarios for superconducting qubit platforms. We find that the execution time of gate and measurement operations determines the overall computational runtime more strongly than the system error rates.
• Score: 1.1687566782940522
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we use open-source tools to perform quantum resource estimation to assess the requirements for industry-relevant quantum computation. Our analysis uses the problem of industrial shift scheduling in manufacturing and the Quantum Industrial Shift Scheduling algorithm. We base our figures of merit on current technology, as well as theoretical high-fidelity scenarios for superconducting qubit platforms. We find that the execution time of gate and measurement operations determines the overall computational runtime more strongly than the system error rates. Moreover, achieving a quantum speedup would not only require low system error rates ($10^{-6}$ or better), but also measurement operations with an execution time below 10ns. This rules out the possibility of near-term quantum advantage for this use case, and suggests that significant technological or algorithmic progress will be needed before such an advantage can be achieved.

Related papers

• Space-Time Optimisations for Early Fault-Tolerant Quantum Computation [0.30079490585515334]
  We develop compilation techniques tailored to the needs of early FTQC systems.<n>Our work offers results with an average overhead of 1.2X in execution time for a 53% reduction in qubits against the theoretical lower bounds.<n>As the industry develops early FTQC systems with tens to hundreds of logical qubits over the coming years, our work has the potential to be widely useful.
  arXiv  Detail & Related papers  (2025-11-12T00:04:53Z)
• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• Understanding and Estimating the Execution Time of Quantum Programs [7.972186774307552]
  We study the characteristics of quantum programs' runtime on simulators and real quantum computers. We introduce an innovative method that employs a graph transformer-based model to estimate their execution time. Our approach can be integrated into quantum computing platforms to provide an accurate estimation of quantum execution time.
  arXiv  Detail & Related papers  (2024-11-23T19:02:10Z)
• Quantum Computing for Automotive Applications: From Algorithms to Applications [1.99539571295432]
  This chapter investigates state-of-the-art quantum algorithms to enhance efficiency, accuracy, and scalability across the automotive value chain. We identify and discuss key challenges in near-term and fault-tolerant algorithms and their practical use in industrial applications.
  arXiv  Detail & Related papers  (2024-09-21T16:03:23Z)
• 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)
• 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)
• Utilizing Resource Estimation for the Development of Quantum Computing Applications [4.726372592887009]
  We show how to utilize Resource Estimation to improve the development and assessment of real-world quantum computing applications. Overall, this enables end-users already today to check out the promises of possible future quantum computing applications.
  arXiv  Detail & Related papers  (2024-02-19T19:00:01Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Assessing requirements to scale to practical quantum advantage [56.22441723982983]
  We develop a framework for quantum resource estimation, abstracting the layers of the stack, to estimate resources required for large-scale quantum applications. We assess three scaled quantum applications and find that hundreds of thousands to millions of physical qubits are needed to achieve practical quantum advantage. A goal of our work is to accelerate progress towards practical quantum advantage by enabling the broader community to explore design choices across the stack.
  arXiv  Detail & Related papers  (2022-11-14T18:50:27Z)
• Stochastic Qubit Resource Allocation for Quantum Cloud Computing [66.97282014860265]
  In quantum cloud computing, quantum cloud providers provision quantum resources in reservation and on-demand plans for users. We propose a quantum resource allocation for the quantum cloud computing system in which quantum resources and the minimum waiting time of quantum circuits are jointly optimized.
  arXiv  Detail & Related papers  (2022-10-22T04:13:24Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Reducing runtime and error in VQE using deeper and noisier quantum circuits [0.0]
  A core of many quantum algorithms including VQE, can be improved in terms of precision and accuracy by using a technique we call Robust Amplitude Estimation. By using deeper, and therefore more error-prone, quantum circuits, we realize more accurate quantum computations in less time. This technique may be used to speed up quantum computations into the regime of early fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2021-10-20T17:11:29Z)
• Prospects and challenges of quantum finance [5.545791216381869]
  We consider quantum speedups for Monte Carlo methods, portfolio optimization, and machine learning. The near-term relevance of these quantum finance algorithms varies widely across applications. We describe powerful ways to bring these speedups closer to experimental feasibility.
  arXiv  Detail & Related papers  (2020-11-12T17:02:11Z)

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.