Circuit Partitioning for Multi-Core Quantum Architectures with Deep Reinforcement Learning
arXiv:2401.17976 · doi:10.1109/ISCAS58744.2024.10557956
Abstract
Quantum computing holds immense potential for solving classically intractable problems by leveraging the unique properties of quantum mechanics. The scalability of quantum architectures remains a significant challenge. Multi-core quantum architectures are proposed to solve the scalability problem, arising a new set of challenges in hardware, communications and compilation, among others. 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, contributing to the advancement of both quantum computing and graph partitioning. This work is the first step in integrating Deep Reinforcement Learning techniques into Quantum Circuit Mapping, opening the door to a new paradigm of solutions to such problems.
References in corpus (14)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Review article: Linear optical quantum computing
- Coherent control of macroscopic quantum states in a single-Cooper-pair box
- Quantum Teleportation is a Universal Computational Primitive
- A Quantum Approximate Optimization Algorithm
- An Introduction to Deep Reinforcement Learning
- Hamiltonian Simulation by Qubitization
- A Closer Look at Invalid Action Masking in Policy Gradient Algorithms
- A new quantum ripple-carry addition circuit
- Quantum Risk Analysis
- Time-Sliced Quantum Circuit Partitioning for Modular Architectures
- Mapping quantum circuits to modular architectures with QUBO
- Hungarian Qubit Assignment for Optimized Mapping of Quantum Circuits on Multi-Core Architectures