# US 2019/0378025 A1 · Quantum feature kernel estimation

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

- Number: US 2019/0378025 A1
- Document ID: US20190378025A1
- Status: Published application
- Kind: A1
- Application number: 16/185,616
- Filed: 2018-11-09
- Published: 2019-12-12
- Earliest claimed: 2018-06-12
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Antonio Corcoles-Gonzalez; Paul Kristan Temme; Jay M. Gambetta
- Web page: https://patentgrep.com/patent/US20190378025A1

## CPC

- G06N 10/60: Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms
- G06N 5/047: Pattern matching networks; Rete networks
- G06N 20/00: Machine learning
- G06N 20/10: using kernel methods, e.g. support vector machines [SVM]
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Techniques and a system to facilitate quantum computation are provided. In one example, a system includes a processor that executes computer executable components stored in a memory; a quantum feature map circuit component that estimates a kernel associated with a feature map; and a support vector machine component that performs a classification using the estimated kernel.

## Claims

### Claim 1

A system comprising:
a processor that executes computer executable components stored in a memory;
a quantum feature map circuit component that estimates a kernel associated with a feature map; and
a support vector machine component that performs a classification using the estimated kernel.

### Claim 2 (depends on 1)

The system of claim 1, wherein the quantum feature map circuit component comprises a first layer of Hadamard gates operatively coupled to a first global phase gate operatively coupled to a second layer of Hadamard gates operatively coupled to a second global phase gate.

### Claim 3 (depends on 2)

The system of claim 2, wherein the kernel is a matrix of data mapped to a quantum state after a feature map.

### Claim 4 (depends on 3)

The system of claim 3, the feature map is un-evaluable with fewer than exponential classical resources corresponding to available qubits of the quantum feature map circuit component.

### Claim 5 (depends on 4)

The system of claim 4, wherein the quantum feature map circuit component is operable in a setting with bounded coherence.

### Claim 6 (depends on 2)

The system of claim 2, wherein the first global phase gate is defined by a sequence of microwave pulses parameterized by waveform, amplitude and time.

### Claim 7 (depends on 6)

The system of claim 6, wherein the second global phase gate is defined by a sequence of microwave pulses parameterized by waveform, amplitude and time.

### Claim 8 (depends on 2)

The system of claim 2, wherein the first global phase gate is defined by a sequence of single and two qubit phase gates that entangle all qubits in the feature map.

### Claim 9

A computer-implemented method comprising:
using a processor to executes computer executable components stored in a memory;
estimate, by a quantum feature map circuit component operatively coupled to the processor, a kernel associated with a feature map; and
perform a classification using the estimated kernel by a support vector machine component operatively coupled to the processor.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, comprising executing the quantum feature map circuit component using a first layer of Hadamard gates operatively coupled to a first global phase gate operatively coupled to a second layer of Hadamard gates operatively coupled to a second global phase gate.

### Claim 11 (depends on 10)

The computer-implemented method of claim 10, further comprising defining the first global phase gate by a sequence of microwave pulses parameterized by waveform, amplitude and time.

### Claim 12 (depends on 10)

The computer-implemented method of claim 10, further comprising defining the second global phase gate by a sequence of microwave pulses parameterized by waveform, amplitude and time.

### Claim 13 (depends on 10)

The computer-implemented method of claim 10, further comprising defining the first global phase gate by a sequence of single and two qubit phase gates that entangle all qubits in the feature map.

### Claim 14 (depends on 10)

The computer-implemented method of claim 10, wherein the feature map is un-evaluable with fewer than exponential resources of available qubits.

### Claim 15

A computer program product for facilitating quantum programming, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:
estimate, by the processor, a kernel associated with a feature map; and
perform, by the processor, a classification using the estimated kernel.

### Claim 16 (depends on 15)

The computer program product of claim 15, the program instructions executable by the processor to cause the processor to: execute the quantum feature map circuit component using a first layer of Hadamard gates operatively coupled to a first global phase gate operatively coupled to a second layer of Hadamard gates operatively coupled to a second global phase gate.

### Claim 17 (depends on 16)

The computer program product of claim 16, the program instructions executable by the processor to cause the processor to define the first global phase gate by a sequence of microwave pulses parameterized by waveform, amplitude and time.

### Claim 18 (depends on 16)

The computer program product of claim 16, the program instructions executable by the processor to cause the processor to define the second global phase gate by a sequence of microwave pulses parameterized by waveform, amplitude and time.

### Claim 19 (depends on 16)

The computer program product of claim 16, the program instructions executable by the processor to cause the processor to define the first global phase gate by a sequence of single and two qubit phase gates that entangle all qubits in the feature map.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein the feature map is un-evaluable with fewer than exponential resources of available qubits.
