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

Robust system software for quantum computing

Tirthak Patel

Published Jan 1, 2023• 0 citations
Publisher

Abstract

Despite rapid progress in quantum computing in the last decade, the limited usability of quantum computers remains a major roadblock toward its wider adoption. Current noisy intermediate-scale quantum (NISQ) computers produce highly erroneous program outputs for quantum-advantage-proven algorithms - that is, algorithms that are infeasible or orders of magnitude slower on classical supercomputing and high-performance computing (HPC) clusters. Unfortunately, currently, quantum computing programmers lack robust system software tools and methods to make meaningful use of erroneous program executions on quantum computers. This lack of capability is the core motivation behind the fundamental question this dissertation poses: "Can we build system software tools for programmers to make the quantum program execution and output meaningful on NISQ machines?" This dissertation answers this question in the affirmative - experimentally demonstrating on real-system quantum computers that it is possible to extract near-accurate program output from noisy executions on today's erroneous quantum computers, ironically using classical HPC resources and knowledge. This dissertation demonstrates how to achieve this goal without requiring user intervention, domain knowledge about quantum algorithms, or additional quantum hardware support. Unfortunately, as this dissertation uncovers, progressing toward making quantum computers usable is a double-edged sword. In the near future, only a few entities in the world may have access to powerful quantum computers, and these quantum computers will be used to solve previously-unsolved large-scale optimization problems, possibly without an explicit trust model between the service provider and the customer. Therefore, this dissertation envisions that the solutions to such large-scale optimization problems will be considered sensitive and will need to be protected. This dissertation takes the first few steps toward preparing us for that future - by developing a novel method that intelligently obfuscates near-accurate program output and quantum circuit structure to preserve a customer's privacy under a specified computation model and resource availability. The approaches introduced in this dissertation open up new research avenues for hybrid quantum-classical computing. This dissertation also aims to lower the barrier to entry for quantum computing research for the experimental computer systems and HPC community by open-sourcing multiple novel datasets and software frameworks implemented for real-system quantum computers.--Author's abstract

DOI
10.17760/d20487156

Related papers

Beyond NISQ: scalable quantum algorithms and architectures for practical quantum advantage

Dattatray Raghunath Kale, Satish Madhukar Ranbhise, Hitesh Shinde +5 more

Quantum computing has the potential to solve complex problems that are outside the scope of classical systems, making it a standard shifter. Current devices, which are considered as Noisy Intermediate-Scale Quantum (NISQ) systems, are insufficient in their practical utility due to hardware limitations, error rates, and qubit counts. The dynamic growths wanted to exceed the NISQ era and grow scalable quantum algorithms and architectures that can achieve useful quantum benefit in real-world applications are reviewed in this research. This research gives a comprehensive examination of the complications in scaling quantum systems, adjacent resource efficacy, qubit connectivity, and error correction. In addition to connecting architectural innovations like modular quantum computing, error-resilient circuit design, and distributed quantum systems, the paper provides new hybrid quantum-classical algorithms planned to exploit performance in noisy environments. Results from benchmarking in arenas like machine learning, optimization, and quantum chemistry show how these methods can provide short-term quantum benefit. Lastly, this paper proposes a research roadmap for quantum computing that highlights the requirement of co-designing algorithms, software, and hardware. The goal of this effort is to straighten the progress of quantum systems that can resolve problems in the real world at scale by addressing the inadequacies of NISQ devices and emphasizing scalable solutions.

IET conference proceedings.•Feb 1, 2026•1 citation

Software tools for quantum control: improving quantum computer performance through noise and error suppression

Harrison Ball, Michael J. Biercuk, Andre R. R. Carvalho +10 more

