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

Scientific American

Google's Quantum Computer Achieves Chemistry Milestone

Neil J. Savage

Published Dec 1, 2020• 2 citations
Publisher
DOI
10.1038/scientificamerican122020-1ekew4haatglmff9ofvi5g

Related papers

An Overview of Quantum Algorithms: From Quantum Supremacy to Shor Factorization

Subhasree Patro, Álvaro Piedrafita

Recently, a team of scientists from Google claims to have carried a computation on their noisy, intermediate-scale quantum (NISQ) computer which no regular computer can achieve. A feat that is sometimes referred as quantum supremacy. In the first part of this work, we explain their approach, their randomised circuit construction and the consequences of their work. Having achieved this milestone, the natural question becomes: what else can we do with a quantum computer? We answer this question in the second part of this work and give an overview of the most widely used quantum primitives. We will see how one can implement them using quantum circuits and how these primitive circuits are composed to create fast algorithms capable of solving commercially relevant problems like simulation of complicated quantum systems for chemistry and material science, Monte Carlo simulation, solving large systems of linear equations, or breaking widely used cryptography like RSA.

IEEE International Symposium on Circuits and Systems proceedings•Sep 29, 2020•6 citations

Google makes advance in universal quantum computing

Physics Today•Jun 9, 2016•0 citations

Google and NASA Achieve Quantum Supremacy

Frank Tavares

Google, in partnership with NASA and Oak Ridge National Laboratory, has demonstrated the ability to compute in seconds what would take even the largest and most advanced supercomputers thousands of years, achieving a milestone known as quantum supremacy.

•Jan 1, 2019•5 citations

Quantum Chemistry with a Quantum Computer

Colin P. Williams

Texts in computer science•Dec 6, 2010•1 citation

Foundations of Quantum Theory and Quantum Computing for Predictive Electronics

Shaon Bandyopadhyay

Quantum computing offers a new way of solving problems that are too hard for classical machines. It works on the principles of quantum mechanics—superposition, entanglement, and interference. This chapter gives a clear introduction to these ideas and shows how they form the basis of quantum computing. We start with the core theory of quantum mechanics and then look at the history and key milestones in quantum computing, from Shor's factoring algorithm to recent proofs of quantum advantage. The chapter also explains main computing models such as quantum circuits, adiabatic approaches, and error correction, with examples such as Google's Sycamore processor. Applications are discussed in chemistry, cryptography, materials, healthcare, finance, and industrial optimization, with a focus on how they connect to predictive electronics. We compare different hardware platforms—superconducting qubits, trapped ions, and photonics—on their speed, accuracy, and ability to scale. The chapter closes with open challenges such as noise, error correction, and integrating quantum with classical systems. We also point to future directions, including fault-tolerant quantum computers and quantum networks. The aim is to show how quantum theory is shaping the next stage of computing and why it matters for predictive electronics and machine learning.

Wiley eBooks•Sep 10, 2026•0 citations

Quantum chemistry on a quantum computer

G. Fano, S. M. Blinder

Elsevier eBooks•Nov 30, 2018•10 citations
Recently, a team of scientists from Google claims to have carried a computation on their noisy, intermediate-scale quantum (NISQ) computer which no regular computer can achieve. A feat that is sometimes referred as quantum supremacy. In the first part of this work, we explain their approach, their randomised circuit construction and the consequences of their work. Having achieved this milestone, the natural question becomes: what else can we do with a quantum computer? We answer this question in the second part of this work and give an overview of the most widely used quantum primitives. We will see how one can implement them using quantum circuits and how these primitive circuits are composed to create fast algorithms capable of solving commercially relevant problems like simulation of complicated quantum systems for chemistry and material science, Monte Carlo simulation, solving large systems of linear equations, or breaking widely used cryptography like RSA.
Quantum computing offers a new way of solving problems that are too hard for classical machines. It works on the principles of quantum mechanics—superposition, entanglement, and interference. This chapter gives a clear introduction to these ideas and shows how they form the basis of quantum computing. We start with the core theory of quantum mechanics and then look at the history and key milestones in quantum computing, from Shor's factoring algorithm to recent proofs of quantum advantage. The chapter also explains main computing models such as quantum circuits, adiabatic approaches, and error correction, with examples such as Google's Sycamore processor. Applications are discussed in chemistry, cryptography, materials, healthcare, finance, and industrial optimization, with a focus on how they connect to predictive electronics. We compare different hardware platforms—superconducting qubits, trapped ions, and photonics—on their speed, accuracy, and ability to scale. The chapter closes with open challenges such as noise, error correction, and integrating quantum with classical systems. We also point to future directions, including fault-tolerant quantum computers and quantum networks. The aim is to show how quantum theory is shaping the next stage of computing and why it matters for predictive electronics and machine learning.