Graph learning· 2017
Neural Message Passing for Quantum Chemistry
Atoms exchange bond messages.
On the reading lists
- #33 in the Top 500 (2026 edition)
- #24 of 100 papers to read in your lifetime (2026 edition)
- #2 in Graph learning (2026 edition)
Why it matters
Unified graph neural architectures under the influential message-passing framework.
Condensed from the expert lists' notes.
Inside the paper
- The problem
- Predicting molecular properties from quantum calculations is computationally demanding, and hand-designed molecular features may limit what a model can learn. Neural models need to respect the fact that renumbering atoms does not change a molecule.
- The idea
- The paper expresses several graph neural models in a common message-passing form and tests new variants on molecular property prediction. Atoms exchange learned information along bonds before the model combines their states into a molecule-level prediction.
- How it works
- Represent a molecule as a graph with atom features at nodes and bond information on edges, optionally including geometric information.
- At each round, a learned message function uses a neighbour’s state and edge features to produce information for the receiving atom.
- Combine incoming messages and update each atom’s hidden state; repeating the operation lets information travel across the molecular graph.
- A readout combines the final atom states into a prediction for the whole molecule, with the combination designed to ignore the ordering of atoms.
- What it showed
- The experiments compare message-passing variants on the QM9 molecular benchmark and report strong results across several quantum properties. The paper also examines how choices such as edge information affect prediction, rather than claiming that one design settles all molecular tasks.
- Read it for
- Start with Section 2 and Figure 1 for the graph formulation, then read the QM9 dataset and results in Sections 4 and 8. The survey of individual earlier architectures in Section 3 can wait until you want to compare their details.
Written in our own words from the paper itself. A draft the editors have not yet reviewed.
Reading it
Difficulty: Intermediate
Read this first: Semi-Supervised Classification with Graph Convolutional Networks.
The record
- First released
- 2017 (from arXiv 1704.01212)
- Citations
- 9,719 citations, as counted by Papers With Code (CC BY-SA 4.0)
- Named by
- both expert lists
- Also relevant to
- AI for science
- Score
- 0.747 · computed rank 33 · consensus 0.95, must-read 1, citations percentile 0.891 (2010s · graphs), awards 0, existing lists 0.5. Method
Editor's notes
- Readability check: pass: Unifies graph networks as message passing; a lasting framing. (AI draft (Claude), not yet reviewed, 2026-10-29)
Data sources
Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.