ArtA: Automating Design Space Exploration of Spin Qubit Architectures
- URL: http://arxiv.org/abs/2407.18151v1
- Date: Thu, 25 Jul 2024 16:02:44 GMT
- Title: ArtA: Automating Design Space Exploration of Spin Qubit Architectures
- Authors: Nikiforos Paraskevopoulos, David Hamel, Aritra Sarkar, Carmen G. Almudever, Sebastian Feld,
- Abstract summary: This paper introduces the first Design Space Exploration (DSE) for quantum-dot spin-qubit architectures.
ArtA can leverage seventeen optimization method configurations, significantly reducing exploration times by up to 99.1%.
After a comprehensive evaluation of best-matching optimization configurations per quantum circuit, ArtA suggests universal architectural features that perform optimally across all examined circuits.
- Score: 1.1528488253382057
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: In the fast-paced field of quantum computing, identifying the architectural characteristics that will enable quantum processors to achieve high performance across a diverse range of quantum algorithms continues to pose a significant challenge. Given the extensive and costly nature of experimentally testing different designs, this paper introduces the first Design Space Exploration (DSE) for quantum-dot spin-qubit architectures. Utilizing the upgraded SpinQ compilation framework, this study explores a substantial design space comprising 29,312 spin-qubit-based architectures and applies an innovative optimization tool, ArtA (Artificial Architect), to speed up the design space traversal. ArtA can leverage seventeen optimization method configurations, significantly reducing exploration times by up to 99.1% compared to a traditional brute force approach while maintaining the same result quality. After a comprehensive evaluation of best-matching optimization configurations per quantum circuit, ArtA suggests universal architectural features that perform optimally across all examined circuits, emphasizing the importance of maximizing quantum gate parallelization at the expense of more crosstalk interference.
Related papers
- 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) - 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) - Curriculum reinforcement learning for quantum architecture search under
hardware errors [1.583327010995414]
This work introduces a curriculum-based reinforcement learning QAS (CRLQAS) designed to tackle challenges in VQA deployment.
The algorithm incorporates (i) a 3D architecture encoding and restrictions on environment dynamics to explore the search space of possible circuits efficiently.
To facilitate studies, we developed an optimized simulator for our algorithm, significantly improving computational efficiency in noisy quantum circuits.
arXiv Detail & Related papers (2024-02-05T20:33:00Z) - 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) - Domain-Specific Quantum Architecture Optimization [7.274584978257831]
We present a framework for optimizing quantum architectures, specifically through customizing qubit connectivity.
It is the first work that provides performance guarantees by integrating architecture optimization with an optimal compiler.
We demonstrate up to 59% fidelity improvement in simulation by optimizing the heavy-hexagon architecture for QAOA circuits, and up to 14% improvement on the grid architecture.
arXiv Detail & Related papers (2022-07-29T05:16:02Z) - 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) - iDARTS: Differentiable Architecture Search with Stochastic Implicit
Gradients [75.41173109807735]
Differentiable ARchiTecture Search (DARTS) has recently become the mainstream of neural architecture search (NAS)
We tackle the hypergradient computation in DARTS based on the implicit function theorem.
We show that the architecture optimisation with the proposed method, named iDARTS, is expected to converge to a stationary point.
arXiv Detail & Related papers (2021-06-21T00:44:11Z) - 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) - 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) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.