SeQUeNCe is a new top-level module within the SeQUeNCe package that compiles monolithic circuits into topology-aware execution plans and coordinates their execution using SeQUeNCe's existing quantum-network modules and protocols.
Abstract
Distributed quantum computing (DQC) connects multiple quantum processing units to overcome the scale limits of monolithic hardware. We introduce SeQUeNCe$.$DQC a new top-level module within the SeQUeNCe package that compiles monolithic circuits into topology-aware execution plans and coordinates their execution using SeQUeNCe's existing quantum-network modules and protocols. We validate SeQUeNCe$.$DQC by reproducing a two-node trapped-ion Grover experiment in simulation and comparing success probabilities with the reported 71% benchmark. We then evaluate how compiler strategy, topology, and memory capacity jointly govern distributed circuit execution time and success rate. In these experiments, our hybrid compilers successfully identified mixed TeleGate/TeleData execution plans that outperformed pure gate-teleportation strategies. By capturing the physical overhead of distributed quantum primitives, SeQUeNCe$.$DQC provides a rigorous platform for co-designing DQC software and hardware architectures.
This work presents a resource-aware scheduler for DQC that compares these execution alternatives at runtime using explicit models of QPU execution, communication, and host-side reconstruction, together with hardware-informed timing derived from simulated IBM QPUs.
Connor Howe, Raghav Mundada, Jake O'Shaughnessy et al.· 0 citations
This work forms the joint selection of compilations and allocation of shots under per-link Bell-pair capacities as Candidate-Constrained Max-Shot Allocation (CMA), proves it NP-hard, and solves it with a dynamic program and its approximate variant AppDP, a compact MILP, and a greedy heuristic Effi.
Yi-Pei Liu, Sen Zhang, Ze-Bo Yang et al.· 0 citations
This paper reviews the theoretical foundations and practical realization of large-scale FTQC, and explores major families of QECCs, including topological, qLDPC, subsystem, and dynamical codes, with emphasis on code construction, syndrome extraction, and decoding.
S. Babaie, Sean Grzenda, Lan Yang et al.· Entropy· 0 citations
Quantum computers are approaching the early fault-tolerant regime. Verifying the next generation of quantum hardware requires joint emulation of the quantum processor, hardware noise, and classical control and decoding logic. We introduce the Programmable Pauli Virtual Machine (PPVM), an open-source framework for digit...
Xiu-Zhe Luo, David Plankensteiner, Kai-Hsin Wu et al.· 2 citations
Multi-quantum processing unit (multi-QPU) architectures have emerged as a promising route for scaling up quantum computing. However, quantum circuit execution across QPUs introduces remote operations, which have lower fidelity than local operations and require additional communication resources. Circuit mapping, which...
Long-Shan Xu, E. Sha, Wei-Xuan Liu et al.· Quantum Science and Technolo...· 0 citations
The diversity of quantum hardware platforms creates significant algorithm portability challenges, with each platform employing distinct instruction sets, gate implementations, and physical constraints that hinder software reusability. This paper presents a framework for designing portable quantum assembly languages ena...
Isaac Arturo Vargas-Chacón, Johan Carvajal-Godínez, Ernesto Rivera-Alvarado· Revista Tecnología en Marcha· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.