Abstract Quantum computing promises breakthroughs in various application areas, such as machine learning, chemistry, or simulations. However, today’s quantum computers are error‐prone and have limited capabilities. This leads to various challenges when developing and executing quantum algorithms, for example, the mitigation of occurring errors or the selection of a suitable quantum computer to execute a certain quantum circuit. To address these challenges, detailed information about the quantum circuit to be executed as well as past executions, and the up‐to‐date information about the available quantum computers are required. Thus, this data must be continuously collected and stored in the long‐term, which is currently not supported. To overcome this problem, a provenance approach is introduced for quantum computing. Therefore, relevant provenance attributes that should be gathered in the area of quantum computing are identified. Furthermore, QProv, a provenance system that automatically collects the identified provenance attributes and provides them in a uniform manner to the user is introduced. Finally, a case study with the collected provenance data and corresponding use cases that can benefit from this provenance data are presented here.
Abstract Quantum computing promises breakthroughs in various application areas, such as machine learning, chemistry, or simulations. However, today’s quantum computers are error‐prone and have limited capabilities. This leads to various challenges when developing and executing quantum algorithms, for example, the mitigation of occurring errors or the selection of a suitable quantum computer to execute a certain quantum circuit. To address these challenges, detailed information about the quantum circuit to be executed as well as past executions, and the up‐to‐date information about the available quantum computers are required. Thus, this data must be continuously collected and stored in the long‐term, which is currently not supported. To overcome this problem, a provenance approach is introduced for quantum computing. Therefore, relevant provenance attributes that should be gathered in the area of quantum computing are identified. Furthermore, QProv, a provenance system that automatically collects the identified provenance attributes and provides them in a uniform manner to the user is introduced. Finally, a case study with the collected provenance data and corresponding use cases that can benefit from this provenance data are presented here.
Quantum computing has been proven to excel in factorization issues and unordered search problems due to its capability of quantum parallelism. This unique feature allows exponential speed-up in solving certain problems. However, this advantage does not apply universally, and challenges arise when combining classical and quantum computing to achieve acceleration in computation speed. This paper aims to address these challenges by exploring the current state of quantum machine learning and benchmarking the performance of quantum and classical algorithms in terms of accuracy. Specifically, we conducted experiments with three datasets for binary classification, implementing Support Vector Machine (SVM) and Quantum SVM (QSVM) algorithms. Our findings suggest that the QSVM algorithm outperforms classical SVM on complex datasets, and the performance gap between quantum and classical models increases with dataset complexity, as simple models tend to overfit with complex datasets. While there is still a long way to go in terms of developing quantum hardware with sufficient resources, quantum machine learning holds great potential in areas such as unsupervised learning and generative models. Moving forward, more efforts are needed to explore new quantum learning models that can leverage the power of quantum mechanics to overcome the limitations of classical machine learning.
Quantum computing and machine learning (ML) are converging to form a new paradigm in computational science, offering transformative capabilities in data processing, optimization, and pattern recognition. Quantum systems leveraging superposition, entanglement, and parallelism enable theoretical speedups for complex ML tasks that challenge classical architectures. Emerging quantum algorithms, such as quantum support vector machines (QSVMs), quantum principal component analysis (QPCA), and variational quantum circuits (VQCs), show promise for addressing high-dimensional, computationally intensive problems. Despite current limitations posed by noisy qubits, limited coherence times, and data encoding constraints, progress is accelerating. Hybrid quantum–classical models, noise-resilient techniques, and expanding quantum cloud infrastructures are enhancing the practical reach of quantum machine learning (QML). Applications in molecular modeling, optimization, and cybersecurity are among the early areas showing tangible potential. With the eventual advent of fault–tolerant quantum processors, QML could enable breakthroughs across disciplines, from drug discovery and materials science to next-generation artificial intelligence (AI). As the volume and complexity of data continue to grow, QML is positioned to redefine the future of intelligent computation.
Abstract Quantum computing represents a groundbreaking technological advancement that can tackle problems beyond traditional computers’ reach. This innovative approach leverages quantum mechanical principles to execute computations in ways that surpass the capabilities of conventional computing systems. In theory, certain computation tasks can be completed exponentially quicker on quantum machines compared to their classical counterparts. This article provides a comprehensive examination of the rapidly advancing quantum computing approaches, encompassing recent developments in quantum hardware, programming languages, algorithmic methods, error mitigation techniques, and practical applications across various fields, including cryptography, sensing, and simulation. The study examines how quantum computers may potentially drive breakthroughs in various fields, including medicine, materials science, and artificial intelligence. Additionally, it addresses the obstacles that must be overcome to fully realise the transformative potential of this cuttingedge computing paradigm.
Quantum computing represents a groundbreaking technological advancement that can tackle problems beyond traditional computers’ reach. This innovative approach leverages quantum mechanical principles to execute computations in ways that surpass the capabilities of conventional computing systems. In theory, certain computation tasks can be completed exponentially quicker on quantum machines compared to their classical counterparts. This article provides a comprehensive examination of the rapidly advancing quantum computing approaches, encompassing recent developments in quantum hardware, programming languages, algorithmic methods, error mitigation techniques, and practical applications across various fields, including cryptography, sensing, and simulation. The study examines how quantum computers may potentially drive breakthroughs in various fields, including medicine, materials science, and artificial intelligence. Additionally, it addresses the obstacles that must be overcome to fully realise the transformative potential of this cutting-edge computing paradigm.
Understanding the effectiveness of quantum compilation techniques requires visibility into the entire transpilation process, not just the final circuit metrics. This demonstration presents an MLflow-inspired autologging framework for Qiskit that automatically captures compiler provenance, including transpilation stages, pass-level execution data, backend characteristics, compiler configuration, and execution results. The framework extends the QProv provenance model with compiler-specific information and stores the collected data in an MLflow Tracking Server for analysis and visualization. By eliminating manual instrumentation, the proposed approach improves compiler observability and supports reproducible evaluation of quantum compilation workflows.
Quantum computing as emerging technology raises high expectations to accelerate complicated calculations, superseding capabilities of presently available supercomputers and to provide a solution to the ever-increasing challenge of processing big amount of data. Besides theoretical promises, quantum computers have successfully been realized in experimental settings during the past few years, and can now also be accessed commercially. Given this availability of quantum computers, their application potential can be scrutinized. Promised to lead to disruptive changes in addressing and solving problems from the domains of simulation, optimization and machine learning, quantum computers have been researched in context of many application scenarios in industrial and academic setting in the recent years. However, it turns out that currently available quantum computers are still to small in size and limited in quality to fulfill the high hopes set in them at the moment. This review reflects on the current state of the technology coming from the perspective of the application, and indicates the developments required on hardware, software and algorithmic side to eventually make quantum computing beneficial for applications.