QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion.
Title resolution pending
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 8verdicts
UNVERDICTED 8roles
background 2polarities
background 2representative citing papers
A modular end-to-end simulation framework jointly models surface-code operations, QPU connectivity, and network constraints to produce execution latency and logical error rate estimates, revealing network-dependent operating regimes for distributed quantum computing.
The [[144,12,12]] bivariate bicycle code is distributed across 4 to 12 processors in a star network, with simulations showing logical error rates under varying nonlocal noise scaling.
A new compiler for surface codes on QCCD trapped-ion hardware shows that 2-ion traps outperform larger traps in logical clock speed and hardware efficiency, beating prior compilers by 3.8X on average.
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
The work identifies a fidelity crossover separating distillation-dominated and no-distillation regimes for remote entanglement in lattice surgery, with up to 100x or >50% resource savings depending on the side of the threshold.
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
citing papers explorer
-
QuPort: Topology-, Port-, and Congestion-Aware Compilation for Modular Multi-QPU Quantum Systems
QuPort introduces a three-level graph model and TPCCAP optimizer for compiling circuits on modular multi-QPU systems while balancing topology, port usage, and link congestion.
-
Impact of Network Constraints on Fault-Tolerant Distributed Quantum Computing
A modular end-to-end simulation framework jointly models surface-code operations, QPU connectivity, and network constraints to produce execution latency and logical error rate estimates, revealing network-dependent operating regimes for distributed quantum computing.
-
Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture
The [[144,12,12]] bivariate bicycle code is distributed across 4 to 12 processors in a star network, with simulations showing logical error rates under varying nonlocal noise scaling.
-
Architecting Scalable Trapped Ion Quantum Computers using Surface Codes
A new compiler for surface codes on QCCD trapped-ion hardware shows that 2-ion traps outperform larger traps in logical clock speed and hardware efficiency, beating prior compilers by 3.8X on average.
-
Learning-Optimized Qubit Mapping and Reuse to Minimize Inter-Core Communication in Modular Quantum Architectures
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
-
Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill
The work identifies a fidelity crossover separating distillation-dominated and no-distillation regimes for remote entanglement in lattice surgery, with up to 100x or >50% resource savings depending on the side of the threshold.
-
Distributed Realization of Color Codes for Quantum Error Correction
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.