Appearance and stability of anomalously fluctuating states in Shor’s factoring algorithm

We analyze quantum computers which perform Shor’s factoring algorithm, paying attention to asymptotic properties as the number L of qubits is increased. Using numerical simulations and a general theory of the stabilities of many-body quantum states, we show the following: Anomalously fluctuating states (AFSs), which have anomalously large fluctuations of additive operators, appear in various stages of the computation. For large L, they decohere at anomalously great rates by weak noises that simulate noises in real systems. Decoherence of some of the AFSs is fatal to the results of the computation, whereas decoherence of some of the other AFSs does not have strong influence on the results of the computation. When such a crucial AFS decoheres, the probability of getting the correct computational result is reduced approximately proportional to $L^2.$ The reduction thus becomes anomalously large with increasing L, even when the coupling constant to the noise is rather small. Therefore, quantum computations should be improved in such a way that all AFSs appearing in the algorithms do not decohere at such great rates in the existing noises.