Single-shot quantum machine learning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Recio-Armengol, Erik, Eisert, Jens, Meyer, Johannes Jakob
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916692187152384
author Recio-Armengol, Erik
Eisert, Jens
Meyer, Johannes Jakob
author_facet Recio-Armengol, Erik
Eisert, Jens
Meyer, Johannes Jakob
contents Quantum machine learning aims to improve learning methods through the use of quantum computers. If it is to ever realize its potential, many obstacles need to be overcome. A particularly pressing one arises at the prediction stage because the outputs of quantum learning models are inherently random. This creates an often considerable overhead, as many executions of a quantum learning model have to be aggregated to obtain an actual prediction. In this work, we analyze when quantum learning models can evade this issue and produce predictions in a near-deterministic way -- paving the way to single-shot quantum machine learning. We give a rigorous definition of single-shotness in quantum classifiers and show that the degree to which a quantum learning model is near-deterministic is constrained by the distinguishability of the embedded quantum states used in the model. Opening the black box of the embedding, we show that if the embedding is realized by quantum circuits, a certain depth is necessary for single-shotness to be even possible. We conclude by showing that quantum learning models cannot be single-shot in a generic way and trainable at the same time.
format Preprint
id arxiv_https___arxiv_org_abs_2406_13812
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Single-shot quantum machine learning
Recio-Armengol, Erik
Eisert, Jens
Meyer, Johannes Jakob
Quantum Physics
Quantum machine learning aims to improve learning methods through the use of quantum computers. If it is to ever realize its potential, many obstacles need to be overcome. A particularly pressing one arises at the prediction stage because the outputs of quantum learning models are inherently random. This creates an often considerable overhead, as many executions of a quantum learning model have to be aggregated to obtain an actual prediction. In this work, we analyze when quantum learning models can evade this issue and produce predictions in a near-deterministic way -- paving the way to single-shot quantum machine learning. We give a rigorous definition of single-shotness in quantum classifiers and show that the degree to which a quantum learning model is near-deterministic is constrained by the distinguishability of the embedded quantum states used in the model. Opening the black box of the embedding, we show that if the embedding is realized by quantum circuits, a certain depth is necessary for single-shotness to be even possible. We conclude by showing that quantum learning models cannot be single-shot in a generic way and trainable at the same time.
title Single-shot quantum machine learning
topic Quantum Physics
url https://arxiv.org/abs/2406.13812