Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2105.03406 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913452880035840 |
|---|---|
| author | Glick, Jennifer R. Gujarati, Tanvi P. Corcoles, Antonio D. Kim, Youngseok Kandala, Abhinav Gambetta, Jay M. Temme, Kristan |
| author_facet | Glick, Jennifer R. Gujarati, Tanvi P. Corcoles, Antonio D. Kim, Youngseok Kandala, Abhinav Gambetta, Jay M. Temme, Kristan |
| contents | The use of kernel functions is a common technique to extract important features from data sets. A quantum computer can be used to estimate kernel entries as transition amplitudes of unitary circuits. Quantum kernels exist that, subject to computational hardness assumptions, cannot be computed classically. It is an important challenge to find quantum kernels that provide an advantage in the classification of real-world data. We introduce a class of quantum kernels that can be used for data with a group structure. The kernel is defined in terms of a unitary representation of the group and a fiducial state that can be optimized using a technique called kernel alignment. We apply this method to a learning problem on a coset-space that embodies the structure of many essential learning problems on groups. We implement the learning algorithm with $27$ qubits on a superconducting processor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2105_03406 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Covariant quantum kernels for data with group structure Glick, Jennifer R. Gujarati, Tanvi P. Corcoles, Antonio D. Kim, Youngseok Kandala, Abhinav Gambetta, Jay M. Temme, Kristan Quantum Physics The use of kernel functions is a common technique to extract important features from data sets. A quantum computer can be used to estimate kernel entries as transition amplitudes of unitary circuits. Quantum kernels exist that, subject to computational hardness assumptions, cannot be computed classically. It is an important challenge to find quantum kernels that provide an advantage in the classification of real-world data. We introduce a class of quantum kernels that can be used for data with a group structure. The kernel is defined in terms of a unitary representation of the group and a fiducial state that can be optimized using a technique called kernel alignment. We apply this method to a learning problem on a coset-space that embodies the structure of many essential learning problems on groups. We implement the learning algorithm with $27$ qubits on a superconducting processor. |
| title | Covariant quantum kernels for data with group structure |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2105.03406 |