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

C&EN Global Enterprise

Chemistry is quantum computing’s killer app

Katherine Bourzac

Published Oct 30, 2017• 8 citations
Publisher

Abstract

In an IBM lab in Yorktown Heights, N.Y., a circuit board sits at the bottom of a large tub cooled to temperatures colder than those of outer space. Shiny, solderlike zigzags of niobium cover the board, connecting 16 unusual computing elements. These elements, called quantum bits, or qubits, may form the basis of future computers that will solve problems by taking advantage of quantum mechanics. So far, quantum computers like IBM’s 16-qubit system can solve only simple problems, all of them easy enough to be handled by traditional computers. This spring, IBM set a quantum-computing record by modeling beryllium hydride—which contains a mere three atoms (Nature 2017, DOI: 10.1038/nature23879). Earlier prototypes modeled hydrogen and factored the number 15. As quantum computers become more sophisticated, they will allow chemists to solve problems that are intractable on today’s desktops and even supercomputers. In fact, physicists expect that chemistry simulations will be quantum

DOI
10.1021/cen-09543-cover

Related papers

Chemistry on the computer

Martin Head‐Gordon, Emilio Artacho

Although exact descriptions of the quantum mechanics of molecules are computationally intractable, chemists and physicists have devised approximations that are efficient enough to be practical and accurate enough to be useful.

Physics Today•Apr 1, 2008•65 citations

The Future of Quantum Computing

Yaash Sahnan

Quantum Computing often described as one of the most exciting frontiers of modern science—a field that does not just push the boundaries of technology but also reshapes how we think about solving problems. Unlike classical computers, which process information in simple 0s and 1s, quantum mechanics, allowing a single qubit to explore multiple possibilities at the same time. This gives them the potential to perform calculations that would take even today’s most powerful supercomputers thousands of years. In recent years, progress has been rapid, with breakthroughs in hardware, algorithms and applications that range from developing new medicines to strengthening artificial intelligence and tackling climate change. Yet, enormous challenges remain, such as stabilizing fragile qubits, reducing error rates, and making these systems accessible beyond a handful of elite labs. This paper explores both the promises and the pitfalls of quantum computing, offering a closer look at how it could reshape industries, global security and even the pace of human innovation in the decades ahead.

Iconic Research and Engineering Journals•Sep 17, 2025•0 citations

QnAs with Christopher Monroe

Chris Samoray

Classic computing can take credit for technology ranging from mobile phones to supercomputers. But in recent years, a budding counterpart to these conventional devices has emerged: quantum computers. Whereas classic computing sometimes fails to solve complex calculations, such as factoring hundred-digit numbers, quantum computing holds the potential to easily tackle such problems. The field of quantum computing has attracted researchers, such as National Academy of Sciences member Christopher Monroe. An experimental atomic physicist at the University of Maryland and fellow of the Joint Quantum Institute and the Joint Center for Quantum Information and Computer Science in Maryland, Monroe uses lasers to exploit atomic particles to study complex computational problems. Monroe spoke to PNAS about how quantum computing might evolve. Christopher Monroe. > PNAS:Can you describe some of the basic mechanics of quantum computing? > Monroe:It all comes down to the superposition principle, in which a quantum system can exist in multiple states at the same time. Consider the fundamental unit of information: the bit. A bit is binary information that can be a 0 or a 1. A quantum bit, or qubit, can be in a superposition of both 0 and 1 as long as it’s isolated and unobserved. A single qubit is pretty trivial, but when you put many qubits together, there become exponentially many possibilities. > > Let’s consider 300 qubits. That’s an interesting number because the number of possible configurations, 2300, is more than the number of particles in the universe. You could never simulate what happens with 300 qubits on a classical machine; there’s not enough stuff in the universe to do it. The magic with quantum is the power of exponential growth: every time you add a qubit, you double the number of configurations. > > But to control these qubits and exploit this massive storage, we …

Proceedings of the National Academy of Sciences•Apr 10, 2017•0 citations

An Outlook for Quantum Computing [Point of View]

Dmitri Maslov, Yunseong Nam, Jungsang Kim

