Crossmark

An efficient implementation of a quantum search algorithm for arbitrary $$N$$

Crossref DOI link: https://doi.org/10.1140/epjp/s13360-025-06518-3

Published Online: 2025-06-23

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Shukla, Alok https://orcid.org/0000-0001-5765-3166
Vedula, Prakash
License Information

Text and Data Mining valid from 2025-06-23

Version of Record valid from 2025-06-23
More Information

Article History

Received: 5 April 2025

Accepted: 3 June 2025

First Online: 23 June 2025

Declarations

:

: The authors have no conflict of interest to declare that are relevant to the content of this article.