Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Engineering quantum computing technologies: from compact modelling to applications

Giovanni Amedeo Cirillo

Published Jul 22, 2022• 0 citations
OpenAlex

Abstract

Quantum computing could impact Society and Industry in an unprecedented way, especially in critical domains, such as optimization problem solving, computational chemistry and artificial intelligence.Properties of quantum mechanics, such as superposition and entanglement, can be exploited to define problem-specific quantum algorithms with lower computational complexity than their best corresponding classical counterparts.A common limitation of quantum computers is the presence of hardware non-idealities, such as decoherence, dramatically affecting performance and reliability.In any case, efforts in improving hardware and investigating short and long-term quantum algorithms can be already done.The goal of this doctorate thesis is to explore different levels of quantum computing engineering, from devices to applications.In particular, the attention was focused on two activities: the definition of a compact-model-based simulation methodology for quantum technologies for the general-purpose quantum circuit model and the proposal of an approach for solving the users scheduling optimization problem in Joint-Transmission-based wireless communication systems, exploiting the quantumcompliant Quadratic Unconstrained Binary Optimization (QUBO) formalism.Classical simulation of quantum computers allows a preliminary estimation of their capabilities in specific applications.Canonical simulation of qubits affected by non-ideality phenomena requires solving the computationally expensive Lindblad master equation.A compact model of a quantum technology, obtained through fitting operations or specific mimic algorithms, is thought to describe qubits evolution under quantum gates, taking into account the device-characteristic physical parameters and not numerically solving Lindblad equation, thus permitting faster and more scalable simulations.Compact models of two families of spin-based molecular quantum computers, switch-based and Nuclear Magnetic Resonance, were developed, both involving two other general non-ideality models: decoherence and off-resonance of untargeted qubits.A quantum circuits simulator, involving all these compact models and interfaceable with OpenQASM 2.0 language, was entirely developed in MATLAB.The compact model approximations were compared with either results already available in the state of art or through numerical simulations with consolidated formalisms, at both Hamiltonian and circuit levels.The achieved results give evidence that the proposed simulation methodology provides iii results fast and close to the references, thus paving the way for fast and reliable technology-dependent quantum circuits simulation.Joint Transmission (JT) is a modern mechanism for Multiple-Input-Multiple-Output (MIMO) wireless communication systems, where multiple antennas co-operate to transmit signals to users with minimized interference.An optimization problem, looking for the best users subset servable in JT, can be defined.In a practical scenario, this cannot be efficiently solved with a brute-force-only approach, since it could imply a too high number of combinations.This thesis presents a strategy for solving the JT optimization problem, based on a QUBO model, which is responsible of a first selection of users among all available.The subset selected with QUBO is then brute-force explored, to find the best solution.In all executed tests, the obtained results permit to say that the proposed method achieves a quite good compromise between solution quality and total execution time.Even though the obtained results in both contexts can still be further expanded and improved, they are quite encouraging and prove that these research activities, if continued in the future, can help in improving quantum computing engineering, at both hardware and software levels, with the hope that it can concretely solve problems of interest for Society and Industry. Part I Introductory chapters 1 BackgroundIn this first section, an intuitive description of the main actors of quantum computing is provieded, with a historical timeline with the milestones of this computational paradigm.

Related papers

Exploring Quantum Computing for Solving Complex Engineering Problems

Raghav Agarwal

