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

ACM SIGPLAN Notices

Quantum Computing is Getting Real: Architecture, PL, and OS Roles in Closing the Gap between Quantum Algorithms and Machines

Frederic T. Chong

Published Mar 19, 2018• 0 citations
Publisher

Abstract

Quantum computing is at an inflection point, where 50-qubit (quantum bit) machines have been built, 100-qubit machines are just around the corner, and even 1000-qubit machines are perhaps only a few years away. These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation. Yet a significant resource gap remains between practical quantum algorithms and real machines. There is an urgent shortage of the necessary computer scientists to work on software and architectures to close this gap. I will outline several grand research challenges in closing this gap, including programming language design, software and hardware verification, defining and perforating abstraction boundaries, cross-layer optimization, managing parallelism and communication, mapping and scheduling computations, reducing control complexity, machine-specific optimizations, learning error patterns, and many more. I will also describe the resources and infrastructure available for starting research in quantum computing and for tackling these challenges.

DOI
10.1145/3296957.3177152

Related papers

Final Program

Quantum computing is at an inflection point, where 127-qubit (quantum bit) machines are deployed, and 1000-qubit machines are perhaps only a few years away.These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation.Yet a significant resource gap remains between practical quantum algorithms and real machines.A promising approach to closing this gap is to design architectural interfaces that selectively expose to programming languages and compilers some of the key physical properties of emerging quantum technologies.I will describe some of our recent work that focuses on techniques that break traditional abstractions, including compiling programs directly to analog control pulses, adapting programs for machine variations, computing with ternary quantum bits, efficient error correction using 2.5D structures, and designing just enough tunability in qubits to avoid crosstalk.

IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS)•Apr 20, 2022•0 citations

Keynote 1

Quantum computing is at an inflection point, where 53-qubit (quantum bit) machines are deployed, 100qubit machines are just around the corner, and even 1000-qubit machines are perhaps only a few years away.These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation.Yet a significant resource gap remains between practical quantum algorithms and real machines.A promising approach to closing this gap is to selectively expose to programming languages and compilers some of the key physical properties of emerging quantum technologies.I will describe some of our recent work that focuses on compilation techniques that break traditional abstractions, including compiling directly to analog control pulses, compiling for machine variations, and compiling with ternary quantum bits.

IEEE International Conference on Rebooting Computing (ICRC)•Nov 1, 2021•0 citations

Closing the Gap between Quantum Algorithms and Machines with Hardware-Software Co-Design

Frederic T. Chong

Quantum computing is at an inflection point, where 127-qubit machines are deployed, and 1000-qubit machines are only a few years away. These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation.

ACM Great Lakes Symposium on VLSI (GLSVLSI)•May 31, 2023•0 citations

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

Masoud Mohseni, Artur Scherer, Katherine Grace Johnson +48 more

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits. Nevertheless, there are significant outstanding challenges in quantum hardware, fabrication, software architecture, and algorithms on the path towards a full-stack scalable quantum computing technology. Here, we provide a comprehensive review of these scaling challenges. We show how to facilitate scaling by adopting existing semiconductor technology to build much higher-quality qubits, employing systems engineering approaches, and performing distributed heterogeneous quantum-classical computing. We provide a detailed resource and sensitivity analysis for quantum applications on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. We provide comprehensive resource estimates for several utility-scale applications including quantum chemistry calculations, catalyst design, NMR spectroscopy, and Fermi-Hubbard simulation. We show that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration. Furthermore, we introduce high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical optimization, machine learning, and quantum simulation tasks in a cost-effective manner.

arXiv:2411.10406•Nov 15, 2024•206 citations

A Comprehensive Survey of Quantum Computing: Principles, Progress, and Prospects for Classical-Quantum Integration

Linnea Whitlow

Quantum computing, grounded in the principles of superposition and entanglement, has emerged as a revolutionary paradigm with the potential to outperform classical systems in specific computational tasks. This paper presents a comprehensive survey of the foundational concepts, algorithmic developments, hardware architectures, and programming ecosystems in quantum computing. We analyze the current progress in key application areas such as cryptography, machine learning, optimization, and quantum chemistry. Furthermore, we review recent advances between 2023 and 2025, including developments in fault-tolerant architectures and quantum error correction. The paper also discusses the significant technical challenges that hinder large-scale practical deployment, including qubit scalability, decoherence, and programming limitations. By synthesizing literature across disciplines, this review aims to provide a holistic understanding of the quantum computing landscape and outline critical directions for future research and integration with classical systems.

Journal of Computer Science and Software Applications•Jun 2, 2025•0 citations

QUANTUM COMPUTING: THEORETICAL FOUNDATIONS AND RESEARCH GAPS

Betshrine Rachel Jibinsingh, Dr. Anisha Isaac

