Coherence and decoherence in generalized Shor's algorithm
This study investigates how quantum coherence and decoherence affect generalized Shor's algorithm under both ideal and noisy conditions. It derives lower and upper bounds on the algorithm's success probability by linking these coherence measures to the initial state's properties, establishing a fundamental link between quantum coherence and computational performance.