Quantum Circuit Design Search

• URL: http://arxiv.org/abs/2012.04046v2
• Date: Mon, 4 Jan 2021 08:52:27 GMT
• Title: Quantum Circuit Design Search
• Authors: Mohammad Pirhooshyaran, Tamas Terlaky
• Abstract summary: This article explores search strategies for the design of parameterized quantum circuits. We propose several optimization approaches including random search plus survival of the fittest. We introduce nontrivial circuit architectures that are arduous to be hand-designed and efficient in terms of trainability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This article explores search strategies for the design of parameterized quantum circuits. We propose several optimization approaches including random search plus survival of the fittest, reinforcement learning both with classical and hybrid quantum classical controllers and Bayesian optimization as decision makers to design a quantum circuit in an automated way for a specific task such as multi-labeled classification over a dataset. We introduce nontrivial circuit architectures that are arduous to be hand-designed and efficient in terms of trainability. In addition, we introduce reuploading of initial data into quantum circuits as an option to find more general designs. We numerically show that some of the suggested architectures for the Iris dataset accomplish better results compared to the established parameterized quantum circuit designs in the literature. In addition, we investigate the trainability of these structures on the unseen dataset Glass. We report meaningful advantages over the benchmarks for the classification of the Glass dataset which supports the fact that the suggested designs are inherently more trainable.

Related papers

• A General Framework for Gradient-Based Optimization of Superconducting Quantum Circuits using Qubit Discovery as a Case Study [0.19528996680336308]
  We present a comprehensive framework for the gradient-based optimization of superconducting quantum circuits. We apply this framework to the qubit discovery problem, demonstrating its effectiveness in identifying qubit designs with superior performance metrics.
  arXiv  Detail & Related papers  (2024-08-22T19:46:50Z)
• Reinforcement learning-based architecture search for quantum machine learning [4.34233919529354]
  Quantum machine learning models use encoding circuits to map data into a quantum Hilbert space. We present a novel approach using reinforcement learning techniques to generate problem-specific encoding circuits. Our results highlight the effectiveness of problem-specific encoding circuits in enhancing QML model performance.
  arXiv  Detail & Related papers  (2024-06-04T19:00:42Z)
• Quantum Vision Transformers for Quark-Gluon Classification [3.350407101925898]
  We introduce a hybrid quantum-classical vision transformer architecture, notable for its integration of variational quantum circuits. We evaluate our method by applying the model to multi-detector jet images from CMS Open Data.
  arXiv  Detail & Related papers  (2024-05-16T17:45:54Z)
• An RNN-policy gradient approach for quantum architecture search [7.616832563471534]
  Variational quantum circuits are one of the promising ways to exploit the advantages of quantum computing. The design of the quantum circuit architecture might greatly affect the performance capability of the quantum algorithms. The quantum architecture search is the process of automatically designing quantum circuit architecture.
  arXiv  Detail & Related papers  (2024-05-09T16:44:35Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Simulation Paths for Quantum Circuit Simulation with Decision Diagrams [72.03286471602073]
  We study the importance of the path that is chosen when simulating quantum circuits using decision diagrams. We propose an open-source framework that allows to investigate dedicated simulation paths.
  arXiv  Detail & Related papers  (2022-03-01T19:00:11Z)
• Quantum Embedding Search for Quantum Machine Learning [2.7612093695074456]
  We introduce a novel quantum embedding search algorithm (QES), pronounced as "quest" We establish the connection between the structures of quantum embedding and the representations of directed multi-graphs, enabling a well-defined search space. We demonstrate the feasibility of our proposed approach on synthesis and Iris datasets, which empirically shows that quantum embedding architecture by QES outperforms manual designs.
  arXiv  Detail & Related papers  (2021-05-25T11:50:57Z)
• Quantum Machine Learning with SQUID [64.53556573827525]
  We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
  arXiv  Detail & Related papers  (2021-04-30T21:34:11Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• 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.