Mapping quantum algorithms to multi-core quantum computing architectures

• URL: http://arxiv.org/abs/2303.16125v1
• Date: Tue, 28 Mar 2023 16:46:59 GMT
• Title: Mapping quantum algorithms to multi-core quantum computing architectures
• Authors: Anabel Ovide, Santiago Rodrigo, Medina Bandic, Hans Van Someren, Sebastian Feld, Sergi Abadal, Eduard Alarcon, and Carmen G. Almudever
• Abstract summary: Multi-core quantum computer architecture poses new challenges such as expensive inter-core communication. A detailed critical discussion of the quantum circuit mapping problem for multi-core quantum computing architectures is provided. We further explore the performance of a mapping method, which is formulated as a partitioning over time graph problem.
• Score: 1.8602413562219944
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Current monolithic quantum computer architectures have limited scalability. One promising approach for scaling them up is to use a modular or multi-core architecture, in which different quantum processors (cores) are connected via quantum and classical links. This new architectural design poses new challenges such as the expensive inter-core communication. To reduce these movements when executing a quantum algorithm, an efficient mapping technique is required. In this paper, a detailed critical discussion of the quantum circuit mapping problem for multi-core quantum computing architectures is provided. In addition, we further explore the performance of a mapping method, which is formulated as a partitioning over time graph problem, by performing an architectural scalability analysis.

Related papers

• 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)
• Attention-Based Deep Reinforcement Learning for Qubit Allocation in Modular Quantum Architectures [1.8781124875646162]
  This research contributes to the advancement of scalable quantum computing systems by introducing a novel learning-based approach for efficient quantum circuit compilation and mapping. In this work, we propose a novel approach employing Deep Reinforcement Learning (DRL) methods to learn theses for a specific multi-core architecture.
  arXiv  Detail & Related papers  (2024-06-17T12:09:11Z)
• Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era [2.465579331213113]
  We introduce the Hungarian Qubit Assignment (HQA) algorithm, a multi-core mapping algorithm designed to optimize qubit assignments to cores with the aim of reducing inter-core communications. Our evaluation of HQA against state-of-the-art circuit mapping algorithms for modular architectures reveals a $4.9times$ and $1.6times$ improvement in terms of execution time and non-local communications.
  arXiv  Detail & Related papers  (2024-03-25T21:31:39Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Circuit Partitioning for Multi-Core Quantum Architectures with Deep Reinforcement Learning [3.65246419631361]
  Multi-core quantum architectures are proposed to solve the scalability problem. One of these challenges is to adapt a quantum algorithm to fit within the different cores of the quantum computer. This paper presents a novel approach for circuit partitioning using Deep Reinforcement Learning.
  arXiv  Detail & Related papers  (2024-01-31T16:33:12Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures [2.465579331213113]
  We present a pioneering characterization of the era of monolithic-temporal inter-core qubit traffic in large-scale circuits. The programs are executed on an all-to-all connected-core architecture that supports up to around 1000 qubits. Based on the showcased results, we provide a set of guidelines to improve mapping quantum circuits to multi-core processors, and lay the foundations of benchmarking large-scale multi-core architectures.
  arXiv  Detail & Related papers  (2023-10-03T09:54:41Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00: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)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Exploring a Double Full-Stack Communications-Enabled Architecture for Multi-Core Quantum Computers [0.0]
  We propose a double full-stack architecture encompassing quantum computation and quantum communications. Using behavioral models and actual measurements from existing quantum computers, the results of simulations suggest that multi-core architectures may effectively unleash the full quantum computer potential.
  arXiv  Detail & Related papers  (2020-09-17T09:58:26Z)

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.