The Learnability of Unknown Quantum Measurements

01/03/2015
by   Hao-Chung Cheng, et al.
0

Quantum machine learning has received significant attention in recent years, and promising progress has been made in the development of quantum algorithms to speed up traditional machine learning tasks. In this work, however, we focus on investigating the information-theoretic upper bounds of sample complexity - how many training samples are sufficient to predict the future behaviour of an unknown target function. This kind of problem is, arguably, one of the most fundamental problems in statistical learning theory and the bounds for practical settings can be completely characterised by a simple measure of complexity. Our main result in the paper is that, for learning an unknown quantum measurement, the upper bound, given by the fat-shattering dimension, is linearly proportional to the dimension of the underlying Hilbert space. Learning an unknown quantum state becomes a dual problem to ours, and as a byproduct, we can recover Aaronson's famous result [Proc. R. Soc. A 463:3089-3144 (2007)] solely using a classical machine learning technique. In addition, other famous complexity measures like covering numbers and Rademacher complexities are derived explicitly. We are able to connect measures of sample complexity with various areas in quantum information science, e.g. quantum state/measurement tomography, quantum state discrimination and quantum random access codes, which may be of independent interest. Lastly, with the assistance of general Bloch-sphere representation, we show that learning quantum measurements/states can be mathematically formulated as a neural network. Consequently, classical ML algorithms can be applied to efficiently accomplish the two quantum learning tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2020

Binary Classification with Classical Instances and Quantum Labels

In classical statistical learning theory, one of the most well studied p...
research
01/07/2019

A New Perspective on Machine Learning: How to do Perfect Supervised Learning

In this work, we introduce the concept of bandlimiting into the theory o...
research
09/20/2023

Statistical Complexity of Quantum Learning

Recent years have seen significant activity on the problem of using data...
research
07/13/2021

A Theoretical Framework for Learning from Quantum Data

Over decades traditional information theory of source and channel coding...
research
11/23/2020

Classical Shadows with Noise

The classical shadows protocol, recently introduced by Huang, Keung, and...
research
07/21/2020

Graph-theoretic approach to dimension witnessing

A fundamental problem in quantum computation and quantum information is ...
research
06/23/2022

Quantum Approximation of Normalized Schatten Norms and Applications to Learning

Efficient measures to determine similarity of quantum states, such as th...

Please sign up or login with your details

Forgot password? Click here to reset