Quantum Architecture Search with Meta-learning

• URL: http://arxiv.org/abs/2106.06248v2
• Date: Wed, 24 Nov 2021 06:46:46 GMT
• Title: Quantum Architecture Search with Meta-learning
• Authors: Zhimin He, Chuangtao Chen, Lvzhou Li, Shenggen Zheng, Haozhen Situ
• Abstract summary: Variational quantum algorithms (VQAs) have been successfully applied to quantum approximate optimization algorithms, variational quantum compiling and quantum machine learning models. Quantum architecture search (QAS) aims to automate the design of quantum circuits with classical optimization algorithms.
• Score: 0.18899300124593643
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms (VQAs) have been successfully applied to quantum approximate optimization algorithms, variational quantum compiling and quantum machine learning models. The performances of VQAs largely depend on the architecture of parameterized quantum circuits (PQCs). Quantum architecture search (QAS) aims to automate the design of PQCs in different VQAs with classical optimization algorithms. However, current QAS algorithms do not use prior experiences and search the quantum architecture from scratch for each new task, which is inefficient and time consuming. In this paper, we propose a meta quantum architecture search (MetaQAS) algorithm, which learns good initialization heuristics of the architecture (i.e., meta-architecture), along with the meta-parameters of quantum gates from a number of training tasks such that they can adapt to new tasks with a small number of gradient updates, which leads to fast learning on new tasks. The proposed MetaQAS can be used with arbitrary gradient-based QAS algorithms. Simulation results of variational quantum compiling on three- and four-qubit circuits show that the architectures optimized by MetaQAS converge much faster than a state-of-the-art gradient-based QAS algorithm, namely DQAS. MetaQAS also achieves a better solution than DQAS after fine-tuning of gate parameters.

Related papers

• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Qubit-Wise Architecture Search Method for Variational Quantum Circuits [11.790545710021593]
  We propose a novel qubit-wise architec-ture search (QWAS) method, which progres-sively search one-qubit configuration per stage. Our proposed method can balance the exploration and exploitation of cir-cuit performance and size in some real-world tasks, such as MNIST, Fashion and MOSI.
  arXiv  Detail & Related papers  (2024-03-07T07:08:57Z)
• 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)
• 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)
• 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 on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Variational quantum compiling with double Q-learning [0.37798600249187286]
  We propose a variational quantum compiling (VQC) algorithm based on reinforcement learning (RL) An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by double Q-learning. It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices.
  arXiv  Detail & Related papers  (2021-03-22T06:46:35Z)
• 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)

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.