Quantum contextual bandits and recommender systems for quantum data

• URL: http://arxiv.org/abs/2301.13524v1
• Date: Tue, 31 Jan 2023 10:17:53 GMT
• Title: Quantum contextual bandits and recommender systems for quantum data
• Authors: Shrigyan Brahmachari, Josep Lumbreras, Marco Tomamichel
• Abstract summary: We study a recommender system for quantum data using the linear contextual bandit framework. We formulate the low energy quantum state recommendation problem where the context is a Hamiltonian. We observe that if we interpret the actions as different phases of the models then the recommendation is done by classifying the correct phase of the given Hamiltonian.
• Score: 13.213490507208528
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study a recommender system for quantum data using the linear contextual bandit framework. In each round, a learner receives an observable (the context) and has to recommend from a finite set of unknown quantum states (the actions) which one to measure. The learner has the goal of maximizing the reward in each round, that is the outcome of the measurement on the unknown state. Using this model we formulate the low energy quantum state recommendation problem where the context is a Hamiltonian and the goal is to recommend the state with the lowest energy. For this task, we study two families of contexts: the Ising model and a generalized cluster model. We observe that if we interpret the actions as different phases of the models then the recommendation is done by classifying the correct phase of the given Hamiltonian and the strategy can be interpreted as an online quantum phase classifier.

Related papers

• Unsupervised Learning to Recognize Quantum Phases of Matter [39.146761527401424]
  In this work we adopt unsupervised learning, where the algorithm has no access to any priorly labeled states.<n>We benchmark our method with two specific spin-$frac12$ chains, with states determined via tensor network techniques.<n>Our results show how unsupervised learning can autonomously recognize and possibly unveil novel phases of quantum matter.
  arXiv  Detail & Related papers  (2025-10-16T14:45:54Z)
• Bandits roaming Hilbert space [0.7614628596146601]
  We study the exploration and exploitation trade-off in online learning of properties of quantum states using multi-armed bandits.<n>We derive information-theoretic lower bounds and optimal strategies with matching upper bounds, showing regret scales as the square root of rounds.
  arXiv  Detail & Related papers  (2025-09-29T10:26:29Z)
• Resource-Free Quantum Hamiltonian Learning Below the Standard Quantum Limit [0.0]
  We demonstrate a method that surpasses the standard quantum limit without requiring entanglement resources, coherent measurements, or dynamical control.<n>Our method relies on trajectory-based Hamiltonian learning, in which we apply local, randomized pre-processing to probe states.<n>Our numerics show that our method needs only one shot per Pauli measurement, making it well-suited for experimental scenarios.
  arXiv  Detail & Related papers  (2025-07-28T22:41:36Z)
• A hybrid method for quantum dynamics simulation [2.6340447642310383]
  We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. Our method predicts observables of a quantum state in the long time by using data from a set of short time measurements from a quantum computer.
  arXiv  Detail & Related papers  (2023-07-27T23:43:13Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Optimizing local Hamiltonians for the best metrological performance [0.0]
  We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. We present the quantum Fisher information in a bilinear form and maximize it by iterating a see-saw. We consider a number of other problems in quantum information theory that can be solved in a similar manner.
  arXiv  Detail & Related papers  (2022-06-06T18:01:03Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• From geometry to coherent dissipative dynamics in quantum mechanics [68.8204255655161]
  We work out the case of finite-level systems, for which it is shown by means of the corresponding contact master equation. We describe quantum decays in a 2-level system as coherent and continuous processes.
  arXiv  Detail & Related papers  (2021-07-29T18:27:38Z)
• A Theoretical Framework for Learning from Quantum Data [15.828697880068704]
  We propose a theoretical foundation for learning classical patterns from quantum data. We present a quantum counterpart of the well-known PAC framework. We establish upper bounds on the quantum sample complexity quantum concept classes.
  arXiv  Detail & Related papers  (2021-07-13T21:39:47Z)
• Eigenvalues and Eigenstates of Quantum Rabi Model [0.0]
  We present an approach to the exact diagonalization of the quantum Rabi Hamiltonian. It is shown that the obtained eigenstates can be represented in the basis of the eigenstates of the Jaynes-Cummings Hamiltonian.
  arXiv  Detail & Related papers  (2021-04-26T17:45:41Z)
• Hamiltonian operator approximation for energy measurement and ground state preparation [23.87373187143897]
  We show how to approximate the Hamiltonian operator as a sum of propagators using a differential representation. The proposed approach, named Hamiltonian operator approximation (HOA), is designed to benefit analog quantum simulators.
  arXiv  Detail & Related papers  (2020-09-07T18:11:00Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Variational Quantum Eigensolver for Frustrated Quantum Systems [0.0]
  A variational quantum eigensolver, or VQE, is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian. Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions. We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits.
  arXiv  Detail & Related papers  (2020-05-01T18: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.