QKSA: Quantum Knowledge Seeking Agent -- resource-optimized reinforcement learning using quantum process tomography

• URL: http://arxiv.org/abs/2112.03643v1
• Date: Tue, 7 Dec 2021 11:36:54 GMT
• Title: QKSA: Quantum Knowledge Seeking Agent -- resource-optimized reinforcement learning using quantum process tomography
• Authors: Aritra Sarkar, Zaid Al-Ars, Harshitta Gandhi, Koen Bertels
• Abstract summary: We extend the universal reinforcement learning (URL) agent models of artificial general intelligence to quantum environments. The utility function of a classical exploratory Knowledge Seeking Agent, KL-KSA, is generalized to distance measures from quantum information theory. QKSA is the first proposal for a framework that resembles the classical URL models.
• Score: 1.3946983517871423
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In this research, we extend the universal reinforcement learning (URL) agent models of artificial general intelligence to quantum environments. The utility function of a classical exploratory stochastic Knowledge Seeking Agent, KL-KSA, is generalized to distance measures from quantum information theory on density matrices. Quantum process tomography (QPT) algorithms form the tractable subset of programs for modeling environmental dynamics. The optimal QPT policy is selected based on a mutable cost function based on algorithmic complexity as well as computational resource complexity. Instead of Turing machines, we estimate the cost metrics on a high-level language to allow realistic experimentation. The entire agent design is encapsulated in a self-replicating quine which mutates the cost function based on the predictive value of the optimal policy choosing scheme. Thus, multiple agents with pareto-optimal QPT policies evolve using genetic programming, mimicking the development of physical theories each with different resource trade-offs. This formal framework is termed Quantum Knowledge Seeking Agent (QKSA). Despite its importance, few quantum reinforcement learning models exist in contrast to the current thrust in quantum machine learning. QKSA is the first proposal for a framework that resembles the classical URL models. Similar to how AIXI-tl is a resource-bounded active version of Solomonoff universal induction, QKSA is a resource-bounded participatory observer framework to the recently proposed algorithmic information-based reconstruction of quantum mechanics. QKSA can be applied for simulating and studying aspects of quantum information theory. Specifically, we demonstrate that it can be used to accelerate quantum variational algorithms which include tomographic reconstruction as its integral subroutine.

Related papers

• A learning agent-based approach to the characterization of open quantum systems [0.0]
  We introduce the open Quantum Model Learning Agent (oQMLA) framework to account for Markovian noise through the Liouvillian formalism. By simultaneously learning the Hamiltonian and jump operators, oQMLA independently captures both the coherent and incoherent dynamics of a system. We validate our implementation in simulated scenarios of increasing complexity, demonstrating its robustness to hardware-induced measurement errors.
  arXiv  Detail & Related papers  (2025-01-09T16:25:17Z)
• Active Learning with Variational Quantum Circuits for Quantum Process Tomography [6.842224049271109]
  We propose a framework for active learning (AL) to adaptively select a set of informative quantum states that improves the reconstruction most efficiently. We design and evaluate three types of AL algorithms: committee-based, uncertainty-based, and diversity-based. Results demonstrate that our algorithms achieve significantly improved reconstruction compared to the baseline method that selects a set of quantum states randomly.
  arXiv  Detail & Related papers  (2024-12-30T13:12:56Z)
• 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)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Expressive Quantum Supervised Machine Learning using Kerr-nonlinear Parametric Oscillators [0.0]
  Quantum machine learning with variational quantum algorithms (VQA) has been actively investigated as a practical algorithm in the noisy intermediate-scale quantum (NISQ) era. Recent researches reveal that the data reuploading, which repeatedly encode classical data into quantum circuit, is necessary for obtaining the expressive quantum machine learning model. We propose quantum machine learning with Kerrnon Parametric Hilberts (KPOs) as another promising quantum computing device.
  arXiv  Detail & Related papers  (2023-05-01T07:01:45Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Universal resources for quantum computing [0.0]
  We develop the theory of universal resources in the setting of universal quantum computing model (UQCM) We study three natural families of UQCMs in details: the amplitude family, the quasi-probability family, and the Hamiltonian family. It also provides a rigorous framework to resolve puzzles, such as the role of entanglement vs. interference, and unravel resource-theoretic features of quantum algorithms.
  arXiv  Detail & Related papers  (2023-03-07T07:56:38Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Clustering and enhanced classification using a hybrid quantum autoencoder [0.0]
  We propose a novel approach in which the extraction of information from quantum states is undertaken in a classical representational-space. This variational QML algorithm learns to identify, and classically represent, their essential distinguishing characteristics. The analysis and employment of the HQA model are presented in the context of amplitude encoded states.
  arXiv  Detail & Related papers  (2021-07-26T06:50:31Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.