Abstract Effectively manipulating quantum computing (QC) hardware in the presence of imperfect devices and control systems is a central challenge in realizing useful quantum computers. Susceptibility to noise critically limits the performance and capabilities of today’s so-called noisy intermediate-scale quantum devices, as well as any future QC technologies. Fortunately, quantum control enables efficient execution of quantum logic operations and quantum algorithms with built-in robustness to errors, and without the need for complex logical encoding. In this manuscript we introduce software tools for the application and integration of quantum control in QC research, serving the needs of hardware R&D teams, algorithm developers, and end users. We provide an overview of a set of Python-based classical software tools for creating and deploying optimized quantum control solutions at various layers of the QC software stack. We describe a software architecture leveraging both high-performance distributed cloud computation and local custom integration into hardware systems, and explain how key functionality is integrable with other software packages and quantum programming languages. Our presentation includes a detailed mathematical overview of key features including a flexible optimization toolkit, engineering-inspired filter functions for analyzing noise susceptibility in high-dimensional Hilbert spaces, and new approaches to noise and hardware characterization. Pseudocode is presented in order to elucidate common programming workflows for these tasks, and performance benchmarking is reported for numerically intensive tasks, highlighting the benefits of the selected cloud-compute architecture. Finally, we present a series of case studies demonstrating the application of quantum control solutions derived from these tools in real experimental settings using both trapped-ion and superconducting quantum computer hardware.

arXiv:2001.04060•Quantum Science and Technology•Jan 18, 2021•113 citations

A foundation for quantum programming and its highly-parallel virtual execution

Yves Vandriessche

The topic of this dissertation stands at the crossroads of two emerging technologies: highly-parallel computing and quantum computing. Both seek to go beyond the limits of current computing practice: in the absence of further miniaturization, highly-parallel computing seeks to increase the available computer power substantially. Quantum Computing looks beyond the classical approach to computation, leveraging quantum-mechanical effects to increase computing power in a fundamental way. In the absence and also in the presence of actual quantum computers it is crucial to support the development of quantum computer applications by creating an appropriate software framework. Creating such a framework currently faces two major research challenges. First, one needs to separate the realization of the quantum computer from the software running on it, whether it is an actual physical or a simulated realization. Our first contribution lies with defining a layered software architecture, ranging from a design tool at the higher abstraction levels to a simulated execution layer underneath. At its core sits a ‘Quantum Virtual Machine’ using the Measurement Calculus as the underlying quantum computational model. Such a virtual machine layer makes the application developed on top of it oblivious to how it is executed. The simulated execution of this quantum virtual machine is fundamentally a computationally intensive task. Parallel computing offers a way to throw more computational resources at the problem, in the light of the saturation of sequential performance of current computers. Simulation is the domain of the second challenge, as it has very high performance requirements. The simulation problem thus becomes: how does one expose the inherent parallelism of quantum computing simulation in a fundamental way, so as to be usable for the highly-parallel computers to come? Our second contribution is to provide a formal translation of quantum programs to highly-parallel dataflow computations, and to develop a virtual environment that compiles and executes such programs. This work demonstrates several properties of both the formal as well as the virtual level of computation that validate our approach.

•Jan 1, 2012•0 citations

Optimization Verification and Engineered Reliability of Quantum Computers (OVER-QC).

Mohan Sarovar

Quantumtechnologies, especially quantum computers, show great promise for revolutionizing high-performance computing and simulation.As prototype quantum computers come online, it is becoming clear that obtaining useful output from such devices will require layers of sophisticated classical software that provide interpretation and analysis of the quantum computer's state and output.We will develop critical components in this "software stack" with a particular focus on enabling near-term Noisy Intermediate-Scale Quantum (NISQ) technologies.We have identified three critical needs for near-term quantum computing platforms, and the project is structured around three thrusts that address these needs.Application layer e.g., Abstract algorithms and interfaces with classical software.Thrust 3 Logical layer e.g., Compilation software that translates algorithms to quantum circuits.Thrust 1 Hardware layer e.g., Quantum circuit programs and hardware-level error mitigation.Thrust 2 Verification of correctness of circuit compilations New robust circuit compilations Verification of' correctness of new VHP heuristics Symmetries, influential circuit parameters New VHP heuristicsHow the project thrusts fit into the conventional picture of a quantum computing software stack, and how the outcomes of each thrust inform the other ones. Research HighlightsProveIt theorem proving assistant pv

•Jan 24, 2020•0 citations

Entangled Futures: Quantum Computing's Potential and Challenges in Computer Science

Devki Nandan Jha, Jonte R. Hance, Tomasz Szydło +3 more

