Effects of dynamical phases in Shor's factoring algorithm with operational delays

Abstract

Ideal quantum algorithms usually assume that quantum computing is performed continuously by a sequence of unitary transformations. However, there always exist idle finite time intervals between consecutive operations in a realistic quantum computing process. During these delays, coherent "errors" will accumulate from the dynamical phases of the superposed wave functions. Here we explore the sensitivity of Shor's quantum factoring algorithm to such errors. Our results clearly show a severe sensitivity of Shor's factorization algorithm to the presence of delay times between successive unitary transformations. Specifically, in the presence of these {\it coherent "errors"}, the probability of obtaining the correct answer decreases exponentially with the number of qubits of the work register. A particularly simple phase-matching approach is proposed in this paper to {\it avoid} or suppress these {\it coherent errors} when using Shor's algorithm to factorize integers. The robustness of this phase-matching condition is evaluated analytically or numerically for the factorization of several integers: $4,15,21$, and 33.

8 pages with 5 figures

References in corpus (26)

• Decoherence Free Subspaces for Quantum Computation
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Quantum Computing
• Noiseless Quantum Codes
• Quantum Computers and Dissipation
• Josephson-Junction Qubits with Controlled Couplings
• Experimental Realization of an Order-Finding Algorithm with an NMR Quantum Computer
• Efficient factorization with a single pure qubit and $logN$ mixed qubits
• Multi-bit gates for quantum computing
• Realistic lower bounds for the factorization time of large numbers on a quantum computer
• Decoherence in ion traps due to laser intensity and phase fluctuations
• Decoherence limits to quantum computation using trapped ions
• Decoherence and fidelity in ion traps with fluctuating trap parameters
• Factoring in a Dissipative Quantum Computer
• Grover search with pairs of trapped ions
• Optimal multiqubit operations for Josephson charge qubits
• Quantum computation with two-level trapped cold ions beyond Lamb-Dicke limit
• Gate errors in solid state quantum computer architectures
• Implementing universal multi-qubit quantum logic gates in three and four-spin systems at room temperature
• Entanglement Simulations of Shor's Algorithm
• Quantum phase estimation algorithms with delays: effects of dynamical phases
• The Influence of Superpositional Wave Function Oscillations on Shor's Quantum Algorithm
• Error Avoiding Quantum Codes and Dynamical Stabilization of Grover's Algorithm
• An efficient single-step scheme for manipulating quantum information of two trapped ions beyond the Lamb-Dicke limit
• Coherently manipulating two-qubit quantum information using a pair of simultaneous laser pulses
• Correcting the effects of spontaneous emission on cold trapped ions

Cited by in corpus (7)

• Quantum phase measurement and Gauss sum factorization of large integers in a superconducting circuit
• Shor's factorization algorithm with a single control qubit and imperfections
• Effects of imperfections for Shor's factorization algorithm
• The modular multiplication operator and the quantized bakers maps
• Quantum Algorithms for Discrete Log Require Precise Rotations
• Quantum Algorithms in Cybernetics
• Symmetry boosts quantum computer performance