Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This paper presents a significant advancement in quantum algorithms by generalizing Gaussian elimination circuits from binary fields to any finite field, offering a garbage-free design with optimal Toffoli depth. Such improvements are critical for enhancing the efficiency of linear algebra subroutines essential for large-scale quantum simulation and error correction protocols.
Surse care acoperăarXiv, Quantum Computing Report, Quantum Zeitgeist
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

A Quantum Circuit for Gaussian Elimination

arXiv1 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2609.28901v1 Announce Type: new Abstract: A quantum circuit for Gaussian elimination is developed in this work. While previous quantum implementations of Gaussian elimination were restricted to $\mathrm{GF}(2)$, the proposed design is generalized to any finite field. Compared with previous works in $\mathrm{GF}(2)$, the developed circuit achieves garbage-free construction while retaining the best known asymptotic Toffoli depth up to logarithmic factors.

Abstract:A quantum circuit for Gaussian elimination is developed in this work. While previous quantum implementations of Gaussian elimination were restricted to $\mathrm{GF}(2)$, the proposed design is generalized to any finite field. Compared with previous works in $\mathrm{GF}(2)$, the developed circuit achieves garbage-free construction while retaining the best known asymptotic Toffoli depth up to logarithmic factors.

Quantum Physics (quant-ph); Emerging Technologies (cs.ET)

arXiv:2609.28901 [quant-ph]

(or arXiv:2609.28901v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.28901 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

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.

Text integral sub licența deschisă a publicației · 152 cuvinte

Subiecte conexe