A Hierarchy for Replica Quantum Advantage
We prove that given the ability to make entangled measurements on at most $k$ replicas of an $n$-qubit state $\rho$ simultaneously, there is a property of $\rho$ which requires at least order $2^n$ measurements to learn. However, the same property only requires one measurement to learn if we can make an entangled measurement over a number of replicas polynomial in $k, n$. Because the above holds for each positive integer $k$, we obtain a hierarchy of tasks necessitating progressively more replicas to be performed efficiently. We introduce a powerful proof technique to establish our results, and also use this to provide new bounds for testing the mixedness of a quantum state.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Revisiting dequantization and quantum advantage in learning tasks
It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing …
Quantum Machine LearningQuantum origin of life: methodological, epistemological and ontological issues
The aim of this essay is to analyze the role of quantum mechanics as an inherent characteristic of life. During the last ten years the problem of the origin of life has become an innovative research subject approached by…
Universal replication of chaotic characteristics by classical and quantum machine learning
Replicating chaotic characteristics of non-linear dynamics by machine learning (ML) has recently drawn wide attentions. In this work, we propose that a ML model, trained to predict the state one-step-ahead from several l…
Quantum Machine LearningNatural Quantization of Neural Networks
We propose a natural quantization of a standard neural network, where the neurons correspond to qubits and the activation functions are implemented via quantum gates and measurements. The simplest quantized neural networ…
QuantizationCan Geometric Quantum Machine Learning Lead to Advantage in Barcode Classification?
We consider the problem of distinguishing two vectors (visualized as images or barcodes) and learning if they are related to one another. For this, we develop a geometric quantum machine learning (GQML) approach with emb…
Quantum Machine Learning