aiqbenchInformații despre AI & calcul cuantic

...

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

perspectiva aiqbenchCalcul cuantic

This paper establishes theoretical bounds on the sample complexity for the generalized hidden shift problem across arbitrary finite groups, advancing our understanding of quantum algorithms in group-theoretic contexts. By linking these complexities directly to group theoretic data, the work provides critical insights into the efficiency limits of specific quantum protocols.

Surse care acoperăarXiv, LessWrong, Quantum Zeitgeist, Latent Space

Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

On the sample complexity of the generalized hidden shift problem over arbitrary finite groups

arXiv9 septembrie 20261 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2609.05828v1 Announce Type: new Abstract: We formulate the generalized hidden shift problem over arbitrary finite groups and obtain upper and lower bounds for the sample complexity in terms of group theoretic data.

Abstract:We formulate the generalized hidden shift problem over arbitrary finite groups and obtain upper and lower bounds for the sample complexity in terms of group theoretic data.

Quantum Physics (quant-ph); Computational Complexity (cs.CC); Group Theory (math.GR)

arXiv:2609.05828 [quant-ph]

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

https://doi.org/10.48550/arXiv.2609.05828 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 · 127 cuvinte

Citește pe arXiv ↗Întreabă despre acest articol