Universal algorithms for quantum data learning

• URL: http://arxiv.org/abs/2210.11850v1
• Date: Fri, 21 Oct 2022 10:13:10 GMT
• Title: Universal algorithms for quantum data learning
• Abstract summary: Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing. We review a line of works dealing with measurements that reveal structural properties of quantum datasets given in the form of product states.
• Score: 0.9786690381850356
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this Perspective, we review a line of works dealing with measurements that reveal structural properties of quantum datasets given in the form of product states. These algorithms are universal, meaning that their performances do not depend on the reference frame in which the dataset is provided. Requiring the universality property implies a characterization of optimal measurements via group representation theory.

Related papers

• From Bits to Qubits: The Theory and Practice of Quantum Data Encoding [6.39129361626032]
  This review provides a comprehensive account of the concepts, algorithms, and practical considerations associated with quantum data encoding.<n>We trace the development from its early conceptual foundations to recent advances.<n>Special attention is given to structured data, such as sparse data, Boolean functions and data represented by tensor networks.
  arXiv  Detail & Related papers  (2026-09-07T23:42:37Z)
• Quantum data encoding as a distinct abstraction layer in the design of quantum circuits [1.1510009152620668]
  We formalize the concept of quantum data encoding, namely the format providing a representation of a data set through a quantum state. We show how major quantum algorithms find a natural interpretation in terms of data loading. The new conceptual framework is exemplified by considering its application to quantum-based Monte Carlo simulations.
  arXiv  Detail & Related papers  (2024-09-14T07:00:58Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  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)
• Quantum Algorithms and Applications for Open Quantum Systems [1.7717834336854132]
  We provide a succinct summary of the fundamental theory of open quantum systems. We then delve into a discussion on recent quantum algorithms. We conclude with a discussion of pertinent applications, demonstrating the applicability of this field to realistic chemical, biological, and material systems.
  arXiv  Detail & Related papers  (2024-06-07T19:02:22Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Feature Map for Quantum Data in Classification [2.2940141855172036]
  A quantum feature map corresponds to an instance with a Hilbert space of quantum states by fueling quantum resources to machine learning algorithms. We present a feature map for quantum data as a probabilistic manipulation of quantum states to improve supervised learning algorithms.
  arXiv  Detail & Related papers  (2023-03-28T01:17:08Z)
• Optimisation-free Classification and Density Estimation with Quantum Circuits [0.0]
  We demonstrate the implementation of a novel machine learning framework for probability density estimation and classification using quantum circuits. The framework maps a training data set or a single data sample to the quantum state of a physical system through quantum feature maps. We discuss a variational quantum circuit approach that could leverage quantum advantage for our framework.
  arXiv  Detail & Related papers  (2022-03-28T02:40:24Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Nearest Centroid Classification on a Trapped Ion Quantum Computer [57.5195654107363]
  We design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations. We experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data.
  arXiv  Detail & Related papers  (2020-12-08T01:10:30Z)

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.