Modular quantum extreme reservoir computing

• URL: http://arxiv.org/abs/2412.19336v1
• Date: Thu, 26 Dec 2024 19:15:09 GMT
• Title: Modular quantum extreme reservoir computing
• Abstract summary: Connectivity between qubits plays a crucial role in the performance of quantum extreme reservoir computing.<n>We show that sufficiently long-range connections within a single module can achieve performance comparable to fully connected networks in supervised learning tasks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The connectivity between qubits plays a crucial role in the performance of quantum extreme reservoir computing (QERC), particularly regarding long-range and inter-modular connections. We demonstrate that sufficiently long-range connections within a single module can achieve performance comparable to fully connected networks in supervised learning tasks. Further analysis of inter-modular connection schemes -- such as boundary, parallel, and arbitrary links -- shows that even a small number of well-placed connections can significantly enhance QERC performance. These findings suggest that modular QERC architectures, which could be more easily implemented on two-dimensional quantum chips or through the integration of small quantum systems, provide an effective approach for machine learning tasks.

Related papers

• Architectural scaling tradeoffs in modular 3D bosonic quantum processors [60.61253784194378]
  We propose a three-dimensional bosonic quantum processor built from coupled-cavity modules linked by interconnect networks.<n>We compare nearest-neighbor, hub-based, and hybrid architectures in terms of interconnect count, communication distance, resource concentration, and implementation complexity.
  arXiv  Detail & Related papers  (2026-08-22T02:31:24Z)
• Rethinking How to Act: Action-Space Engineering for Reinforcement Learning-Based Circuit Routing in Distributed Quantum Systems [0.7856998585396422]
  We introduce an agent that combines a novel action-space formulation with effective action-masking strategies.<n>Our agent achieves improved training and inference performance with a relative reduction in the modeled execution time of up to 35%.
  arXiv  Detail & Related papers  (2026-05-04T09:32:33Z)
• Long-range tunable coupler for modular fluxonium quantum processors [12.775913749370083]
  We propose a long-range tunable coupler designed to interconnect fluxonium qubits separated by more than one centimeter.<n>This work could contribute to the development of large-scale fluxonium quantum processors by bridging their demonstrated potential with modular scalability.
  arXiv  Detail & Related papers  (2026-04-14T04:24:18Z)
• COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms [4.584616394519209]
  We introduce COMPAS, an architecture that realizes multivariate trace estimation across a multi-party network of interconnected modular and distributed QPUs.<n>Unlike other schemes, which must choose between optimality in circuit depth or GHZ width, COMPAS achieves both at once.<n>We analyze network-level errors and simulate the effects of circuit-level noise on the architecture.
  arXiv  Detail & Related papers  (2025-11-28T18:31:15Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• It's-A-Me, Quantum Mario: Scalable Quantum Reinforcement Learning with Multi-Chip Ensembles [29.944281778572876]
  Quantum reinforcement learning (QRL) promises compact function approximators with access to vast Hilbert spaces.<n>We introduce a multi-chip ensemble framework using multiple small Quantum Convolutional Neural Networks (QCNNs) to overcome constraints.<n>Our approach partitions complex, high-dimensional observations from the Super Mario Bros environment across independent quantum circuits.
  arXiv  Detail & Related papers  (2025-08-31T06:15:55Z)
• Solving the Hubbard model with Neural Quantum States [66.55653324211542]
  We study the state-of-the-art results for the doped two-dimensional (2D) Hubbard model.<n>We find different attention heads in the NQS ansatz can directly encode correlations at different scales.<n>Our work establishes NQS as a powerful tool for solving challenging many-fermions systems.
  arXiv  Detail & Related papers  (2025-07-03T14:08:25Z)
• Benchmarking Emerging Cavity-Mediated Quantum Interconnect Technologies for Modular Quantum Computers [1.0653685964361501]
  This work presents a comparative analysis of the cavity-mediated interconnect technologies according to a defined figure of merit. We identify the configurations related to the cavity and atomic decay rates as well as the qubit-cavity coupling strength that meet the efficiency thresholds.
  arXiv  Detail & Related papers  (2024-07-22T14:11:20Z)
• Distributed Quantum Computing across an Optical Network Link [0.0]
  We experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. We deterministically teleport a controlled-Z gate between two circuit qubits in separate modules, achieving 86% fidelity. As photons can be interfaced with a variety of systems, this technique has applications extending beyond trapped-ion quantum computers.
  arXiv  Detail & Related papers  (2024-06-30T21:32:10Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• 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)
• 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)
• Single entanglement connection architecture between multi-layer bipartite Hardware Efficient Ansatz [18.876952671920133]
  We propose a single entanglement connection architecture (SECA) for a bipartite hardware efficient ansatz. Our results indicate the superiority of SECA over the common full entanglement connection architecture (FECA) in terms of computational performance.
  arXiv  Detail & Related papers  (2023-07-23T13:36:30Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Modular tunable coupler for superconducting qubits [0.0]
  We propose a versatile and internally-tunable double-transmon coupler architecture that implements tunable coupling via flux-controlled interference in a three-junction dcSQUID. The DTC possesses an internally defined zero-coupling state that is independent of the coupled data qubits or circuit resonators.
  arXiv  Detail & Related papers  (2022-07-14T01:57:36Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)

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.