We have ubiquitous presence of computers today, ranging from simple controllers in modern appliances to smartphones in our pockets that provide a wide range of everyday services, to powerful supercomputers and large data centers that carry out the most computationally intensive tasks. These computational machines have a few things in common: for example, the information they handle is stored in bits (0 or 1), and the procedure for processing the information is specified by a program. A great deal is known about the limits of what such computational machines can and cannot do efficiently. There are many important computational problems that are believed to be very difficult to solve using even the most powerful computers, where the resource requirement-whether it is the size of the machine or the time it takes to finish the task-increases exponentially as a function of the problem size.

Proceedings of the IEEE•Dec 27, 2018•65 citations

Novel Approach of Quantum Computing Models

Priti Subramanium, Gajanan Uttam Patil, Tushar Hrishikesh Jaware +1 more

Numerous major problems facing our world in the fields of environment, agriculture, healthiness, energy, weather, and materials science could be resolved by quantum computing. As the system's bulk increases, it becomes increasingly difficult for traditional computing to handle some of these issues. When quantum systems are built to scale, their capabilities will likely surpass those of the most powerful supercomputers available now. Among the numerous subfields that comprise the field of quantum computing are quantum algorithms and quantum hardware. Despite being in its infancy, quantum technology will soon be able to solve complex problems that supercomputers cannot or will not be able to address in a timely manner. Fully functional quantum computers would be able to take advantage of the exciting possibilities of quantum physics to process enormously complicated problems at orders of magnitude quicker than existing machines. A quantum computer might complete tasks in a matter of minutes that would take conventional computer hundreds of years to complete. Unique and fundamental natural notions are revealed by the study of subatomic particles, or quantum mechanics.

Wiley eBooks•Oct 30, 2026•0 citations

Quantum Chemistry

Kolla Bhanu Prakash

The simulation of quantum chemical systems is widely regarded as the "killer app" for quantum computing.While classical computers have made tremendous strides in computational chemistry-earning the 1998 Nobel Prize for Density Functional Theory (DFT)-they face a fundamental wall: the "Exponential Catastrophe." The Hilbert space of a quantum many-body system scales exponentially with the number of particles.For a system of orbitals, the dimension is 1.To store the wavefunction of a molecule with just 50 electrons exactly would require more classical bits than there are atoms in the Milky Way [121].Quantum computers bypass this limit by mapping the quantum system of electrons directly onto the quantum system of qubits.This chapter provides a definitive guide to this field, moving from the foundational Schrödinger equation to the cutting-edge of Variational Quantum Eigensolvers (VQE) and beyond [191]. Theoretical Foundations of Electronic StructureTo program a quantum computer for chemistry, one must first understand the physics we are trying to simulate.The central problem is finding the stationary states of the Schrödinger equation [122]. The Many-Body HamiltonianThe non-relativistic, time-independent Schrödinger equation is given by:Here, Ĥ is the Hamiltonian operator representing the total energy of the molecular system.

