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

IEEE Spectrum

Dialogue Concerning the Two Chief Computing Systems: Imagine yourself on a flight talking to an engineer about a scheme that straddles classical and quantum

Kerem Yunus Camsari, Supriyo Datta

Published Apr 1, 2021• 8 citations
Publisher

Abstract

Computer scientists and engineers have started down a road that could one day lead to a momentous transition: from deterministic computing systems, based on classical physics, to quantum computing systems, which exploit the weird and wacky probabilistic rules of quantum physics. Many commentators have pointed out that if engineers are able to fashion practical quantum computers, there will be a tectonic shift in the sort of computations that become possible ¶ But that's a big if. ¶ Quantum computers hold great theoretical promise, sure, but the hurdles that need to be overcome to build practical machines are enormous. Some skeptics have argued that the technical challenges are so immense that it's very unlikely that general-purpose quantum computers will become available anytime in the foreseeable future. Others, including the engineers now working very hard to build these machines at Google, IBM, Intel, and elsewhere, are more sanguine, anticipating that 5 or 10 more years of work may be enough to bring the first practical general-purpose quantum computers on line. Only time will tell. ≫

DOI
10.1109/mspec.2021.9393992

Related papers

Quantum computing's prospects: How long will it be before we see practical quantum-computing machines? - [Spectral Lines]

David A. Schneider, Susan Hassler

Our romance with new technologies always seems to follow the same trajectory: We are by turns mesmerized and adoring, disappointed and disheartened, and end up settling for less than we originally imagined. In 1954, Texas Instruments touted its new transistors as bringing "electronic “brains” approaching the human brain in scope and reliability" much closer to reality. In 2000, U.S. president Bill Clinton declared that the Human Genome Project would lead to a world in which "our children's children will know the term cancer only as a constellation of stars." And so it is now with quantum computing. ¶The popular press is awash with articles touting its promise. Tech giants are pouring huge amounts of money into building prototypes. You get the distinct impression that the computer industry is on the verge of an imminent quantum revolution. ¶But not everyone believes that quantum computing is going to solve real-world problems in anything like the time frame that some proponents of the technology want us to believe. Indeed, many of the researchers involved acknowledge the hype has gotten out of control, cautioning that quantum computing may take decades to mature. ¶Theoretical physicist Mikhail Dyakonov, a researcher for many years at Ioffe Institute, in Saint Petersburg, Russia, and now at the University of Montpellier, in France, is even more skeptical. In "The Case Against Quantum Computing," on p. 24 of this issue, he lays out his view that practical general-purpose quantum computers will not be built anytime in the foreseeable future. ¶As you might expect, his essay ruffled some feathers after it was published online. But as it turns out, while his article was being prepared, a committee assembled by the U.S. National Academies of Sciences, Engineering, and Medicine had been grappling with the very same question.

IEEE Spectrum•Feb 25, 2019•0 citations

What is Quantum Computing and How it Works

Bahman Zohuri

Companies such as Intel as a pioneer in chip design for computing are pushing the edge of computing from its present Classical Computing generation to the next generation of Quantum Computing. Along the side of Intel corporation, companies such as IBM, Microsoft, and Google are also playing in this domain. The race is on to build the world’s first meaningful quantum computer—one that can deliver the technology’s long-promised ability to help scientists do things like develop miraculous new materials, encrypt data with near-perfect security and accurately predict how Earth’s climate will change. Such a machine is likely more than a decade away, but IBM, Microsoft, Google, Intel, and other tech heavyweights breathlessly tout each tiny, incremental step along the way. Most of these milestones involve packing more quantum bits, or qubits—the basic unit of information in a quantum computer—onto a processor chip ever. But the path to quantum computing involves far more than wrangling subatomic particles. Such computing capabilities are opening a new area into dealing with the massive sheer volume of structured and unstructured data in the form of Big Data, is an excellent augmentation to Artificial Intelligence (AI) and would allow it to thrive to its next generation of Super Artificial Intelligence (SAI) in the near-term time frame

Journal of Material Sciences & Manfacturing Research•Jul 28, 2020•2 citations

What is Quantum Computing and How it Works

Bahman Zohuri, Farhang Mossavar Rahmani

Companies such as Intel as a pioneer in chip design for computing are pushing the edge of computing from its present Classical Computing generation to the next generation of Quantum Computing. Along the side of Intel corporation, companies such as IBM, Microsoft, and Google are also playing in this domain. The race is on to build the world’s first meaningful quantum computer—one that can deliver the technology’s long-promised ability to help scientists do things like develop miraculous new materials, encrypt data with near-perfect security and accurately predict how Earth’s climate will change. Such a machine is likely more than a decade away, but IBM, Microsoft, Google, Intel, and other tech heavyweights breathlessly tout each tiny, incremental step along the way. Most of these milestones involve packing more quantum bits, or qubits—the basic unit of information in a quantum computer—onto a processor chip ever. But the path to quantum computing involves far more than wrangling subatomic particles. Such computing capabilities are opening a new area into dealing with the massive sheer volume of structured and unstructured data in the form of Big Data, is an excellent augmentation to Artificial Intelligence (AI) and would allow it to thrive to its next generation of Super Artificial Intelligence (SAI) in the near-term time frame.

