Optimal quantum dataset for learning a unitary transformation

• URL: http://arxiv.org/abs/2203.00546v1
• Date: Tue, 1 Mar 2022 15:29:39 GMT
• Title: Optimal quantum dataset for learning a unitary transformation
• Authors: Zhan Yu, Xuanqiang Zhao, Benchi Zhao, Xin Wang
• Abstract summary: How to learn a unitary transformation efficiently is a fundamental problem in quantum machine learning. We introduce a quantum dataset consisting of $n+1$ mixed states that are sufficient for exact training. We show that the size of quantum dataset with mixed states can be reduced to a constant, which yields an optimal quantum dataset for learning a unitary.
• Score: 5.526775342940154
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unitary transformations formulate the time evolution of quantum states. How to learn a unitary transformation efficiently is a fundamental problem in quantum machine learning. The most natural and leading strategy is to train a quantum machine learning model based on a quantum dataset. Although presence of more training data results in better models, using too much data reduces the efficiency of training. In this work, we solve the problem on the minimum size of sufficient quantum datasets for learning a unitary transformation exactly, which reveals the power and limitation of quantum data. First, we prove that the minimum size of dataset with pure states is $2^n$ for learning an $n$-qubit unitary transformation. To fully explore the capability of quantum data, we introduce a quantum dataset consisting of $n+1$ mixed states that are sufficient for exact training. The main idea is to simplify the structure utilizing decoupling, which leads to an exponential improvement on the size over the datasets with pure states. Furthermore, we show that the size of quantum dataset with mixed states can be reduced to a constant, which yields an optimal quantum dataset for learning a unitary. We showcase the applications of our results in oracle compiling and Hamiltonian simulation. Notably, to accurately simulate a 3-qubit one-dimensional nearest-neighbor Heisenberg model, our circuit only uses $48$ elementary quantum gates, which is significantly less than $4320$ gates in the circuit constructed by the Trotter-Suzuki product formula.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Variational quantum regression algorithm with encoded data structure [0.21756081703276003]
  We construct a quantum regression algorithm wherein the quantum state directly encodes the classical data table. We show for the first time explicitly how the linkage of the classical data structure can be taken advantage of directly through quantum subroutines.
  arXiv  Detail & Related papers  (2023-07-07T00:30:16Z)
• MNISQ: A Large-Scale Quantum Circuit Dataset for Machine Learning on/for Quantum Computers in the NISQ era [2.652805765181667]
  MNISQ consists of 4,950,000 data points organized in 9 subdatasets. We deliver a dataset in a dual form: in quantum form, as circuits, and in classical form, as quantum circuit descriptions. In the quantum endeavor, we test our circuit dataset with Quantum Kernel methods, and we show excellent results up to $97%$ accuracy.
  arXiv  Detail & Related papers  (2023-06-29T02:04:14Z)
• VQE-generated Quantum Circuit Dataset for Machine Learning [0.5658123802733283]
  We provide a dataset of quantum circuits optimized by variational quantum eigensolver. We show that this dataset can be easily learned using quantum methods.
  arXiv  Detail & Related papers  (2023-02-20T04:08:44Z)
• Generalization in quantum machine learning from few training data [4.325561431427748]
  Modern quantum machine learning (QML) methods involve variationally optimizing a parameterized quantum circuit on a training data set. We show that the generalization error of a quantum machine learning model with $T$ trainable gates at worst as $sqrtT/N$. We also show that classification of quantum states across a phase transition with a quantum convolutional neural network requires only a very small training data set.
  arXiv  Detail & Related papers  (2021-11-09T17:49:46Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Quantum embeddings for machine learning [5.16230883032882]
  Quantum classifiers are trainable quantum circuits used as machine learning models. We propose to train the first part of the circuit -- the embedding -- with the objective of maximally separating data classes in Hilbert space. This approach provides a powerful analytic framework for quantum machine learning.
  arXiv  Detail & Related papers  (2020-01-10T19:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.