QArchSearch: A Scalable Quantum Architecture Search Package

• URL: http://arxiv.org/abs/2310.07858v1
• Date: Wed, 11 Oct 2023 20:00:33 GMT
• Title: QArchSearch: A Scalable Quantum Architecture Search Package
• Authors: Ankit Kulshrestha, Danylo Lykov, Ilya Safro, Yuri Alexeev
• Abstract summary: We present textttQArchSearch, an AI based quantum architecture search package with the textttQTensor library as a backend. We show that the search package is able to efficiently scale the search to large quantum circuits and enables the exploration of more complex models for different quantum applications.
• Score: 1.725192300740999
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The current era of quantum computing has yielded several algorithms that promise high computational efficiency. While the algorithms are sound in theory and can provide potentially exponential speedup, there is little guidance on how to design proper quantum circuits to realize the appropriate unitary transformation to be applied to the input quantum state. In this paper, we present \texttt{QArchSearch}, an AI based quantum architecture search package with the \texttt{QTensor} library as a backend that provides a principled and automated approach to finding the best model given a task and input quantum state. We show that the search package is able to efficiently scale the search to large quantum circuits and enables the exploration of more complex models for different quantum applications. \texttt{QArchSearch} runs at scale and high efficiency on high-performance computing systems using a two-level parallelization scheme on both CPUs and GPUs, which has been demonstrated on the Polaris supercomputer.

Related papers

• Q-gen: A Parameterized Quantum Circuit Generator [0.6062751776009752]
  We introduce Q-gen, a high-level, parameterized quantum circuit generator incorporating 15 realistic quantum algorithms. Q-gen is an open-source project that serves as the entrance for users with a classical computer science background to dive into the world of quantum computing.
  arXiv  Detail & Related papers  (2024-07-26T12:22:40Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• 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)
• Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
  This thesis develops two main techniques to reduce the quantum computational resource requirements. The aim is to scale up application sizes on current quantum processors. While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
  arXiv  Detail & Related papers  (2024-03-01T19:36:35Z)
• 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)
• Quantum Architecture Search with Unsupervised Representation Learning [24.698519892763283]
  Unsupervised representation learning presents new opportunities for advancing Quantum Architecture Search (QAS) QAS is designed to optimize quantum circuits for Variational Quantum Algorithms (VQAs)
  arXiv  Detail & Related papers  (2024-01-21T19:53:17Z)
• 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)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Parametrized Complexity of Quantum Inspired Algorithms [0.0]
  Two promising areas of quantum algorithms are quantum machine learning and quantum optimization. Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms.
  arXiv  Detail & Related papers  (2021-12-22T06:19:36Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.