•Dec 31, 2020•4 citations

AN INVESTIGATION INTO THE TRANSFORMATIVE POWER OF QUANTUM COMPUTING IN SCIENTIFIC RESEARCH

Dr. Arven L. Thaylen, Dr. Senira D. Valtome

We are on the verge of a new era in computation, one that operates on the strange and wonderful rules of the quantum world. This article explores the story of quantum computing, a technology that promises to solve problems far beyond the reach of today's fastest supercomputers. We'll journey from the core ideas that make it all possible—concepts like superposition and entanglement—to the incredible machines being built in labs around the world. We'll see how these machines are being programmed and witness the first hints of their power in fields like medicine, materials science, and cybersecurity. Finally, we'll take an honest look at the immense challenges that still lie ahead on the path to building a truly powerful quantum computer. This is a story of human ingenuity pushing the boundaries of science, a tale of the immense potential and practical hurdles of the coming quantum age.

European Journal of Emerging Cloud and Quantum Computing•Dec 30, 2024•0 citations

Building a quantum computer (invited)

Barry C. Sanders

Quantum computing has leapt from concept to commercial enterprise in four decades and now the complexities of computer hardware apply to quantum computing but with the added challenge that computer fundamentals are radically different.

•Nov 5, 2020•3 citations

Formally Verified Quantum Programming

Robert W. Rand

The field of quantum mechanics predates computer science by at least ten years, the time between the publication of the Schrodinger equation and the Church-Turing thesis. It took another fifty years for Feynman to recognize that harnessing quantum mechanics is necessary to efficiently simulate physics and for David Deutsch to propose the quantum Turing machine. After thirty more years, we are finally getting close to the first general-purpose quantum computers based upon prototypes by IBM, Intel, Google and others.\nWhile physicists and engineers have worked on building scalable quantum computers, theoretical computer scientists have made their own advances. Complexity theorists introduced quantum complexity classes like BQP and QMA; Shor and Grover developed their famous algorithms for factoring and unstructured search. Programming languages researchers pursued two main research directions: Small-scale languages like QPL and the quantum lambda-calculi for reasoning about quantum computation and large-scale languages like Quipper and Q# for industrial-scale quantum software development. This thesis aims to unify these two threads while adding a third one: formal verification.\nWe argue that quantum programs demand machine-checkable proofs of correctness. We justify this on the basis of the complexity of programs manipulating quantum states, the expense of running quantum programs, and the inapplicability of traditional debugging techniques to programs whose states cannot be examined. We further argue that the existing mathematical models of quantum computation make this an easier task than one could reasonably expect. In light of these observations we introduce QWIRE, a tool for writing verifiable, large scale quantum programs.\nQWIRE is not merely a language for writing and verifying quantum circuits: it is a verified circuit description language. This means that the semantics of QWIRE circuits are verified in the Coq proof assistant. We also implement verified abstractions, like ancilla management and reversible circuit compilation. Finally, we turn QWIRE and Coq's abilities outwards, towards verifying popular quantum algorithms like quantum teleportation. We argue that this tool provides a solid foundation for research into quantum programming languages and formal verification going forward.

