Distributed Quantum Computing Based on Fixed-point Quantum Search

Abstract:Fixed-point quantum search can find target strings without knowing their initial success probability and can be applied to the design of distributed quantum algorithms. This paper makes the following contributions to the integration of distributed quantum computing and the fixed-point quantum search: (1) An inherent relationship between a given Boolean function and its sub-functions is discovered. (2) In particular, a distributed quantum amplitude amplification algorithm based on the fixed-point search is proposed. The algorithm has advantages in the number of qubits and circuit depth, requires no quantum communication, and is simulated by means of Qiskit to show good noise resistance. (3) Inspired by the proposed algorithm, a general model for applying the fixed-point quantum search to distributed quantum computing is formulated.

arXiv:2510.16498 [quant-ph]

(or arXiv:2510.16498v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2510.16498 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.