Structured orthogonal random features for kernel-based machine learning
US-2018114145-A1 · Apr 26, 2018 · US
US11295223B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11295223-B2 |
| Application number | US-201816185616-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 9, 2018 |
| Priority date | Jun 12, 2018 |
| Publication date | Apr 5, 2022 |
| Grant date | Apr 5, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
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.
Opening claim text (preview).
What is claimed is: 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. 2. 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. 3. The system of claim 2 , wherein the kernel is a matrix of data mapped to a quantum state after a feature map. 4. The system of claim 3 , wherein the feature map is un-evaluable with fewer than exponential classical resources corresponding to available qubits of the quantum feature map circuit component. 5. The system of claim 4 , wherein the quantum feature map circuit component is operable in a setting with bounded coherence. 6. 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. 7. 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. 8. 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. 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. 10. 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. 11. 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. 12. 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. 13. 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. 14. The computer-implemented method of claim 10 , wherein the feature map is un-evaluable with fewer than exponential resources of available qubits. 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. 16. 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. 17. 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. 18. 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. 19. 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. 20. The computer program product of claim 15 , wherein the feature map is un-evaluable with fewer than exponential resources of available qubits.
Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms · CPC title
Pattern matching networks; Rete networks · CPC title
Machine learning · CPC title
using kernel methods, e.g. support vector machines [SVM] · CPC title
Quantum computing, i.e. information processing based on quantum-mechanical phenomena · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.