•Jan 1, 2018•7 citations
Computer scientists and engineers have started down a road that could one day lead to a momentous transition: from deterministic computing systems, based on classical physics, to quantum computing systems, which exploit the weird and wacky probabilistic rules of quantum physics. Many commentators have pointed out that if engineers are able to fashion practical quantum computers, there will be a tectonic shift in the sort of computations that become possible ¶ But that's a big if. ¶ Quantum computers hold great theoretical promise, sure, but the hurdles that need to be overcome to build practical machines are enormous. Some skeptics have argued that the technical challenges are so immense that it's very unlikely that general-purpose quantum computers will become available anytime in the foreseeable future. Others, including the engineers now working very hard to build these machines at Google, IBM, Intel, and elsewhere, are more sanguine, anticipating that 5 or 10 more years of work may be enough to bring the first practical general-purpose quantum computers on line. Only time will tell. ≫
Our romance with new technologies always seems to follow the same trajectory: We are by turns mesmerized and adoring, disappointed and disheartened, and end up settling for less than we originally imagined. In 1954, Texas Instruments touted its new transistors as bringing "electronic “brains” approaching the human brain in scope and reliability" much closer to reality. In 2000, U.S. president Bill Clinton declared that the Human Genome Project would lead to a world in which "our children's children will know the term cancer only as a constellation of stars." And so it is now with quantum computing. ¶The popular press is awash with articles touting its promise. Tech giants are pouring huge amounts of money into building prototypes. You get the distinct impression that the computer industry is on the verge of an imminent quantum revolution. ¶But not everyone believes that quantum computing is going to solve real-world problems in anything like the time frame that some proponents of the technology want us to believe. Indeed, many of the researchers involved acknowledge the hype has gotten out of control, cautioning that quantum computing may take decades to mature. ¶Theoretical physicist Mikhail Dyakonov, a researcher for many years at Ioffe Institute, in Saint Petersburg, Russia, and now at the University of Montpellier, in France, is even more skeptical. In "The Case Against Quantum Computing," on p. 24 of this issue, he lays out his view that practical general-purpose quantum computers will not be built anytime in the foreseeable future. ¶As you might expect, his essay ruffled some feathers after it was published online. But as it turns out, while his article was being prepared, a committee assembled by the U.S. National Academies of Sciences, Engineering, and Medicine had been grappling with the very same question.
Companies such as Intel as a pioneer in chip design for computing are pushing the edge of computing from its present Classical Computing generation to the next generation of Quantum Computing. Along the side of Intel corporation, companies such as IBM, Microsoft, and Google are also playing in this domain. The race is on to build the world’s first meaningful quantum computer—one that can deliver the technology’s long-promised ability to help scientists do things like develop miraculous new materials, encrypt data with near-perfect security and accurately predict how Earth’s climate will change. Such a machine is likely more than a decade away, but IBM, Microsoft, Google, Intel, and other tech heavyweights breathlessly tout each tiny, incremental step along the way. Most of these milestones involve packing more quantum bits, or qubits—the basic unit of information in a quantum computer—onto a processor chip ever. But the path to quantum computing involves far more than wrangling subatomic particles. Such computing capabilities are opening a new area into dealing with the massive sheer volume of structured and unstructured data in the form of Big Data, is an excellent augmentation to Artificial Intelligence (AI) and would allow it to thrive to its next generation of Super Artificial Intelligence (SAI) in the near-term time frame
Companies such as Intel as a pioneer in chip design for computing are pushing the edge of computing from its present Classical Computing generation to the next generation of Quantum Computing. Along the side of Intel corporation, companies such as IBM, Microsoft, and Google are also playing in this domain. The race is on to build the world’s first meaningful quantum computer—one that can deliver the technology’s long-promised ability to help scientists do things like develop miraculous new materials, encrypt data with near-perfect security and accurately predict how Earth’s climate will change. Such a machine is likely more than a decade away, but IBM, Microsoft, Google, Intel, and other tech heavyweights breathlessly tout each tiny, incremental step along the way. Most of these milestones involve packing more quantum bits, or qubits—the basic unit of information in a quantum computer—onto a processor chip ever. But the path to quantum computing involves far more than wrangling subatomic particles. Such computing capabilities are opening a new area into dealing with the massive sheer volume of structured and unstructured data in the form of Big Data, is an excellent augmentation to Artificial Intelligence (AI) and would allow it to thrive to its next generation of Super Artificial Intelligence (SAI) in the near-term time frame.
We are on the verge of a new era in computation, one that operates on the strange and wonderful rules of the quantum world. This article explores the story of quantum computing, a technology that promises to solve problems far beyond the reach of today's fastest supercomputers. We'll journey from the core ideas that make it all possible—concepts like superposition and entanglement—to the incredible machines being built in labs around the world. We'll see how these machines are being programmed and witness the first hints of their power in fields like medicine, materials science, and cybersecurity. Finally, we'll take an honest look at the immense challenges that still lie ahead on the path to building a truly powerful quantum computer. This is a story of human ingenuity pushing the boundaries of science, a tale of the immense potential and practical hurdles of the coming quantum age.
The field of quantum mechanics predates computer science by at least ten years, the time between the publication of the Schrodinger equation and the Church-Turing thesis. It took another fifty years for Feynman to recognize that harnessing quantum mechanics is necessary to efficiently simulate physics and for David Deutsch to propose the quantum Turing machine. After thirty more years, we are finally getting close to the first general-purpose quantum computers based upon prototypes by IBM, Intel, Google and others.\nWhile physicists and engineers have worked on building scalable quantum computers, theoretical computer scientists have made their own advances. Complexity theorists introduced quantum complexity classes like BQP and QMA; Shor and Grover developed their famous algorithms for factoring and unstructured search. Programming languages researchers pursued two main research directions: Small-scale languages like QPL and the quantum lambda-calculi for reasoning about quantum computation and large-scale languages like Quipper and Q# for industrial-scale quantum software development. This thesis aims to unify these two threads while adding a third one: formal verification.\nWe argue that quantum programs demand machine-checkable proofs of correctness. We justify this on the basis of the complexity of programs manipulating quantum states, the expense of running quantum programs, and the inapplicability of traditional debugging techniques to programs whose states cannot be examined. We further argue that the existing mathematical models of quantum computation make this an easier task than one could reasonably expect. In light of these observations we introduce QWIRE, a tool for writing verifiable, large scale quantum programs.\nQWIRE is not merely a language for writing and verifying quantum circuits: it is a verified circuit description language. This means that the semantics of QWIRE circuits are verified in the Coq proof assistant. We also implement verified abstractions, like ancilla management and reversible circuit compilation. Finally, we turn QWIRE and Coq's abilities outwards, towards verifying popular quantum algorithms like quantum teleportation. We argue that this tool provides a solid foundation for research into quantum programming languages and formal verification going forward.