Towards an Automated Framework for Realizing Quantum Computing Solutions

• URL: http://arxiv.org/abs/2210.14928v1
• Date: Wed, 26 Oct 2022 18:00:01 GMT
• Title: Towards an Automated Framework for Realizing Quantum Computing Solutions
• Authors: Nils Quetschlich, Lukas Burgholzer, Robert Wille
• Abstract summary: We envision a framework that allows users to employ quantum computing solutions in an automatic fashion. We provide proof-of-concept implementations for two different classes of problems which are publicly available on GitHub.
• Score: 3.610459670994051
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing is fast evolving as a technology due to recent advances in hardware, software, as well as the development of promising applications. To use this technology for solving specific problems, a suitable quantum algorithm has to be determined, the problem has to be encoded in a form suitable for the chosen algorithm, it has to be executed, and the result has to be decoded. To date, each of these tedious and error-prone steps is conducted in a mostly manual fashion. This creates a high entry barrier for using quantum computing -- especially for users with little to no expertise in that domain. In this work, we envision a framework that aims to lower this entry barrier by allowing users to employ quantum computing solutions in an automatic fashion. To this end, interfaces as similar as possible to classical solvers are provided, while the quantum steps of the workflow are shielded from the user as much as possible by a fully automated backend. To demonstrate the feasibility and usability of such a framework, we provide proof-of-concept implementations for two different classes of problems which are publicly available on GitHub (https://github.com/cda-tum/MQTProblemSolver). By this, this work provides the foundation for a low-threshold approach of realizing quantum computing solutions with no or only moderate expertise in this technology.

Related papers

• Hybrid Meta-Solving for Practical Quantum Computing [0.0]
  This paper works towards the creation of an accessible hybrid software stack for solving optimization problems. We introduce a novel approach that we call Hybrid Meta-Solving, which combines classical and quantum optimization techniques.
  arXiv  Detail & Related papers  (2024-05-15T06:19:39Z)
• A Framework to Formulate Pathfinding Problems for Quantum Computing [2.9723999564214267]
  We propose a framework to automatically generate QUBO formulations for pathfinding problems. It supports three different encoding schemes that can easily be compared without requiring manual reformulation efforts. The resulting QUBO formulations are robust and efficient, reducing the previously tedious and error-prone reformulation process.
  arXiv  Detail & Related papers  (2024-04-16T18:00:06Z)
• 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)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19: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)
• Variational Quantum Algorithms for Computational Fluid Dynamics [0.0]
  Variational quantum algorithms are particularly promising since they are comparatively noise tolerant. We show how variational quantum algorithms can be utilized in computational fluid dynamics. We argue that a quantum advantage over classical computing methods could be achieved by the end of this decade.
  arXiv  Detail & Related papers  (2022-09-11T18:49:22Z)
• Using the Parameterized Quantum Circuit combined with Variational-Quantum-Eigensolver (VQE) to create an Intelligent social workers' schedule problem solver [0.0]
  We propose an adaptive and intelligence solution, which efficiently recalculates the schedules of social workers. The quantum feasibility of the algorithm will be modelled with docplex and tested on IBMQ computers.
  arXiv  Detail & Related papers  (2020-10-12T17:14:37Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.