Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures

• URL: http://arxiv.org/abs/2605.03854v1
• Date: Tue, 05 May 2026 15:19:56 GMT
• Title: Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
• Abstract summary: Pauli-based computation (PBC) provides a universal framework for executing fault-tolerant quantum algorithms.<n>We investigate the tradeoff between error-correcting code block size and execution time of PBC within the Q-Fly architecture at intermediate scale.<n>We find that large qLDPC code blocks outperform the surface code baseline in terms of execution time by up to an order of magnitude when evaluated against quantum optimization algorithms.
• Score: 0.15293427903448018
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Pauli-based computation (PBC) provides a universal framework for executing fault-tolerant quantum algorithms using Pauli measurements and magic states. In monolithic architectures, the serialized nature of PBC directly ties runtime to a circuit's T-gate count, making it slow on metrics like circuit depth. However, in distributed quantum computing (DQC), the primary bottleneck is remote Bell pair generation. We investigate the tradeoff between error-correcting code block size and execution time of PBC within the Q-Fly architecture at intermediate scale, limiting individual node capacities to reflect near-term constraints while supplying abundant network nodes to minimize routing and compilation effects. We find that large qLDPC code blocks outperform the surface code baseline in terms of execution time by up to an order of magnitude when evaluated against quantum optimization algorithms. By moving groups of qubits to free nodes to bypass the sequential bottleneck of PBC, the large-block architecture minimizes network operations and achieves faster overall execution. This demonstrates that PBC is a competitive model in the distributed regime, establishing it as a practical compilation baseline for qLDPC systems before invoking more efficient transversal or homological gates.

Related papers

• Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms [1.6355471507854134]
  Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs)<n> Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning.<n>This paper applies established monolithic metrics to partitioned distributed circuits to quantify the performance impact of network constraints.
  arXiv  Detail & Related papers  (2026-08-27T13:15:26Z)
• To Scale Up or To Scale Out: Evaluating Space-Time Costs of Compiled Logical Circuits on Modular Superconducting Quantum Processors [0.6024602799136752]
  Two primary strategies lead this effort: chiplet-based scaling and distributed architectures.<n>We introduce a quantitative stress test measuring the execution cost of a dense workload of logical entangling operations.<n>We find that distributed architectures incur an up to exponential space-time performance penalty compared to an effectively monolithic architecture.
  arXiv  Detail & Related papers  (2026-08-20T18:00:12Z)
• Dependency-Aware Circuit Scheduling for Multi-Core Quantum Systems to Minimize Makespan [1.6449390849183356]
  We introduce a layered scheduling approach for multi-core quantum circuits.<n>We then propose a greedy scheduling strategy which schedules each gate as soon as all its dependencies and required resources are available.<n>Our evaluation shows that on real benchmarks, greedy scheduling achieves an average 40% reduction in makespan and improvement in core utilization.
  arXiv  Detail & Related papers  (2026-07-01T05:37:07Z)
• Logical-to-Physical Compilation for Reducing Depth in Distributed Quantum Systems [0.7856998585396422]
  We present a compiler that integrates logical-to-physical decomposition with depth-aware rescheduling to reduce the execution cost of quantum circuits.<n>An algorithm is proposed that ensures parallelism is created when possible while keeping logical equivalence and that circuit depth is never increased.
  arXiv  Detail & Related papers  (2026-03-31T10:19:11Z)
• Chipmunq: A Fault-Tolerant Compiler for Chiplet Quantum Architectures [40.10865338207471]
  We present Chipmunq, the first hardware-aware compiler for mapping and routing fault-tolerant circuits onto modular architectures.<n>Chipmunq achieves a 13.5x speedup in compilation time compared to state-of-the-art tools.
  arXiv  Detail & Related papers  (2026-03-17T11:20:37Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Constraint-Optimal Driven Allocation for Scalable QEC Decoder Scheduling [3.7768601360100647]
  Fault-tolerant quantum computing requires fast and accurate decoding of Quantum Error Correction syndromes.<n>In large-scale systems, the number of available decoders is much smaller than the number of logical qubits, leading to a fundamental resource shortage.<n>To address this limitation, Virtualized Quantum Decoder (VQD) architectures have been proposed to share a limited pool of decoders across multiple qubits.
  arXiv  Detail & Related papers  (2025-12-02T09:07:00Z)
• 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)
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays [38.6948808036416]
  We present a low-overhead architecture that supports the layout and resource estimation of large-scale fault-tolerant quantum algorithms.<n>We find that a 2048-bit RSA factoring can be executed with 19 million qubits in 5.6 days, for 1 ms QEC cycle times.
  arXiv  Detail & Related papers  (2025-05-21T18:00:18Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Accelerating Wireless Federated Learning via Nesterov's Momentum and Distributed Principle Component Analysis [59.127630388320036]
  A wireless federated learning system is investigated by allowing a server and workers to exchange uncoded information via wireless channels. Since the workers frequently upload local to the server via bandwidth-limited channels, the uplink transmission from the workers to the server becomes a communication bottleneck. A one-shot distributed principle component analysis (PCA) is leveraged to reduce the dimension of the dimension of the communication bottleneck.
  arXiv  Detail & Related papers  (2023-03-31T08:41:42Z)
• An Adaptive Device-Edge Co-Inference Framework Based on Soft Actor-Critic [72.35307086274912]
  High-dimension parameter model and large-scale mathematical calculation restrict execution efficiency, especially for Internet of Things (IoT) devices. We propose a new Deep Reinforcement Learning (DRL)-Soft Actor Critic for discrete (SAC-d), which generates the emphexit point, emphexit point, and emphcompressing bits by soft policy iterations. Based on the latency and accuracy aware reward design, such an computation can well adapt to the complex environment like dynamic wireless channel and arbitrary processing, and is capable of supporting the 5G URL
  arXiv  Detail & Related papers  (2022-01-09T09:31:50Z)

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.