Modeling Short-Range Microwave Networks to Scale Superconducting Quantum
Computation
- URL: http://arxiv.org/abs/2201.08825v2
- Date: Thu, 5 Jan 2023 19:38:36 GMT
- Title: Modeling Short-Range Microwave Networks to Scale Superconducting Quantum
Computation
- Authors: Nicholas LaRacuente, Kaitlin N. Smith, Poolad Imany, Kevin L.
Silverman, Frederic T. Chong
- Abstract summary: Distributed quantum computing across small qubit arrays, known as chiplets, can address these challenges in a scalable manner.
We propose a chiplet architecture over microwave links with potential to exceed monolithic performance on near-term hardware.
- Score: 4.289174497412187
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A core challenge for superconducting quantum computers is to scale up the
number of qubits in each processor without increasing noise or cross-talk.
Distributed quantum computing across small qubit arrays, known as chiplets, can
address these challenges in a scalable manner. We propose a chiplet
architecture over microwave links with potential to exceed monolithic
performance on near-term hardware. Our methods of modeling and evaluating the
chiplet architecture bridges the physical and network layers in these
processors. We find evidence that distributing computation across chiplets may
reduce the overall error rates associated with moving data across the device,
despite higher error figures for transfers across links. Preliminary analyses
suggest that latency is not substantially impacted, and that at least some
applications and architectures may avoid bottlenecks around chiplet boundaries.
In the long-term, short-range networks may underlie quantum computers just as
local area networks underlie classical datacenters and supercomputers today.
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) - Spatio-Temporal Characterization of Qubit Routing in
Connectivity-Constrained Quantum Processors [1.3230570759583702]
This work presents a comparative analysis of the resulting communication overhead among three processor topologies.
According to performance metrics of communication-to-computation ratio, mean qubit hotspotness, and temporal burstiness, the square lattice layout is favourable for quantum computer architectures at a scale.
arXiv Detail & Related papers (2024-02-01T10:16:04Z) - Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum
Modular Architectures [1.8946122116481299]
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) - Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices.
circuit cutting techniques enable the distribution of quantum computations through classical communication.
Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots.
We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
arXiv Detail & Related papers (2023-06-21T08:03:34Z) - MECH: Multi-Entry Communication Highway for Superconducting Quantum
Chiplets [8.331379159321271]
As the computing scale increases, communication between qubits would become a more severe bottleneck.
We propose a multi-entry communication highway (MECH) mechanism to trade ancillary qubits for program.
This implies a more efficient and less error-prone compilation of quantum programs.
arXiv Detail & Related papers (2023-05-09T03:20:56Z) - Characterizing Qubit Traffic of a Quantum Intranet aiming at Modular
Quantum Computers [1.8602413562219944]
Quantum-core processors are envisioned as the ultimate solution for the scalability of quantum computers.
We present a technique to perform a-temporal characterization of quantum circuits running in multi-chip interconnected quantum computers.
arXiv Detail & Related papers (2022-08-31T21:33:17Z) - 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) - Spiderweb array: A sparse spin-qubit array [0.04582374977939354]
One of the main bottlenecks in the pursuit of a large-scale--chip-based quantum computer is the large number of control signals needed to operate qubit systems.
Here, we discuss a quantum-dot spin-qubit architecture that integrates on-chip control electronics, allowing for a significant reduction in the number of signal connections at the chip boundary.
arXiv Detail & Related papers (2021-10-01T03:20:29Z) - The Computational and Latency Advantage of Quantum Communication
Networks [70.01340727637825]
This article summarises the current status of classical communication networks.
It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
arXiv Detail & Related papers (2021-06-07T06:31:02Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Interleaving: Modular architectures for fault-tolerant photonic quantum
computing [50.591267188664666]
Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays.
We present a modular architecture for FBQC in which these components are combined to form "interleaving modules"
Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
arXiv Detail & Related papers (2021-03-15T18:00:06Z)
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.