Quantum computing has emerged as a revolutionary paradigm that harnesses the principles of quantum mechanics, such as superposition, entanglement, and quantum interference, to solve problems that are intractable for classical computers. The theoretical foundations of quantum computing lie in quantum information theory, quantum algorithms, and computational complexity, providing a framework for understanding the potential and limitations of quantum systems. Despite remarkable advancements in quantum hardware and algorithmic design, significant research gaps remain. Challenges such as quantum error correction, scalability of qubit architectures, coherence time enhancement, and the development of universal fault-tolerant quantum computers hinder practical implementation. Furthermore, there is a pressing need to bridge the gap between theoretical algorithmic models and real-world applications, particularly in cryptography, optimization, material science, and machine learning. This paper aims to synthesize the theoretical underpinnings of quantum computing while highlighting the key areas where further research is required to unlock its full potential.

•Jan 1, 2022•0 citations
Quantum computing is at an inflection point, where 50-qubit (quantum bit) machines have been built, 100-qubit machines are just around the corner, and even 1000-qubit machines are perhaps only a few years away. These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation. Yet a significant resource gap remains between practical quantum algorithms and real machines. There is an urgent shortage of the necessary computer scientists to work on software and architectures to close this gap. I will outline several grand research challenges in closing this gap, including programming language design, software and hardware verification, defining and perforating abstraction boundaries, cross-layer optimization, managing parallelism and communication, mapping and scheduling computations, reducing control complexity, machine-specific optimizations, learning error patterns, and many more. I will also describe the resources and infrastructure available for starting research in quantum computing and for tackling these challenges.
Quantum computing is at an inflection point, where 127-qubit (quantum bit) machines are deployed, and 1000-qubit machines are perhaps only a few years away.These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation.Yet a significant resource gap remains between practical quantum algorithms and real machines.A promising approach to closing this gap is to design architectural interfaces that selectively expose to programming languages and compilers some of the key physical properties of emerging quantum technologies.I will describe some of our recent work that focuses on techniques that break traditional abstractions, including compiling programs directly to analog control pulses, adapting programs for machine variations, computing with ternary quantum bits, efficient error correction using 2.5D structures, and designing just enough tunability in qubits to avoid crosstalk.
Quantum computing is at an inflection point, where 53-qubit (quantum bit) machines are deployed, 100qubit machines are just around the corner, and even 1000-qubit machines are perhaps only a few years away.These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation.Yet a significant resource gap remains between practical quantum algorithms and real machines.A promising approach to closing this gap is to selectively expose to programming languages and compilers some of the key physical properties of emerging quantum technologies.I will describe some of our recent work that focuses on compilation techniques that break traditional abstractions, including compiling directly to analog control pulses, compiling for machine variations, and compiling with ternary quantum bits.
In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits. Nevertheless, there are significant outstanding challenges in quantum hardware, fabrication, software architecture, and algorithms on the path towards a full-stack scalable quantum computing technology. Here, we provide a comprehensive review of these scaling challenges. We show how to facilitate scaling by adopting existing semiconductor technology to build much higher-quality qubits, employing systems engineering approaches, and performing distributed heterogeneous quantum-classical computing. We provide a detailed resource and sensitivity analysis for quantum applications on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. We provide comprehensive resource estimates for several utility-scale applications including quantum chemistry calculations, catalyst design, NMR spectroscopy, and Fermi-Hubbard simulation. We show that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration. Furthermore, we introduce high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical optimization, machine learning, and quantum simulation tasks in a cost-effective manner.
Quantum computing, grounded in the principles of superposition and entanglement, has emerged as a revolutionary paradigm with the potential to outperform classical systems in specific computational tasks. This paper presents a comprehensive survey of the foundational concepts, algorithmic developments, hardware architectures, and programming ecosystems in quantum computing. We analyze the current progress in key application areas such as cryptography, machine learning, optimization, and quantum chemistry. Furthermore, we review recent advances between 2023 and 2025, including developments in fault-tolerant architectures and quantum error correction. The paper also discusses the significant technical challenges that hinder large-scale practical deployment, including qubit scalability, decoherence, and programming limitations. By synthesizing literature across disciplines, this review aims to provide a holistic understanding of the quantum computing landscape and outline critical directions for future research and integration with classical systems.
Quantum computing has emerged as a revolutionary paradigm that harnesses the principles of quantum mechanics, such as superposition, entanglement, and quantum interference, to solve problems that are intractable for classical computers. The theoretical foundations of quantum computing lie in quantum information theory, quantum algorithms, and computational complexity, providing a framework for understanding the potential and limitations of quantum systems. Despite remarkable advancements in quantum hardware and algorithmic design, significant research gaps remain. Challenges such as quantum error correction, scalability of qubit architectures, coherence time enhancement, and the development of universal fault-tolerant quantum computers hinder practical implementation. Furthermore, there is a pressing need to bridge the gap between theoretical algorithmic models and real-world applications, particularly in cryptography, optimization, material science, and machine learning. This paper aims to synthesize the theoretical underpinnings of quantum computing while highlighting the key areas where further research is required to unlock its full potential.