Curator's Take
This research tackles one of the most pressing challenges in scaling quantum computers: how to connect multiple quantum processors while maintaining error correction capabilities. The authors demonstrate that smart qubit allocation strategies can reduce costly inter-processor operations by 10% or more, which is crucial since these "nonlocal gates" are typically much noisier and slower than operations within a single processor. What makes this work particularly valuable is its focus on near-term practicality, showing how distributed quantum computing can work with today's frequent error correction requirements rather than waiting for future fault-tolerant systems. This represents an important step toward the modular quantum computing architectures that will likely be necessary to achieve the scale needed for practical quantum advantage.
— Mark Eatherly
Summary
Modular quantum computing architectures require error correction schemes that remain effective in the presence of noisy inter-processor operations. As such, minimizing the number of such operations on logical circuits partitioned across quantum processors is a primary objective of distributed quantum computing. In this work, we develop basic techniques for qubit allocation using an exemplar color code family and explore generalizations to other color codes. In particular, we show that a 10% reduction in processor-nonlocal gates is achievable in a setting where syndrome extraction occurs after every logical gate, as in today's devices, and that this scales to significantly greater advantages in the multi-qubit case. We also explore methods of achieving universal gate sets efficiently in this distributed logical setting and evaluate the trade-offs of multiple approaches such as magic state distillation, code switching, and a new method based on logical swaps. Finally, we discuss some considerations for an allocation algorithm for these architectures to perform scalably and connect it to existing work on quantum circuit partitions.