How to Prepare Chemistry Problems for Quantum Computers
This patent describes a method to translate complex quantum chemistry problems, specifically those involving fermions, into a format that can be run on real-world quantum computers, even when the quantum hardware has limitations.
Patent Number
US 10922617
Status
Active
Filing Date
August 8, 2019
Grant Date
February 16, 2021
Expiration
August 8, 2039
Claims
16
Assignee
Harvard University
Inventors
Alan Aspuru-Guzik, Ryan Babbush, Peter Love
Citations
6 forward · 5 backward
What it covers
This patent outlines a method for preparing quantum chemistry problems for execution on a quantum processor. It starts by taking a "problem specification" which is a "fermionic Hamiltonian" (a mathematical description of a system with particles like electrons) associated with "spin orbitals" (Claim 1). This Hamiltonian is then transformed into a "first computing specification," which uses a set of "qubits" to encode information about the spin orbitals, specifically their "parity and occupancy" in a "non-local" way (Claim 1). This transformation might use a technique like the Bravyi-Kitaev transformation (Claim 2). Crucially, a "second computing specification" is then generated. This second step adapts the problem to the actual quantum processor by substituting interactions between "ancilla qubits" for any interactions between the original qubits that the quantum processor cannot perform directly (Claim 1). For example, if a quantum computer can't directly link two distant qubits, this method finds a way to simulate that link using intermediate 'ancilla' qubits.
What it doesn't cover
- —Does not cover methods for simulating systems that are not described by a fermionic Hamiltonian (e.g., systems of bosons).
- —Does not cover the physical design or operation of the quantum processor itself, only the software-level compilation.
- —Does not cover encoding parity and occupancy information in a purely local manner, as it specifies 'non-locally' (Claim 1).
- —Does not cover quantum problem compilation methods that do not use ancilla qubits to substitute for unavailable interactions.
- —Does not cover classical computing methods for solving quantum chemistry problems.
The clever bit
The innovation lies in the two-step compilation process, particularly the second step. It cleverly adapts a quantum problem to the specific, often limited, connectivity and interaction capabilities of a real quantum processor by using 'ancilla qubits' to stand in for unavailable direct interactions.
Why it matters
Simulating complex molecules and materials is incredibly difficult for traditional computers, but essential for discovering new drugs and advanced materials. This patent provides a crucial bridge, allowing these challenging problems to be mapped onto the capabilities of existing, imperfect quantum computers. It helps make theoretical quantum algorithms practical for real-world scientific research.
Real-world examples
- 1.Quantum chemistry simulations for drug discovery
- 2.Materials science research using quantum computers
- 3.Quantum algorithms for molecular energy calculations
- 4.Simulations of electron behavior in superconductors
Generated by PatentBrief · Not legal advice · patentbrief.org
US 10922617 · 2026