Communication-Efficient Distributed Inverse Quantum Fourier Transform
Abstract
The scalability of quantum computing is currently limited by physical, technological, and architectural constraints that hinder the integration of a large number of qubits within a single quantum processor. Distributed quantum computing (DQC) has therefore emerged as a viable alternative, aiming to interconnect multiple smaller quantum processing units (QPUs) to jointly operate on a global quantum state. While this paradigm enables scalable architectures, it introduces significant communication overhead due to the cost of non-local quantum operations across distant nodes. In this work we propose a distributed formulation of the iQFT over a quantum network composed of P nodes, each hosting Q qubits, enabling the execution on a logical register of size n = P · Q. Furthermore, we introduce a communication-efficient variant based on a threshold-driven pruning strategy, referred to as a \emph{communication horizon}, which exploits the exponentially decreasing significance of controlled-phase rotations to safely omit remote gates with negligible impact. By reducing the number of inter-node quantum interactions, the proposed approach significantly lowers the quantum communication requirements of the distributed iQFT while preserving its functional correctness. Crucially, we show that this approach fundamentally alters the scaling of the algorithm: the entanglement resource consumption per node saturates to a constant value, reducing the global communication complexity from quadratic 𝒪(P2) to linear 𝒪(P). As the iQFT constitutes a critical building block in many quantum algorithms, the techniques presented in this paper directly contribute to improving the practicality and scalability of distributed quantum computation.
Versions
Related
- Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
- Towards an Optimally Distributed Quantum Fourier Transform Circuit
- Efficient Non-Uniform Quantum Hermite Transform through Adaptive Sampling
- DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing
- 𝒪(n) alternative to Quantum Fourier Transform with efficient neural net classical post-processing
BibTeX
@misc{cardama2026communicationefficient,
title = {{Communication-Efficient Distributed Inverse Quantum Fourier Transform}},
author = {F. Javier Cardama and Jorge Vázquez-Pérez and Tomás F. Pena and Andrés Gómez},
howpublished = {arXiv},
year = {2026},
month = jul,
doi = {10.48550/arxiv.2605.10710},
eprint = {2605.10710},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.10710},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Communication-Efficient Distributed Inverse Quantum Fourier Transform
AU - F. Javier Cardama
AU - Jorge Vázquez-Pérez
AU - Tomás F. Pena
AU - Andrés Gómez
PY - 2026
DA - 2026/07/10
PB - arXiv
DO - 10.48550/arxiv.2605.10710
UR - https://arxiv.org/abs/2605.10710
AB - The scalability of quantum computing is currently limited by physical, technological, and architectural constraints that hinder the integration of a large number of qubits within a single quantum processor. Distributed quantum computing (DQC) has therefore emerged as a viable alternative, aiming to interconnect multiple smaller quantum processing units (QPUs) to jointly operate on a global quantum state. While this paradigm enables scalable architectures, it introduces significant communication overhead due to the cost of non-local quantum operations across distant nodes. In this work we propose a distributed formulation of the iQFT over a quantum network composed of P nodes, each hosting Q qubits, enabling the execution on a logical register of size n = P · Q. Furthermore, we introduce a communication-efficient variant based on a threshold-driven pruning strategy, referred to as a \emph{communication horizon}, which exploits the exponentially decreasing significance of controlled-phase rotations to safely omit remote gates with negligible impact. By reducing the number of inter-node quantum interactions, the proposed approach significantly lowers the quantum communication requirements of the distributed iQFT while preserving its functional correctness. Crucially, we show that this approach fundamentally alters the scaling of the algorithm: the entanglement resource consumption per node saturates to a constant value, reducing the global communication complexity from quadratic 𝒪(P^2) to linear 𝒪(P). As the iQFT constitutes a critical building block in many quantum algorithms, the techniques presented in this paper directly contribute to improving the practicality and scalability of distributed quantum computation.
ER -