Back to News
quantum-computing

On universality of hardware-efficient ansatzes

Hokuto Iwakiri, Keita Kanno
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers Hokuto Iwakiri and Keita Kanno prove hardware-efficient ansatzes (HEAs)—key parametrized quantum circuits for near-term devices—can simulate any relevant quantum circuit efficiently, establishing their universality. Their work demonstrates that simulating major HEA classes is BQP-complete, meaning these ansatzes match the computational power of bounded-error quantum polynomial-time algorithms. The study explicitly constructs mappings showing arbitrary quantum circuits can be represented as HEA circuits without exponential overhead, addressing a critical gap in near-term quantum algorithm design. Published in November 2025, the findings challenge assumptions about HEA limitations, suggesting they may serve as a universal framework for hybrid quantum-classical applications. This universality proof could accelerate practical quantum advantage by simplifying circuit design while maintaining computational robustness.
AI Audio Summary
0:00 / 0:00
Click to play
Quantum computing technology
Unsplash · Validated Fallback

Quantum Physics arXiv:2511.03870 (quant-ph) [Submitted on 5 Nov 2025] Title:On universality of hardware-efficient ansatzes Authors:Hokuto Iwakiri, Keita Kanno View a PDF of the paper titled On universality of hardware-efficient ansatzes, by Hokuto Iwakiri and 1 other authors View PDF Abstract:The hardware-efficient ansatz (HEA) is one of the most important class of parametrized quantum circuits for near-term applications of quantum computing. We show that the problem of simulating some major classes of the HEA is BQP-complete by explicitly demonstrating that any relevant quantum circuit can be efficiently represented as an HEA circuit of those classes. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2511.03870 [quant-ph] (or arXiv:2511.03870v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.03870 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Keita Kanno [view email] [v1] Wed, 5 Nov 2025 21:31:34 UTC (303 KB) Full-text links: Access Paper: View a PDF of the paper titled On universality of hardware-efficient ansatzes, by Hokuto Iwakiri 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?)

Read Original

Tags

quantum-computing

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.