Quantum computing represents a fundamental shift in computation, promising to solve problems currently intractable for classical computers. However, misconceptions persist; quantum computers are not universally faster, nor do they replace classical systems. Current Noisy Intermediate-Scale Quantum (NISQ) devices face significant challenges, including decoherence, high error rates, and limited scalability. Additionally, leveraging quantum systems requires rethinking traditional computing principles, adopting different programming models, and addressing the complexities of integrating quantum and classical workflows, making their practical use in computer science both demanding and non-trivial. This article provides a system-level perspective on quantum computing for computer scientists, software engineers, and IT professionals, examining its current capabilities, key architectural and software challenges, and potential paths toward quantum advantage in real-world applications within hybrid quantum-classical environments.

arXiv:2610.29640•Oct 21, 2026•0 citations

Noisy intermediate-scale quantum (NISQ) algorithms

Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw +11 more

A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices.

arXiv:2101.08448•Jan 21, 2021•164 citations
Despite rapid progress in quantum computing in the last decade, the limited usability of quantum computers remains a major roadblock toward its wider adoption. Current noisy intermediate-scale quantum (NISQ) computers produce highly erroneous program outputs for quantum-advantage-proven algorithms - that is, algorithms that are infeasible or orders of magnitude slower on classical supercomputing and high-performance computing (HPC) clusters. Unfortunately, currently, quantum computing programmers lack robust system software tools and methods to make meaningful use of erroneous program executions on quantum computers. This lack of capability is the core motivation behind the fundamental question this dissertation poses: "Can we build system software tools for programmers to make the quantum program execution and output meaningful on NISQ machines?" This dissertation answers this question in the affirmative - experimentally demonstrating on real-system quantum computers that it is possible to extract near-accurate program output from noisy executions on today's erroneous quantum computers, ironically using classical HPC resources and knowledge. This dissertation demonstrates how to achieve this goal without requiring user intervention, domain knowledge about quantum algorithms, or additional quantum hardware support. Unfortunately, as this dissertation uncovers, progressing toward making quantum computers usable is a double-edged sword. In the near future, only a few entities in the world may have access to powerful quantum computers, and these quantum computers will be used to solve previously-unsolved large-scale optimization problems, possibly without an explicit trust model between the service provider and the customer. Therefore, this dissertation envisions that the solutions to such large-scale optimization problems will be considered sensitive and will need to be protected. This dissertation takes the first few steps toward preparing us for that future - by developing a novel method that intelligently obfuscates near-accurate program output and quantum circuit structure to preserve a customer's privacy under a specified computation model and resource availability. The approaches introduced in this dissertation open up new research avenues for hybrid quantum-classical computing. This dissertation also aims to lower the barrier to entry for quantum computing research for the experimental computer systems and HPC community by open-sourcing multiple novel datasets and software frameworks implemented for real-system quantum computers.--Author's abstract
Quantum computing has the potential to solve complex problems that are outside the scope of classical systems, making it a standard shifter. Current devices, which are considered as Noisy Intermediate-Scale Quantum (NISQ) systems, are insufficient in their practical utility due to hardware limitations, error rates, and qubit counts. The dynamic growths wanted to exceed the NISQ era and grow scalable quantum algorithms and architectures that can achieve useful quantum benefit in real-world applications are reviewed in this research. This research gives a comprehensive examination of the complications in scaling quantum systems, adjacent resource efficacy, qubit connectivity, and error correction. In addition to connecting architectural innovations like modular quantum computing, error-resilient circuit design, and distributed quantum systems, the paper provides new hybrid quantum-classical algorithms planned to exploit performance in noisy environments. Results from benchmarking in arenas like machine learning, optimization, and quantum chemistry show how these methods can provide short-term quantum benefit. Lastly, this paper proposes a research roadmap for quantum computing that highlights the requirement of co-designing algorithms, software, and hardware. The goal of this effort is to straighten the progress of quantum systems that can resolve problems in the real world at scale by addressing the inadequacies of NISQ devices and emphasizing scalable solutions.
Abstract Effectively manipulating quantum computing (QC) hardware in the presence of imperfect devices and control systems is a central challenge in realizing useful quantum computers. Susceptibility to noise critically limits the performance and capabilities of today’s so-called noisy intermediate-scale quantum devices, as well as any future QC technologies. Fortunately, quantum control enables efficient execution of quantum logic operations and quantum algorithms with built-in robustness to errors, and without the need for complex logical encoding. In this manuscript we introduce software tools for the application and integration of quantum control in QC research, serving the needs of hardware R&D teams, algorithm developers, and end users. We provide an overview of a set of Python-based classical software tools for creating and deploying optimized quantum control solutions at various layers of the QC software stack. We describe a software architecture leveraging both high-performance distributed cloud computation and local custom integration into hardware systems, and explain how key functionality is integrable with other software packages and quantum programming languages. Our presentation includes a detailed mathematical overview of key features including a flexible optimization toolkit, engineering-inspired filter functions for analyzing noise susceptibility in high-dimensional Hilbert spaces, and new approaches to noise and hardware characterization. Pseudocode is presented in order to elucidate common programming workflows for these tasks, and performance benchmarking is reported for numerically intensive tasks, highlighting the benefits of the selected cloud-compute architecture. Finally, we present a series of case studies demonstrating the application of quantum control solutions derived from these tools in real experimental settings using both trapped-ion and superconducting quantum computer hardware.
The topic of this dissertation stands at the crossroads of two emerging technologies: highly-parallel computing and quantum computing. Both seek to go beyond the limits of current computing practice: in the absence of further miniaturization, highly-parallel computing seeks to increase the available computer power substantially. Quantum Computing looks beyond the classical approach to computation, leveraging quantum-mechanical effects to increase computing power in a fundamental way. In the absence and also in the presence of actual quantum computers it is crucial to support the development of quantum computer applications by creating an appropriate software framework. Creating such a framework currently faces two major research challenges. First, one needs to separate the realization of the quantum computer from the software running on it, whether it is an actual physical or a simulated realization. Our first contribution lies with defining a layered software architecture, ranging from a design tool at the higher abstraction levels to a simulated execution layer underneath. At its core sits a ‘Quantum Virtual Machine’ using the Measurement Calculus as the underlying quantum computational model. Such a virtual machine layer makes the application developed on top of it oblivious to how it is executed. The simulated execution of this quantum virtual machine is fundamentally a computationally intensive task. Parallel computing offers a way to throw more computational resources at the problem, in the light of the saturation of sequential performance of current computers. Simulation is the domain of the second challenge, as it has very high performance requirements. The simulation problem thus becomes: how does one expose the inherent parallelism of quantum computing simulation in a fundamental way, so as to be usable for the highly-parallel computers to come? Our second contribution is to provide a formal translation of quantum programs to highly-parallel dataflow computations, and to develop a virtual environment that compiles and executes such programs. This work demonstrates several properties of both the formal as well as the virtual level of computation that validate our approach.
Quantumtechnologies, especially quantum computers, show great promise for revolutionizing high-performance computing and simulation.As prototype quantum computers come online, it is becoming clear that obtaining useful output from such devices will require layers of sophisticated classical software that provide interpretation and analysis of the quantum computer's state and output.We will develop critical components in this "software stack" with a particular focus on enabling near-term Noisy Intermediate-Scale Quantum (NISQ) technologies.We have identified three critical needs for near-term quantum computing platforms, and the project is structured around three thrusts that address these needs.Application layer e.g., Abstract algorithms and interfaces with classical software.Thrust 3 Logical layer e.g., Compilation software that translates algorithms to quantum circuits.Thrust 1 Hardware layer e.g., Quantum circuit programs and hardware-level error mitigation.Thrust 2 Verification of correctness of circuit compilations New robust circuit compilations Verification of' correctness of new VHP heuristics Symmetries, influential circuit parameters New VHP heuristicsHow the project thrusts fit into the conventional picture of a quantum computing software stack, and how the outcomes of each thrust inform the other ones. Research HighlightsProveIt theorem proving assistant pv
Quantum computing represents a fundamental shift in computation, promising to solve problems currently intractable for classical computers. However, misconceptions persist; quantum computers are not universally faster, nor do they replace classical systems. Current Noisy Intermediate-Scale Quantum (NISQ) devices face significant challenges, including decoherence, high error rates, and limited scalability. Additionally, leveraging quantum systems requires rethinking traditional computing principles, adopting different programming models, and addressing the complexities of integrating quantum and classical workflows, making their practical use in computer science both demanding and non-trivial. This article provides a system-level perspective on quantum computing for computer scientists, software engineers, and IT professionals, examining its current capabilities, key architectural and software challenges, and potential paths toward quantum advantage in real-world applications within hybrid quantum-classical environments.
A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices.