Differentiable Quantum Architecture Search for Quantum Reinforcement Learning

• URL: http://arxiv.org/abs/2309.10392v2
• Date: Wed, 20 Sep 2023 07:54:05 GMT
• Title: Differentiable Quantum Architecture Search for Quantum Reinforcement Learning
• Authors: Yize Sun, Yunpu Ma, Volker Tresp
• Abstract summary: Differentiable quantum architecture search (DQAS) is a gradient-based framework to design quantum circuits automatically in the NISQ era. This work is the first to show that gradient-based quantum architecture search is applicable to quantum deep Q-learning tasks.
• Score: 30.324343192917606
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Differentiable quantum architecture search (DQAS) is a gradient-based framework to design quantum circuits automatically in the NISQ era. It was motivated by such as low fidelity of quantum hardware, low flexibility of circuit architecture, high circuit design cost, barren plateau (BP) problem, and periodicity of weights. People used it to address error mitigation, unitary decomposition, and quantum approximation optimization problems based on fixed datasets. Quantum reinforcement learning (QRL) is a part of quantum machine learning and often has various data. QRL usually uses a manually designed circuit. However, the pre-defined circuit needs more flexibility for different tasks, and the circuit design based on various datasets could become intractable in the case of a large circuit. The problem of whether DQAS can be applied to quantum deep Q-learning with various datasets is still open. The main target of this work is to discover the capability of DQAS to solve quantum deep Q-learning problems. We apply a gradient-based framework DQAS on reinforcement learning tasks and evaluate it in two different environments - cart pole and frozen lake. It contains input- and output weights, progressive search, and other new features. The experiments conclude that DQAS can design quantum circuits automatically and efficiently. The evaluation results show significant outperformance compared to the manually designed circuit. Furthermore, the performance of the automatically created circuit depends on whether the super-circuit learned well during the training process. This work is the first to show that gradient-based quantum architecture search is applicable to QRL tasks.

Related papers

• Differentiable Quantum Architecture Search in Asynchronous Quantum Reinforcement Learning [3.6881738506505988]
  We propose differentiable quantum architecture search (DiffQAS) to enable trainable circuit parameters and structure weights. We show that our proposed DiffQAS-QRL approach achieves performance comparable to manually-crafted circuit architectures.
  arXiv  Detail & Related papers  (2024-07-25T17:11:00Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Differentiable Quantum Architecture Search For Job Shop Scheduling Problem [28.023245103554245]
  Job shop scheduling problem (JSSP) plays a pivotal role in industrial applications. Finding a good circuit architecture is task-specific and time-consuming. JSSP-DQAS can automatically find noise-resilient circuit architectures that perform much better than manually designed circuits.
  arXiv  Detail & Related papers  (2024-01-02T11:24:09Z)
• 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)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• GSQAS: Graph Self-supervised Quantum Architecture Search [0.18899300124593643]
  Existing Quantum Architecture Search (QAS) algorithms require to evaluate a large number of quantum circuits during the search process. We propose GSQAS, a graph self-supervised QAS, which trains a predictor based on self-supervised learning. GSQAS outperforms the state-of-the-art predictor-based QAS, achieving better performance with fewer labeled circuits.
  arXiv  Detail & Related papers  (2023-03-22T08:35:28Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [59.07246314484875]
  TeD-Q is an open-source software framework for quantum machine learning. It seamlessly integrates classical machine learning libraries with quantum simulators. It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Quantum Deep Dreaming: A Novel Approach for Quantum Circuit Design [0.0]
  Quantum Deep Dreaming (QDD) is an algorithm that generates optimal quantum circuit architectures for specified objectives. We demonstrate that QDD successfully generates, or 'dreams', circuits of six qubits close to ground state energy.
  arXiv  Detail & Related papers  (2022-11-05T22:16:10Z)
• Learning capability of parametrized quantum circuits [2.51657752676152]
  Variational quantum algorithms (VQAs) and their applications in the field of quantum machine learning through parametrized quantum circuits (PQCs) are thought to be one major way of leveraging noisy intermediate-scale quantum computing devices. In this paper, we build upon the work by Schuld et al. and compare popular ans"atze for PQCs through the new measure of learning capability. We also examine dissipative quantum neural networks (dQNN) as introduced by Beer et al. and propose a data re-upload structure for dQNNs to increase their learning capability.
  arXiv  Detail & Related papers  (2022-09-21T13:26:20Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Differentiable Quantum Architecture Search [15.045985536395479]
  We propose a general framework of differentiable quantum architecture search (DQAS) DQAS enables automated designs of quantum circuits in an end-to-end differentiable fashion.
  arXiv  Detail & Related papers  (2020-10-16T18:00:03Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.