Coherence and decoherence in generalized Shor's algorithm

Abstract:Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study the coherence and decoherence in generalized Shor's algorithm where the register $A$ is initialized in an arbitrary pure state, or the combined register $AB$ is initialized in a pseudo-pure state, which encompasses the standard Shor's algorithm as a special case. We derive both the lower and upper bounds on the performance of the generalized Shor's algorithm, and establish the relation between the probability of calculating the order $r$ when the register $AB$ is initialized in a pseudo-pure state and the one when the register $A$ is initialized in an arbitrary pure state. Moreover, we study the coherence and decoherence in noisy Shor's algorithm and give the lower bound of the probability that we can calculate the order $r$.

arXiv:2508.11962 [quant-ph]

(or arXiv:2508.11962v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2508.11962 Focus to learn more arXiv-issued DOI via DataCite

Chin. Phys. B 2026, 35: 060304

https://doi.org/10.1088/1674-1056/ae445e Focus to learn more DOI(s) linking to related resources

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.