Quantum computing has emerged as a transformative paradigm, leveraging principles of quantum mechanics to tackle computationally intractable problems. This manuscript explores the potential of quantum computing for solving complex engineering problems—specifically optimization, simulation, and data analysis tasks—using technologies and methodologies available up to 2022. We examine both gate-based and quantum annealing approaches, outline experimental frameworks, and compare performance against classical counterparts. Results from simulated benchmark problems demonstrate promising speedups in select cases, though practical adoption is constrained by hardware limitations such as qubit coherence times and noise. The study concludes by highlighting avenues for integrating hybrid quantum-classical workflows in engineering, along with a discussion of current constraints and future directions. Over the past decade, research efforts have focused on understanding how quantum phenomena like superposition and entanglement can be harnessed to realize computational advantages for specific problem classes. In particular, combinatorial optimization problems—ubiquitous in engineering design and logistics—offer fertile ground for quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing. Additionally, quantum simulation techniques, including the Variational Quantum Eigensolver (VQE), promise to accelerate the modeling of physical systems at the molecular and materials level, potentially informing the design of next-generation structural and functional materials. Beyond raw algorithmic performance, this paper carefully assesses the end‑to‑end workflow, accounting for overheads in problem encoding, error mitigation, and classical post‑processing. We also present a detailed analysis of resource utilization—quantified by qubit counts, circuit depths, and annealing schedules—highlighting trade‑offs between solution quality and execution time. Ultimately, our findings underscore that, while pure quantum speedups remain rare in 2022, hybrid approaches harnessing both quantum and classical resources can yield practical benefits for small‑to‑medium scale engineering tasks. This expanded evaluation provides a roadmap for researchers and practitioners interested in applying quantum computing to real‑world engineering challenges.

International Journal of Research in Modern Engineering & Emerging Technology•Dec 1, 2022•1 citation

Advances in Modeling of Noisy Quantum Computers: Spin Qubits in Semiconductor Quantum Dots

Davide Costa, Mario Simoni, Gianluca Piccinini +1 more

The new quantum era is expected to have an unprecedented social impact, enabling the research of tomorrow in several pivotal fields. These perspectives require a physical system able to encode, process and store for a sufficiently long amount of time the quantum information. However, the optimal engineering of currently available quantum computers, which are small and flawed by several non-ideal phenomena, requires an efficacious methodology for exploring the design space. Hence, there is an unmet need for the development of reliable hardware-aware simulation infrastructures able to efficiently emulate the behaviour of quantum hardware that commits to looking for innovative systematic ways, with a bottom-up approach starting from the physical level, moving to the device level and up to the system level. This article discusses the development of a classical simulation infrastructure for semiconductor quantum-dot quantum computation based on compact models, where each device is described in terms of the main physical parameters affecting its performance in a sufficiently easy way from a computational point of view for providing accurate results without involving sophisticated physical simulators, thus reducing the requirements on CPU and memory. The effectiveness of the involved approximations is tested on a benchmark of quantum circuits — in the expected operating ranges of quantum hardware — by comparing the corresponding outcomes with those obtained via numeric integration of the Schrödinger equation. The achieved results give evidence that this work is a step forward towards the definition of a classical simulator of quantum computers.

IEEE Access•Jan 1, 2023•8 citations

Towards Compact Modeling of Noisy Quantum Computers: A Molecular-Spin-Qubit Case of Study

Mario Cignoni, Giovanni Amedeo Cirillo, Giovanna Turvani +2 more

Classical simulation of Noisy Intermediate Scale Quantum computers is a crucial task for testing the expected performance of real hardware. The standard approach, based on solving Schrödinger and Lindblad equations, is demanding when scaling the number of qubits in terms of both execution time and memory. In this article, attempts in defining compact models for the simulation of quantum hardware are proposed, ensuring results close to those obtained with standard formalism. Molecular Nuclear Magnetic Resonance quantum hardware is the target technology, where three non-ideality phenomena—common to other quantum technologies—are taken into account: decoherence, off-resonance qubit evolution, and undesired qubit-qubit residual interaction. A model for each non-ideality phenomenon is embedded into a MATLAB simulation infrastructure of noisy quantum computers. The accuracy of the models is tested on a benchmark of quantum circuits, in the expected operating ranges of quantum hardware. The corresponding outcomes are compared with those obtained via numeric integration of the Schrödinger equation and the Qiskit’s QASMSimulator. The achieved results give evidence that this work is a step forward towards the definition of compact models able to provide fast results close to those obtained with the traditional physical simulation strategies, thus paving the way for their integration into a classical simulator of quantum computers.

