{
  "patent_number": "US 10922617",
  "country": "US",
  "title": "How to Prepare Chemistry Problems for Quantum Computers",
  "original_title": "Embedding electronic structure in controllable quantum systems",
  "summary": "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.",
  "what_it_does": "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_does_not_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."
  ],
  "filed": "2019-08-08",
  "granted": "2021-02-16",
  "expires": "2039-08-08",
  "status": "active",
  "holder": "Harvard University",
  "holder_url": "https://patentbrief.org/company/harvard-university",
  "inventors": [
    {
      "name": "Alan Aspuru-Guzik",
      "url": "https://patentbrief.org/inventor/alan-aspuru-guzik"
    },
    {
      "name": "Ryan Babbush",
      "url": "https://patentbrief.org/inventor/ryan-babbush"
    },
    {
      "name": "Peter Love",
      "url": "https://patentbrief.org/inventor/peter-love"
    }
  ],
  "times_cited": 6,
  "tags": [
    "quantum_computing",
    "software",
    "materials",
    "pharmaceutical",
    "biotech",
    "semiconductors"
  ],
  "abstract": "Generating a computing specification to be executed by a quantum processor includes: accepting a problem specification that corresponds to a second-quantized representation of a fermionic Hamiltonian, and transforming the fermionic Hamiltonian into a first qubit Hamiltonian including a first set of qubits that encode a fermionic state specified by occupancy of spin orbitals. An occupancy of any spin orbital is encoded in a number of qubits that is logarithmic in the number of spin orbitals, and a parity for a transition between any two spin orbitals is encoded in a number of qubits that is logarithmic in the number of spin orbitals. An eigenspectrum of a second qubit Hamiltonian, including the first set of qubits and a second set of qubit, includes a low-energy subspace and a high-energy subspace, and an eigenspectrum of the first qubit Hamiltonian is approximated by a set of low-energy eigenvalues of the low-energy subspace.",
  "url": "https://patentbrief.org/patent/us/10922617/embedding-electronic-structure-in-controllable-quantum-systems",
  "markdown_url": "https://patentbrief.org/patent/us/10922617/embedding-electronic-structure-in-controllable-quantum-systems/md",
  "google_patents_url": "https://patents.google.com/patent/US10922617",
  "relatedPatents": [
    {
      "patentNumber": "12008436",
      "countryCode": "US",
      "title": "Solving Big Math Problems with Small Quantum Computers",
      "url": "https://patentbrief.org/patent/us/12008436/machine-learning-mapping-for-quantum-processing-units"
    },
    {
      "patentNumber": "8190548",
      "countryCode": "US",
      "title": "Solving Complex Math Problems with Groups of Quantum Bits",
      "url": "https://patentbrief.org/patent/us/8190548/systems-devices-and-methods-for-analog-processing"
    },
    {
      "patentNumber": "8102185",
      "countryCode": "US",
      "title": "How to Precisely Control Two Quantum Bits in a Superconducting Computer",
      "url": "https://patentbrief.org/patent/us/8102185/systems-devices-and-methods-for-controllably-coupling-qubits-8102185"
    },
    {
      "patentNumber": "9256834",
      "countryCode": "US",
      "title": "How Quantum Computers Use Special Devices to Control Qubits",
      "url": "https://patentbrief.org/patent/us/9256834/quantum-computers-having-partial-interferometric-quantum-gates"
    },
    {
      "patentNumber": "20240296359",
      "countryCode": "US",
      "title": "How Quantum Computers Learn to Sort Data",
      "url": "https://patentbrief.org/patent/us/20240296359/classification-using-quantum-neural-networks"
    }
  ]
}