Solving approximate hidden subgroup problems: quantum heuristics to detect weak entanglement
Summarize this article with:
Quantum Physics arXiv:2603.15733 (quant-ph) [Submitted on 16 Mar 2026] Title:Solving approximate hidden subgroup problems: quantum heuristics to detect weak entanglement Authors:Petar Simidzija, Eugene Koskin, Elton Yechao Zhu, Michael Dascal, Maria Schuld View a PDF of the paper titled Solving approximate hidden subgroup problems: quantum heuristics to detect weak entanglement, by Petar Simidzija and 4 other authors View PDF HTML (experimental) Abstract:How can we use a quantum computer to detect the entanglement structure of a quantum state? Bouland et al. (2024) recently provided an algorithm that, given multiple input copies of the state, finds the "hidden cuts"-partitions into fully unentangled qubit registers. Their solution is based on turning cuts into a symmetry which can be detected with a Shor-type quantum algorithm for hidden subgroup problems, the hidden cut algorithm. In this paper we derive heuristics that can find "approximate symmetries", or weakly entangled qubit registers, to unlock this powerful idea for a much broader range of problems. Our core contribution is a rigorous link between the output distribution of the hidden cut algorithm and the reward function that measures the quality of a cut. This implies that reducing the number of state copies in the original hidden cut algorithm leads to measurement samples from which patterns of weak entanglement can be extracted. We believe that these insights are an important step in making quantum algorithms for hidden subgroup problems useful for applications beyond cryptography. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.15733 [quant-ph] (or arXiv:2603.15733v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.15733 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Maria Schuld [view email] [v1] Mon, 16 Mar 2026 18:00:01 UTC (1,654 KB) Full-text links: Access Paper: View a PDF of the paper titled Solving approximate hidden subgroup problems: quantum heuristics to detect weak entanglement, by Petar Simidzija and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 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?)