Wiley eBooks•Aug 17, 2026•0 citations
In an IBM lab in Yorktown Heights, N.Y., a circuit board sits at the bottom of a large tub cooled to temperatures colder than those of outer space. Shiny, solderlike zigzags of niobium cover the board, connecting 16 unusual computing elements. These elements, called quantum bits, or qubits, may form the basis of future computers that will solve problems by taking advantage of quantum mechanics. So far, quantum computers like IBM’s 16-qubit system can solve only simple problems, all of them easy enough to be handled by traditional computers. This spring, IBM set a quantum-computing record by modeling beryllium hydride—which contains a mere three atoms (Nature 2017, DOI: 10.1038/nature23879). Earlier prototypes modeled hydrogen and factored the number 15. As quantum computers become more sophisticated, they will allow chemists to solve problems that are intractable on today’s desktops and even supercomputers. In fact, physicists expect that chemistry simulations will be quantum
Quantum Computing often described as one of the most exciting frontiers of modern science—a field that does not just push the boundaries of technology but also reshapes how we think about solving problems. Unlike classical computers, which process information in simple 0s and 1s, quantum mechanics, allowing a single qubit to explore multiple possibilities at the same time. This gives them the potential to perform calculations that would take even today’s most powerful supercomputers thousands of years. In recent years, progress has been rapid, with breakthroughs in hardware, algorithms and applications that range from developing new medicines to strengthening artificial intelligence and tackling climate change. Yet, enormous challenges remain, such as stabilizing fragile qubits, reducing error rates, and making these systems accessible beyond a handful of elite labs. This paper explores both the promises and the pitfalls of quantum computing, offering a closer look at how it could reshape industries, global security and even the pace of human innovation in the decades ahead.
Classic computing can take credit for technology ranging from mobile phones to supercomputers. But in recent years, a budding counterpart to these conventional devices has emerged: quantum computers. Whereas classic computing sometimes fails to solve complex calculations, such as factoring hundred-digit numbers, quantum computing holds the potential to easily tackle such problems. The field of quantum computing has attracted researchers, such as National Academy of Sciences member Christopher Monroe. An experimental atomic physicist at the University of Maryland and fellow of the Joint Quantum Institute and the Joint Center for Quantum Information and Computer Science in Maryland, Monroe uses lasers to exploit atomic particles to study complex computational problems. Monroe spoke to PNAS about how quantum computing might evolve. Christopher Monroe. > PNAS:Can you describe some of the basic mechanics of quantum computing? > Monroe:It all comes down to the superposition principle, in which a quantum system can exist in multiple states at the same time. Consider the fundamental unit of information: the bit. A bit is binary information that can be a 0 or a 1. A quantum bit, or qubit, can be in a superposition of both 0 and 1 as long as it’s isolated and unobserved. A single qubit is pretty trivial, but when you put many qubits together, there become exponentially many possibilities. > > Let’s consider 300 qubits. That’s an interesting number because the number of possible configurations, 2300, is more than the number of particles in the universe. You could never simulate what happens with 300 qubits on a classical machine; there’s not enough stuff in the universe to do it. The magic with quantum is the power of exponential growth: every time you add a qubit, you double the number of configurations. > > But to control these qubits and exploit this massive storage, we …
We have ubiquitous presence of computers today, ranging from simple controllers in modern appliances to smartphones in our pockets that provide a wide range of everyday services, to powerful supercomputers and large data centers that carry out the most computationally intensive tasks. These computational machines have a few things in common: for example, the information they handle is stored in bits (0 or 1), and the procedure for processing the information is specified by a program. A great deal is known about the limits of what such computational machines can and cannot do efficiently. There are many important computational problems that are believed to be very difficult to solve using even the most powerful computers, where the resource requirement-whether it is the size of the machine or the time it takes to finish the task-increases exponentially as a function of the problem size.
Numerous major problems facing our world in the fields of environment, agriculture, healthiness, energy, weather, and materials science could be resolved by quantum computing. As the system's bulk increases, it becomes increasingly difficult for traditional computing to handle some of these issues. When quantum systems are built to scale, their capabilities will likely surpass those of the most powerful supercomputers available now. Among the numerous subfields that comprise the field of quantum computing are quantum algorithms and quantum hardware. Despite being in its infancy, quantum technology will soon be able to solve complex problems that supercomputers cannot or will not be able to address in a timely manner. Fully functional quantum computers would be able to take advantage of the exciting possibilities of quantum physics to process enormously complicated problems at orders of magnitude quicker than existing machines. A quantum computer might complete tasks in a matter of minutes that would take conventional computer hundreds of years to complete. Unique and fundamental natural notions are revealed by the study of subatomic particles, or quantum mechanics.
The simulation of quantum chemical systems is widely regarded as the "killer app" for quantum computing.While classical computers have made tremendous strides in computational chemistry-earning the 1998 Nobel Prize for Density Functional Theory (DFT)-they face a fundamental wall: the "Exponential Catastrophe." The Hilbert space of a quantum many-body system scales exponentially with the number of particles.For a system of orbitals, the dimension is 1.To store the wavefunction of a molecule with just 50 electrons exactly would require more classical bits than there are atoms in the Milky Way [121].Quantum computers bypass this limit by mapping the quantum system of electrons directly onto the quantum system of qubits.This chapter provides a definitive guide to this field, moving from the foundational Schrödinger equation to the cutting-edge of Variational Quantum Eigensolvers (VQE) and beyond [191]. Theoretical Foundations of Electronic StructureTo program a quantum computer for chemistry, one must first understand the physics we are trying to simulate.The central problem is finding the stationary states of the Schrödinger equation [122]. The Many-Body HamiltonianThe non-relativistic, time-independent Schrödinger equation is given by:Here, Ĥ is the Hamiltonian operator representing the total energy of the molecular system.