Media Kit
Jacob Biamonte
(bee-ah-MON-tay)
The research question
When does a quantum system become a computer?
Or, in Biamonte's own words: "I build and analyze models of computation that lie between efficient classical simulation and universal quantum computation."
Professor, ÉTS Montreal, Université du Québec
MEIE Chairholder in Quantum Computing
Director, KÉTS – Institute for Quantum Science and Engineering
For editors and partners
For online coverage, link the first reference to Jacob Biamonte to the language-matched ÉTS faculty profile. Use the ÉTS research feature for a concise account of the research program and the KÉTS page for institute information. This media kit supplies ready-to-use biographies, group descriptions, images and research references.
- English: ÉTS faculty profile · ÉTS research feature · KÉTS institute page
- Français: profil professoral de l’ÉTS · portrait institutionnel de l’ÉTS · Institut KÉTS
- Research profile: English · Français · short CV
For team and institute wording, see Research group attribution.
Biography
Most discussions of quantum computing focus on how to build the machines. Biamonte asks another fundamental question: what are they actually capable of? This is the question he has pursued throughout his career.
When Biamonte entered the field, quantum computation was often presented as a single sharp divide: classically simulable systems on one side and universal quantum computers on the other. His research instead examines a broader range of computational models, asking which physical and mathematical structures make them difficult to simulate, computationally useful or fully programmable.
The distinction is not simply between classical and quantum systems. A system can appear intractable to simulate classically without being known to support general-purpose quantum computation; it can also be useful without being fully programmable. Biamonte studies the interactions, composition rules, constraints and feedback mechanisms that distinguish these regimes. In 2008, with Peter Love, he showed that a restricted, experimentally realizable family of ZX interactions can embed universal quantum computation in a system's ground state.
Now Professor at ÉTS, MEIE Chairholder in Quantum Computing, and Director of KÉTS – Institute for Quantum Science and Engineering, Biamonte leads a research program connecting these foundational questions with contemporary quantum hardware. His group studies which systems can be made programmable, what that programmability costs, and how theoretical claims can be tested on real machines.
Read the ÉTS research profile: English · Français.
Areas of work
Four bodies of work, each answering part of the research question.
Conditions for quantum universality
Establishing what it takes for a physical system to support general-purpose quantum computation. Biamonte and Peter Love showed that restricted ZX interactions can embed universal quantum computation in a system's ground state.
Ground-state programming and perturbative gadgets
Developing reusable methods for encoding computation into the ground state of a Hamiltonian. Ground-state spin logic and perturbative gadgets provide systematic ways to encode logical constraints and effective interactions in physical models.
Tensor-network languages and graphical calculi
Developing tensor networks as compositional languages, not only as representations. This work includes the BCJ algebraic normal form and graphical frameworks connecting different representations of open quantum systems.
Classical–quantum feedback
A classical outer loop selects parameters, reads measurements from a parameterized quantum system and determines the next choice. This feedback architecture underlies variational quantum computation and much of quantum machine learning. Biamonte treats the architecture itself as an object of study: his work constructs expected-value objectives that support universal quantum computation and identifies reachability deficits, abrupt training transitions, cost-function locality and layerwise training saturation that limit what such systems can learn or prepare.
Short bios
Please use as written.
One line
Jacob Biamonte's research helps clarify the structural differences between quantum systems that appear intractable to simulate classically yet are not known to support general-purpose quantum computation, and systems that are useful yet not fully programmable.
Short
Jacob Biamonte is Professor at ÉTS Montreal, Université du Québec, and MEIE Chairholder in Quantum Computing. His research helps clarify the structural differences between quantum systems that appear intractable to simulate classically yet are not known to support general-purpose quantum computation, and systems that are useful yet not fully programmable. His contributions include ground-state spin logic, the QMA-completeness of restricted ZX Hamiltonians, chiral quantum walks, fundamental limitations in quantum approximate optimization, and work that helped organize quantum machine learning and quantum complex networks.
Long
Jacob Biamonte is Professor at ÉTS Montreal, Université du Québec, MEIE Chairholder in Quantum Computing, and Director of KÉTS – Institute for Quantum Science and Engineering. His research helps clarify the structural differences between quantum systems that appear intractable to simulate classically yet are not known to support general-purpose quantum computation, and systems that are useful yet not fully programmable. He studies the interactions, compositional rules and mathematical structures that determine what a quantum system can compute. His contributions include ground-state spin logic, the QMA-completeness of restricted ZX Hamiltonians, chiral quantum walks, fundamental limitations in quantum approximate optimization, and work that helped organize quantum machine learning and quantum complex networks. In 2008, with Peter Love, he showed that a restricted, experimentally realizable family of interactions can embed universal quantum computation in a system's ground state. The result is now a Citation Classic.
Research group attribution
Use Jacob Biamonte’s research program for the long-running body of research described here, and Biamonte and collaborators for the research map or results spanning several papers. For a specific result, name the paper and its authors.
Refer to the ÉTS group as Professor Jacob Biamonte’s research group at ÉTS Montréal. Biamonte’s group or Professor Biamonte’s team refers to his ÉTS group. For joint projects, identify the participating partner research groups and use the collaboration for the combined project participants.
Describe participating researchers by their actual roles, for example doctoral researchers, master’s students, postdoctoral researchers or research staff, rather than the broad category postsecondary students. Acknowledge funding support separately from the description of the researchers.
Group description (copy-ready): Professor Jacob Biamonte’s research group at ÉTS Montréal investigates what quantum systems can compute, which systems can be made programmable and what that programmability costs. The group connects these foundational questions with tests on contemporary quantum hardware.
KÉTS – Institute for Quantum Science and Engineering is the wider institute, distinct from Biamonte’s research group.
Online partnership announcements that name Biamonte or his group should include the language-matched ÉTS faculty profile and this media kit. When they describe the research program, they should also link the ÉTS research feature; when they mention KÉTS, they should link the institute page.
Quotes
"A quantum system can be intractable to simulate without being useful, and useful without being programmable. I am building a language for the territory in between."
"My work is carving out a language for a new kind of quantum engineering, for example programming languages that control the low-energy states of quantum systems."
"Everything needed to lead quantum computing is already here in Québec: ecosystem expertise and world-class quantum hardware."
"Benchmarking against real physical measurements, rather than only classical simulations, is an important direction for the field." — Chemical & Engineering News, March 2026
At a glance
Current positions
- Professor, ÉTS Montreal, Université du Québec
- MEIE Chairholder in Quantum Computing
- Director, KÉTS – Institute for Quantum Science and Engineering
Background
- One of the world's first quantum applications scientists, at D-Wave (2004–2007)
- Two doctorates: computer science (Oxford) and mathematical physics (Doctor of Science higher doctorate, Moscow Institute of Physics and Technology)
Signature contributions
- The 2008 universality result. Realizable Hamiltonians for Universal Adiabatic Quantum Computers, Biamonte and Love, Physical Review A, 2008. Now listed among Citation Classics.
- From theorem to engineering target. The result informed D-Wave's patent family on physical realizations of universal adiabatic quantum computation. Five U.S. grants name Biamonte as an inventor; a related sixth U.S. grant shares the same 2007 provisional priority. The family also includes a Canadian grant and PCT/EU/Japanese filings. Google Patents records 91 families citing the consolidated family, including 52 external to D-Wave. Source: Google Patents, August 2026.
- Universal computation through variational feedback (2021). Two expected-value objective functions show that iterative classical-to-quantum outer-loop optimization can, in principle, prepare the output of an arbitrary quantum circuit.
- Structural limits of feedback-based models. Reachability deficits, abrupt training transitions, cost-function locality and layerwise training saturation help explain why formal universality does not guarantee trainability or useful performance.
- Selected results. Minimal ZX/XZ interactions can embed universal ground-state quantum computation; algebraic tensor-network building blocks can represent arbitrary multiqubit states; the structure of a tensor network can make a hard counting problem tractable; and expected-value objectives establish universal variational quantum computation.
- Field development. Work that helped organize quantum machine learning and quantum complex networks, including Quantum Machine Learning (Nature Perspective, 2017), Tensor Networks in a Nutshell, and Complex Networks from Classical to Quantum, selected for Communications Physics' 2020 anniversary Editor's Highlights.
- Citation impact. Nineteen papers have been cited more than 100 times; eight are in the top 1% of their OpenAlex citation comparison groups, including three in the top 0.1%. Included in the Stanford–Elsevier World's Top 2% Scientists ranking in Physics (2024). Source: OpenAlex, 28 August 2026.
Education
- DPhil, Computer Science, University of Oxford
- Doctor of Science, Mathematical Physics
Selected recognition
- Fellow, Institute of Physics (2023)
- Fellow of the Higher Education Academy (2023)
- Fellow, Institute of Mathematics and its Applications (2021)
- USERN Medal in Formal Sciences (2018)
- EPSRC Doctoral Prize, University of Oxford (2010)
- Trusted Reviewer Award, Journal of Physics A: Mathematical and Theoretical (2020)
Service
- Associate Editor, ACM Transactions on Quantum Computing
- Invited member, Foundational Questions Institute (since 2014)
About the institute
ÉTS recruited Jacob Biamonte in October 2024 to strengthen its quantum-computing research program and international collaborations.
Biamonte serves as Institute Director of KÉTS – Institute for Quantum Science and Engineering, which pairs foundational research with Québec's quantum processors, industrial partnerships and emerging talent. Site en français.
Current work
Biamonte and his group investigate where computational structure appears between classical intractability and full programmability. They test these questions on contemporary quantum hardware, probing which systems can be made programmable and what that programmability costs.
Research links
- Research profile: profs.etsmtl.ca/jbiamonte
- Google Scholar: scholar.google.com
- Key papers:
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers (2008): 10.1103/PhysRevA.78.012352
- Universal Variational Quantum Computation (2021): 10.1103/PhysRevA.103.L030401
- Reachability Deficits in Quantum Approximate Optimization (2020): 10.1103/PhysRevLett.124.090504
- Quantum Machine Learning (Nature, 2017): 10.1038/nature23474
Image library
All images below are free to use with the credit line given. Captions are written to be used as-is. Click an image to open the full-resolution file.
Photo credit: Vincent Lemelin / ÉTS Montréal.
Media contact
Valérie Dubuc
Communications Advisor
ÉTS Montreal, Université du Québec
Montréal, Québec, Canada
Email: communications@etsmtl.ca
Web: etsmtl.ca