Quantum Learnability is Arbitrarily Distillable

• URL: http://arxiv.org/abs/2104.09520v1
• Date: Mon, 19 Apr 2021 18:00:02 GMT
• Title: Quantum Learnability is Arbitrarily Distillable
• Authors: Joe H. Jenne, David R. M. Arvidsson-Shukur
• Abstract summary: Quantum learning involves estimating unknown parameters from measurements of quantum states. In several scenarios, it is advantageous to concentrate information in as few states as possible.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum learning (in metrology and machine learning) involves estimating unknown parameters from measurements of quantum states. The quantum Fisher information matrix can bound the average amount of information learnt about the unknown parameters per experimental trial. In several scenarios, it is advantageous to concentrate information in as few states as possible. Here, we present two "go-go" theorems proving that negativity, a narrower nonclassicality concept than noncommutation, enables unbounded and lossless distillation of Fisher information about multiple parameters in quantum learning.

Related papers

• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• 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)
• Direct measurement of quantum Fisher information [5.067521928161945]
  In the adiabatic perturbation theory, Berry curvature is related to the generalized force, and the quantum metric tensor is linked with energy fluctuation. In this article, we first adopt an alternative way to derive the link of energy fluctuation to the quantum Fisher information. We numerically testify the direct extraction of the quantum Fisher information based on adiabatic perturbation in two-level systems.
  arXiv  Detail & Related papers  (2022-08-05T13:07:31Z)
• Scalable approach to many-body localization via quantum data [69.3939291118954]
  Many-body localization is a notoriously difficult phenomenon from quantum many-body physics. We propose a flexible neural network based learning approach that circumvents any computationally expensive step. Our approach can be applied to large-scale quantum experiments to provide new insights into quantum many-body physics.
  arXiv  Detail & Related papers  (2022-02-17T19:00:09Z)
• Quantum Fisher information from randomized measurements [0.0]
  The quantum Fisher information (QFI) is a fundamental quantity of interest in many areas. We use measurements of the density matrix to construct lower bounds that converge to the QFI. We present two examples of applications of the method in quantum systems made of coupled qubits and collective spins.
  arXiv  Detail & Related papers  (2021-05-27T14:16:14Z)
• Quantifying Unknown Entanglement by Neural Networks [1.6629141734354616]
  We train neural networks to quantify unknown entanglement, where the input features of neural networks are the outcome statistics data produced by locally measuring target quantum states. It turns out that the neural networks we train have very good performance in quantifying unknown quantum states.
  arXiv  Detail & Related papers  (2021-04-26T12:50:25Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• No Free Lunch for Quantum Machine Learning [0.0]
  We find a lower bound on the quantum risk of a quantum learning algorithm trained via pairs of input and output states when averaged over training pairs and unitaries.
  arXiv  Detail & Related papers  (2020-03-31T11:19:41Z)
• Quantum Fisher information measurement and verification of the quantum Cram\'er-Rao bound in a solid-state qubit [11.87072483257275]
  We experimentally demonstrate near saturation of the quantum Cram'er-Rao bound in the phase estimation of a solid-state spin system. This is achieved by comparing the experimental uncertainty in phase estimation with an independent measurement of the related quantum Fisher information.
  arXiv  Detail & Related papers  (2020-03-18T17:51:06Z)
• Entropic Uncertainty Relations and the Quantum-to-Classical transition [77.34726150561087]
  We aim to shed some light on the quantum-to-classical transition as seen through the analysis of uncertainty relations. We employ entropic uncertainty relations to show that it is only by the inclusion of imprecision in our model of macroscopic measurements that we can prepare a system with two simultaneously well-defined quantities.
  arXiv  Detail & Related papers  (2020-03-04T14:01:17Z)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.