ACM Journal on Emerging Technologies in Computing Systems•Sep 29, 2021•6 citations

Enabling large-scale digital quantum simulations with superconducting qubits

Laurin E. Fischer

Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.

quant-pharXiv:2602.04719•Feb 5, 2026•1 citation

DEVELOPMENT OF ALGORITHMS AND SIMULATIONS FOR QUANTUM COMPUTERS AND THEIR POTENTIAL APPLICATIONS IN SOLVING QUANTUM PROBLEMS

K. Sabeeh, Gul Rahman

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.

•Dec 1, 2025•0 citations

Scalable Quantum Algorithms for Noisy Quantum Computers

Julien Gacon

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.

arXiv:2403.00940•Jan 1, 2024•7 citations
Quantum computing could impact Society and Industry in an unprecedented way, especially in critical domains, such as optimization problem solving, computational chemistry and artificial intelligence.Properties of quantum mechanics, such as superposition and entanglement, can be exploited to define problem-specific quantum algorithms with lower computational complexity than their best corresponding classical counterparts.A common limitation of quantum computers is the presence of hardware non-idealities, such as decoherence, dramatically affecting performance and reliability.In any case, efforts in improving hardware and investigating short and long-term quantum algorithms can be already done.The goal of this doctorate thesis is to explore different levels of quantum computing engineering, from devices to applications.In particular, the attention was focused on two activities: the definition of a compact-model-based simulation methodology for quantum technologies for the general-purpose quantum circuit model and the proposal of an approach for solving the users scheduling optimization problem in Joint-Transmission-based wireless communication systems, exploiting the quantumcompliant Quadratic Unconstrained Binary Optimization (QUBO) formalism.Classical simulation of quantum computers allows a preliminary estimation of their capabilities in specific applications.Canonical simulation of qubits affected by non-ideality phenomena requires solving the computationally expensive Lindblad master equation.A compact model of a quantum technology, obtained through fitting operations or specific mimic algorithms, is thought to describe qubits evolution under quantum gates, taking into account the device-characteristic physical parameters and not numerically solving Lindblad equation, thus permitting faster and more scalable simulations.Compact models of two families of spin-based molecular quantum computers, switch-based and Nuclear Magnetic Resonance, were developed, both involving two other general non-ideality models: decoherence and off-resonance of untargeted qubits.A quantum circuits simulator, involving all these compact models and interfaceable with OpenQASM 2.0 language, was entirely developed in MATLAB.The compact model approximations were compared with either results already available in the state of art or through numerical simulations with consolidated formalisms, at both Hamiltonian and circuit levels.The achieved results give evidence that the proposed simulation methodology provides iii results fast and close to the references, thus paving the way for fast and reliable technology-dependent quantum circuits simulation.Joint Transmission (JT) is a modern mechanism for Multiple-Input-Multiple-Output (MIMO) wireless communication systems, where multiple antennas co-operate to transmit signals to users with minimized interference.An optimization problem, looking for the best users subset servable in JT, can be defined.In a practical scenario, this cannot be efficiently solved with a brute-force-only approach, since it could imply a too high number of combinations.This thesis presents a strategy for solving the JT optimization problem, based on a QUBO model, which is responsible of a first selection of users among all available.The subset selected with QUBO is then brute-force explored, to find the best solution.In all executed tests, the obtained results permit to say that the proposed method achieves a quite good compromise between solution quality and total execution time.Even though the obtained results in both contexts can still be further expanded and improved, they are quite encouraging and prove that these research activities, if continued in the future, can help in improving quantum computing engineering, at both hardware and software levels, with the hope that it can concretely solve problems of interest for Society and Industry. Part I Introductory chapters 1 BackgroundIn this first section, an intuitive description of the main actors of quantum computing is provieded, with a historical timeline with the milestones of this computational paradigm.
Quantum computing has emerged as a transformative paradigm, leveraging principles of quantum mechanics to tackle computationally intractable problems. This manuscript explores the potential of quantum computing for solving complex engineering problems—specifically optimization, simulation, and data analysis tasks—using technologies and methodologies available up to 2022. We examine both gate-based and quantum annealing approaches, outline experimental frameworks, and compare performance against classical counterparts. Results from simulated benchmark problems demonstrate promising speedups in select cases, though practical adoption is constrained by hardware limitations such as qubit coherence times and noise. The study concludes by highlighting avenues for integrating hybrid quantum-classical workflows in engineering, along with a discussion of current constraints and future directions. Over the past decade, research efforts have focused on understanding how quantum phenomena like superposition and entanglement can be harnessed to realize computational advantages for specific problem classes. In particular, combinatorial optimization problems—ubiquitous in engineering design and logistics—offer fertile ground for quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing. Additionally, quantum simulation techniques, including the Variational Quantum Eigensolver (VQE), promise to accelerate the modeling of physical systems at the molecular and materials level, potentially informing the design of next-generation structural and functional materials. Beyond raw algorithmic performance, this paper carefully assesses the end‑to‑end workflow, accounting for overheads in problem encoding, error mitigation, and classical post‑processing. We also present a detailed analysis of resource utilization—quantified by qubit counts, circuit depths, and annealing schedules—highlighting trade‑offs between solution quality and execution time. Ultimately, our findings underscore that, while pure quantum speedups remain rare in 2022, hybrid approaches harnessing both quantum and classical resources can yield practical benefits for small‑to‑medium scale engineering tasks. This expanded evaluation provides a roadmap for researchers and practitioners interested in applying quantum computing to real‑world engineering challenges.
The new quantum era is expected to have an unprecedented social impact, enabling the research of tomorrow in several pivotal fields. These perspectives require a physical system able to encode, process and store for a sufficiently long amount of time the quantum information. However, the optimal engineering of currently available quantum computers, which are small and flawed by several non-ideal phenomena, requires an efficacious methodology for exploring the design space. Hence, there is an unmet need for the development of reliable hardware-aware simulation infrastructures able to efficiently emulate the behaviour of quantum hardware that commits to looking for innovative systematic ways, with a bottom-up approach starting from the physical level, moving to the device level and up to the system level. This article discusses the development of a classical simulation infrastructure for semiconductor quantum-dot quantum computation based on compact models, where each device is described in terms of the main physical parameters affecting its performance in a sufficiently easy way from a computational point of view for providing accurate results without involving sophisticated physical simulators, thus reducing the requirements on CPU and memory. The effectiveness of the involved approximations is tested on a benchmark of quantum circuits — in the expected operating ranges of quantum hardware — by comparing the corresponding outcomes with those obtained via numeric integration of the Schrödinger equation. The achieved results give evidence that this work is a step forward towards the definition of a classical simulator of quantum computers.
Classical simulation of Noisy Intermediate Scale Quantum computers is a crucial task for testing the expected performance of real hardware. The standard approach, based on solving Schrödinger and Lindblad equations, is demanding when scaling the number of qubits in terms of both execution time and memory. In this article, attempts in defining compact models for the simulation of quantum hardware are proposed, ensuring results close to those obtained with standard formalism. Molecular Nuclear Magnetic Resonance quantum hardware is the target technology, where three non-ideality phenomena—common to other quantum technologies—are taken into account: decoherence, off-resonance qubit evolution, and undesired qubit-qubit residual interaction. A model for each non-ideality phenomenon is embedded into a MATLAB simulation infrastructure of noisy quantum computers. The accuracy of the models is tested on a benchmark of quantum circuits, in the expected operating ranges of quantum hardware. The corresponding outcomes are compared with those obtained via numeric integration of the Schrödinger equation and the Qiskit’s QASMSimulator. The achieved results give evidence that this work is a step forward towards the definition of compact models able to provide fast results close to those obtained with the traditional physical simulation strategies, thus paving the way for their integration into a classical simulator of quantum computers.
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.
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 not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.