Many applications of quantum computers require the classical and quantum implementation of dynamic systems (DSs). These applications comprise interacting quantum and classical tasks. While quantum tasks evolve in the quantum domain, classical tasks behave in the classical domain. Besides tackling these kinds of tasks, the computational gap between these domains is covered by the current study. The quantum computing feature All at Once (A@O) executions is appropriate for static systems but less for DSs. The novelty of the proposed approach consists of using Distributed Quantum-Centric Petri Net (DQCPN) models composed of quantum and high-level Petri Nets for specification, design, verification, and implementation of classical–quantum applications. Quantum Processing Units (QPUs) are linked to classical components implementing the control and optimization operations in the proposed application. Many practical applications combine quantum and classical computing to address optimization problems. Quantum computers can be built with a combination of qubits and bosonic qumodes, leading to a new paradigm toward quantum computing. The optimizations are performed by some Evolutionary Algorithms (EAs), including Particle Swarm Optimization (PSO) methods and Genetic Algorithms (GAs). For experiments, an Urban Vehicle Traffic System (UVTS) is used as an open distributed system. The vehicle flows are implemented by discrete qubits, discrete vectors of qubits, or qumodes.
Many applications of quantum computers require the classical and quantum implementation of dynamic systems (DSs). These applications comprise interacting quantum and classical tasks. While quantum tasks evolve in the quantum domain, classical tasks behave in the classical domain. Besides tackling these kinds of tasks, the computational gap between these domains is covered by the current study. The quantum computing feature All at Once (A@O) executions is appropriate for static systems but less for DSs. The novelty of the proposed approach consists of using Distributed Quantum-Centric Petri Net (DQCPN) models composed of quantum and high-level Petri Nets for specification, design, verification, and implementation of classical–quantum applications. Quantum Processing Units (QPUs) are linked to classical components implementing the control and optimization operations in the proposed application. Many practical applications combine quantum and classical computing to address optimization problems. Quantum computers can be built with a combination of qubits and bosonic qumodes, leading to a new paradigm toward quantum computing. The optimizations are performed by some Evolutionary Algorithms (EAs), including Particle Swarm Optimization (PSO) methods and Genetic Algorithms (GAs). For experiments, an Urban Vehicle Traffic System (UVTS) is used as an open distributed system. The vehicle flows are implemented by discrete qubits, discrete vectors of qubits, or qumodes.
Evolutionary systems (ES) include software applications that solve problems using heuristic methods instead of the deterministic ones. The classical computing used for ES development involves random methods to improve different kinds of genomes. The mappings of these genomes lead to individuals that correspond to the searched solutions. The individual evaluations by simulations serve for the improvement of their genotypes. Quantum computations, unlike the classical computations, can describe and simulate a large set of individuals simultaneously. This feature is used to diminish the time for finding the solutions. Quantum Petri Nets (QPNs) can model dynamical systems with probabilistic features that make them appropriate for the development of ES. Some examples of ES applications using the QPNs are given to show the benefits of the current approach. The current research solves quantum evolutionary problems using quantum genetic algorithms conceived and improved based on QPN. They were tested on a dynamic system using a Quantum Discrete Controlled Walker (QDCW).
Quantum computing has become an increasingly relevant topic in computer science due to the development of functional quantum computers in recent years. Quantum processing units (QPUs) use quantum particles in the form of qubits as information carriers. By using properties of quantum particles, quantum algorithms have been developed that can solve problems in polynomial time, for which only exponentially scaling classical algorithms are known. QPUs will not run on their own in the foreseeable future, due to high error rates and low stability of qubits. Instead, quantum devices will be one component in a quantum-classical (hybrid) computing system (distributed system). Quantum computers embedded in distributed hybrid quantum-classical systems get instructions from a main CPU, execute them and report their results. To fully utilize quantum calculations, a QPU should be able to communicate with a CPU in real-time. This means the qubits information content should stay stable during communication time. In this thesis, we will look at quantum computing systems with real-time feedback between a QPU and a CPU. As quantum computers are going to be used in real-time hybrid systems, we need optimization routines for code running on these systems. Existing works on the optimization of quantum code focus on the optimization of quantum circuits only, and neglect potential classical calculations that are necessary on a hybrid distributed system. We want to examine which kind of optimization routines are possible and sensible for hybrid quantum-classical computations. We will evaluate some of todays quantum programming languages (QPLs), especially with respect to their ability to support and optimize real-time hybrid calculations. We will find that most languages support real-time calculations to some extent, but are more adapted to the programming approach of static circuit creation. Additionally, none of the QPLs offer optimization routines targeted at quantum-classical calculations. Therefore, we will examine options for real-time quantum-classical optimization. For this, we use the low-level QPL Quil. We will introduce optimization operations and apply them to real-time quantum-classical algorithms. We will present metrics to evaluate the performance of hybrid calculations. The results of applying our optimization operations to Quil code will be evaluated against our performance metrics. We will find that we are in principle able to optimize hybrid quantum-classical programs. We encourage more research in this field. QPLs will become more abstract in the future and need more compilation steps until they can be executed on hardware. This will make the optimization of quantum-classical hybrid code more relevant.
We explore how quantum computing (QC) can advance transportation optimization, with a focus on two high-impact areas: traffic signal control and vehicle electrification with grid integration. As transportation systems grow in complexity, classical optimization methods increasingly struggle to deliver scalable and efficient solutions, particularly for real-time environments. This work identifies key challenges within these two domains where QC may offer advantages, particularly in handling combinatorial decision spaces and dynamic constraints. We begin by outlining the limitations of classical approaches for traffic signal control optimization and electric vehicle charging coordination, highlighting where computational limitations arise. Previous quantum formulations are discussed to demonstrate how emerging quantum algorithms, including quantum annealing and hybrid algorithms, could be leveraged to reformulate and address these problems. We also evaluate the suitability of current quantum hardware and discuss the advantages that QC could bring to these domains. While acknowledging the present limitations of QC technologies, this poster emphasizes the importance of preparing quantum-compatible models today. By reviewing and establishing formulations that align with the strengths of quantum algorithms, researchers and practitioners can better position themselves to take advantage of QC advancements as they occur. This work aims to provide a practical, forward-looking perspective on the near-term potential of quantum computing in transportation optimization. Quantum Computing Transportation Optimization Traffic Signal Control Electric Vehicle Charging
As we enter the post-Moore era, we experience the rise of various non-von-Neumann-architectures to address the increasing computational demand for modern applications, with quantum computing being among the most prominent and promising technologies. However, this development creates a gap in current computer science curricula since most quantum computing lectures are strongly physics-oriented and have little intersection with the remaining curriculum of computer science. This fact makes designing an appealing course very difficult, in particular for non-physicists. Furthermore, in the academic community, there is consensus that quantum computers are going to be used only for specific computational tasks (e.g., in computational science), where hybrid systems - combined classical and quantum computers - facilitate the execution of an application on both quantum and classical computing resources. A hybrid system thus executes only certain suitable parts of an application on the quantum machine, while other parts are executed on the classical components of the system. To fully exploit the capabilities of hybrid systems and to meet future requirements in this emerging field, we need to prepare a new generation of computer scientists with skills in both distributed computing and quantum computing. To bridge this existing gap in standard computer science curricula, we designed a new lecture and exercise series on Hybrid Quantum-Classical Systems, where students learn how to decompose applications and implement computational tasks on a hybrid quantum-classical computational continuum. While learning the inherent concepts underlying quantum systems, students are obligated to apply techniques and methods they are already familiar with, making the entrance to the field of quantum computing comprehensive yet appealing and accessible to students of computer science.
Quantum computing has emerged as a transformative paradigm capable of solving complex computational problems that are intractable for classical computers. Central to the advancement of this technology is the development of efficient quantum algorithms and high fidelity simulations that enable the design, testing, and optimization of quantum solutions before deployment on physical hardware. This study focuses on the design and implementation of quantum algorithms tailored for solving a variety of quantum problems, including quantum chemistry, optimization, and cryptography. Using state of the art simulation platforms such as Qiskit, Cirq, and Pennylane, algorithm performance was evaluated in terms of accuracy, execution time, scalability, and resilience to noise. Benchmarks demonstrate that algorithms such as the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) achieve significant speedups in problem specific domains, while hybrid quantum–classical methods provide robust pathways for near term quantum advantage. Simulation results reveal that algorithmic efficiency can be significantly improved through optimized circuit depth, qubit connectivity mapping, and advanced error mitigation techniques. The findings highlight the potential of simulation driven quantum algorithm development in accelerating the practical realization of quantum computing applications across disciplines such as materials discovery, molecular modeling, secure communications, and complex optimization tasks.
Quantum computing is a big change in how to do calculations, especially good for solving complex problems that are hard for traditional computers. These problems often get worse quickly as they grow bigger, making them very difficult to solve efficiently. Although quantum computers have some big advantages, they still have some issues like limited number of qubits, noise, and problems with staying stable for long periods. To deal with these problems and make the best use of both quantum and classical methods, this research proposes a new system that mixes classical methods such as Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) with quantum methods like Quantum Approximate Optimization Algorithm (QAOA) and different versions of Grover's search. [14] [15] [1] [5]The classical methods are good at finding good solutions and working reliably, while the quantum parts can help in certain tasks, like searching or improving calculations. The new system is tested on real problems in areas like logistics (like planning delivery routes), network routing (like finding the fastest paths), and job scheduling (like assigning tasks with limited resources). A way is developed to turn these problems into a form that quantum computers can understand, called QUBO. [10]The tests use real data and simulated quantum setups (like Qiskit and D-Wave Ocean SDK). The results show that this new system works better than using only classical or only quantum methods in terms of the quality of the solutions, how fast they find the answers, and how long they take. This study shows the potential of using a mix of quantum and classical methods to solve problems more effectively and sets up a foundation for future research in using quantum methods to help make better decisions. [12] [18]