Distributed quantum approximate counting algorithm

Quantum Physics arXiv:2511.04945 (quant-ph) [Submitted on 7 Nov 2025] Title:Distributed quantum approximate counting algorithm Authors:Huaijing Huang, Daowen Qiu View a PDF of the paper titled Distributed quantum approximate counting algorithm, by Huaijing Huang and 1 other authors View PDF Abstract:In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure. We apply the proposed algorithm to estimate inner products and Hamming distances. Simulations are conducted on the Qisikit platform, further demonstrating the effectiveness of our algorithm and its suitability for the NISQ era. Compared to existing counting algorithms, the proposed algorithm has advantages in terms of the number of qubits, circuit depth, and the number of quantum gates. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2511.04945 [quant-ph] (or arXiv:2511.04945v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.04945 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Daowen Qiu [view email] [v1] Fri, 7 Nov 2025 03:09:03 UTC (382 KB) Full-text links: Access Paper: View a PDF of the paper titled Distributed quantum approximate counting algorithm, by Huaijing Huang and 1 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2025-11 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)