# US 2019/0318053 A1 · Hamiltonian simulation in the interaction picture

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0318053 A1
- Document ID: US20190318053A1
- Status: Published application
- Kind: A1
- Application number: 16/383,365
- Filed: 2019-04-12
- Published: 2019-10-17
- Earliest claimed: 2018-04-12
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Guang Hao Low; Nathan O. Wiebe
- Web page: https://patentgrep.com/patent/US20190318053A1

## CPC

- G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers
- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06N 10/70: Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation
- G06N 10/80: Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers; Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing
- G06F 2111/10: Numerical modelling
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In this disclosure, quantum algorithms are presented for simulating Hamiltonian time-evolution e−i(A+B)t in the interaction picture of quantum mechanics on a quantum computer. The interaction picture is a known analytical tool for separating dynamical effects due to trivial free-evolution A from those due to interactions B. This is especially useful when the energy-scale of the trivial component is dominant, but of little interest. Whereas state-of-art simulation algorithms scale with the energy ∥A+B∥≤∥A∥+∥B∥ of the full Hamiltonian, embodiments of the disclosed approach generally scale linearly with the sum of the Hamiltonian coefficients from the low-energy component B and poly-logarithmically with those from A.

## Claims

### Claim 1

A method, comprising:
configuring a quantum computer to simulate a quantum system, wherein a Hamiltonian in the simulation is represented in the interaction picture; and
performing a simulation of the quantum system using the quantum computer.

### Claim 2 (depends on 1)

The method of claim 1, wherein the simulation of the quantum system is a subroutine that is repeated two or more times.

### Claim 3 (depends on 1)

The method of claim 1, wherein the simulation is performed using linear combinations of unitaries.

### Claim 4 (depends on 3)

The method of claim 3, wherein the simulation uses linear combinations of unitaries performed on a diagonally dominant matrix.

### Claim 5 (depends on 4)

The method of claim 4, wherein the simulation using linear combinations of unitaries is performed on the diagonally dominant components of the diagonally dominant matrix.

### Claim 6 (depends on 1)

The method of claim 1, wherein the quantum system is modelled by a Hubbard model.

### Claim 7 (depends on 1)

The method of claim 1, wherein the quantum system describes a physical chemical system or molecule.

### Claim 8 (depends on 1)

The method of claim 1, wherein the Hamiltonian is sparse and the simulation uses the state of an auxiliary qubit to encode the matrix elements of the Hamiltonian instead of using graph decomposition techniques.

### Claim 9 (depends on 1)

The method of claim 1, further comprising compressing ancillas for quantum simulation of a time-dependent Hamiltonian.

### Claim 10

A method, comprising:
implementing a quantum algorithm on a quantum computer for simulating a general sparse time-dependent quantum system, wherein the quantum algorithm does not use graph decomposition techniques.

### Claim 11 (depends on 10)

The method of claim 10, wherein a quantum Hamiltonian used in the simulation is represented in the interaction picture.

### Claim 12 (depends on 10)

The method of claim 10, wherein the simulation uses linear combinations of unitaries performed on a diagonally dominant matrix.

### Claim 13 (depends on 10)

The method of claim 10, wherein a quantum Hamiltonian used in the simulation is represented in the interaction picture and is chosen to be a diagonal matrix.

### Claim 14 (depends on 10)

The method of claim 10, wherein the quantum system is modelled by a Hubbard model, a physical chemical system, or a molecule.

### Claim 15 (depends on 10)

The method of claim 10, further comprising compressing ancillas used to index a time for the simulation.

### Claim 16

A quantum system, comprising:
a classical computer; and
a quantum computer,
wherein the classical computer is configured to configure the quantum computer to simulate a quantum system within the interaction picture.

### Claim 17 (depends on 16)

The system of claim 16, wherein the simulation is performed in using linear combinations of unitaries.

### Claim 18 (depends on 16)

The system of claim 16, wherein the simulation uses linear combinations of unitaries performed on a diagonally dominant matrix.

### Claim 19 (depends on 16)

The system of claim 16, wherein the quantum system is modelled by a Hubbard model.

### Claim 20 (depends on 16)

The system of claim 16, wherein the simulation is performed at least in part by compressing ancillas used to index evolution time within a quantum simulation of a time-dependent Hamiltonian.
