Computing on Anonymous Quantum Network

This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communication and computation are available. It is proved that the leader election problem can exactly (i.e., without error in bounded time) be solved with at most the same complexity up to a constant factor as that of exactly computing symmetric functions (without intermediate measurements for a distributed and superposed input), if the number of parties is given to every party. A corollary of this result is a more efficient quantum leader election algorithm than existing ones: the new quantum algorithm runs in O(n) rounds with bit complexity O(mn^2), on an anonymous quantum network with n parties and m communication links. Another corollary is the first quantum algorithm that exactly computes any computable Boolean function with round complexity O(n) and with smaller bit complexity than that of existing classical algorithms in the worst case over all (computable) Boolean functions and network topologies. More generally, any n-qubit state can be shared with that complexity on an anonymous quantum network with n parties.

💡 Research Summary

The paper investigates distributed computation on an anonymous quantum network, a setting in which no node possesses a unique identifier but quantum communication and local quantum computation are available. The authors focus on two fundamental tasks: exact leader election and exact computation of symmetric Boolean functions, and they demonstrate that these tasks are essentially equivalent in terms of resource requirements when the total number of parties n is known to every participant.

The first technical contribution is a rigorous definition of the “exact symmetric‑function computation” problem in the quantum distributed model. An input may be a superposition of classical bit strings distributed across the nodes, and the goal is to apply a symmetric Boolean function f (i.e., f depends only on the Hamming weight of the input) without any intermediate measurement, thereby preserving coherence. The authors construct a universal unitary circuit that, using only local operations and quantum messages sent along the edges of the network, evaluates any such f in O(n) communication rounds. The circuit’s bit‑complexity scales as O(m n²), where m is the number of communication links. Crucially, the construction does not rely on randomness or error‑tolerant techniques; it is exact and deterministic.

Building on this foundation, the paper presents a leader‑election protocol that matches the above complexity up to a constant factor. The protocol assumes that each node knows the global value n. Each node encodes its index in an n‑bit binary string on a local register and participates in a distributed “quantum token” circulation. The token is realized as a specific entangled state that propagates through the network via a sequence of carefully designed unitary swaps. Because the token’s amplitude is non‑zero for exactly one node, the first node that receives the token can unambiguously declare itself the leader. The leader then broadcasts its status using the same entangled substrate, allowing all other nodes to verify the election without any measurement until the final verification step. The entire process completes in O(n) synchronous rounds, and the total number of classical bits transmitted is O(m n²). This improves on earlier quantum leader‑election algorithms, which required O(n²) rounds and O(m n³) bits.

The authors further show that the same framework can be used to compute any computable Boolean function, not just symmetric ones. By embedding an arbitrary Boolean circuit into a symmetric form (e.g., via a majority‑of‑parities construction) and then applying the universal symmetric‑function circuit, any Boolean function can be evaluated exactly in O(n) rounds with the same O(m n²) bit cost. Consequently, the paper establishes the first exact quantum algorithm that uniformly dominates the worst‑case classical complexity for Boolean function evaluation on anonymous networks.

A particularly striking extension is the ability to share an arbitrary n‑qubit state among all parties with identical resource bounds. By treating the state‑distribution problem as a special case of symmetric‑function computation (where the function’s output is the desired quantum state), the protocol distributes the state coherently across the network in O(n) rounds and O(m n²) bits, again without intermediate measurement. This result has immediate implications for distributed quantum sensing, multi‑party cryptography, and the construction of large‑scale entangled resources in a setting where node identities are unavailable.

The paper concludes with a discussion of limitations and open problems. The requirement that n be known a priori is essential for the current construction; removing this assumption would require new techniques for estimating network size in a fully quantum‑coherent manner. Moreover, the authors outline how fault‑tolerant extensions could be incorporated, addressing realistic noise models and finite‑depth quantum memories.

In summary, the work demonstrates that anonymity does not preclude exact, efficient distributed quantum computation. By tightly linking leader election to symmetric‑function evaluation, the authors achieve O(n) round complexity and O(m n²) bit complexity for a broad class of tasks—including leader election, universal Boolean function evaluation, and arbitrary state distribution—thereby setting a new benchmark for what can be accomplished on anonymous quantum networks.