Factoring in a Dissipative Quantum Computer

Abstract

We describe an array of quantum gates implementing Shor's algorithm for prime factorization in a quantum computer. The array includes a circuit for modular exponentiation with several subcomponents (such as controlled multipliers, adders, etc) which are described in terms of elementary Toffoli gates. We present a simple analysis of the impact of losses and decoherence on the performance of this quantum factoring circuit. For that purpose, we simulate a quantum computer which is running the program to factor N = 15 while interacting with a dissipative environment. As a consequence of this interaction randomly selected qubits may spontaneously decay. Using the results of our numerical simulations we analyze the efficiency of some simple error correction techniques.

plain tex, 18 pages, 8 postscript figures

References in corpus (9)

• Elementary gates for quantum computation
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Quantum Computers and Dissipation
• Quantum Networks for Elementary Arithmetic Operations
• A Simple Quantum Computer
• An approximate Fourier transform useful in quantum factoring
• Quantum Computers, Factoring, and Decoherence
• Realistic lower bounds for the factorization time of large numbers on a quantum computer
• Quantum Error Correction by Coding

Cited by in corpus (40)

• Quantum Computing
• Dynamics of Loschmidt echoes and fidelity decay
• Addition on a Quantum Computer
• Quantum computers in phase space
• Quantum Computing: Pro and Con
• Emergence of Quantum Chaos in Quantum Computer Core and How to Manage It
• Anti-de Sitter space and black holes
• Quantum Computation
• Higher Dimensional Gravity, Propagating Torsion and AdS Gauge Invariance
• Decoherence Bounds on Quantum Computation with Trapped Ions
• Entanglement Across a Transition to Quantum Chaos
• Quantum Computer with Mixed States and Four-Valued Logic
• Arithmetic on a Distributed-Memory Quantum Multicomputer
• Quantum computation with phase drift errors
• Dissipative effects on quantum glassy systems
• General-Purpose Parallel Simulator for Quantum Computing
• Teleportation in a noisy environment: a quantum trajectories approach
• Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat
• Quantum computing of quantum chaos and imperfection effects
• Quantum Logical Operations on Encoded Qubits
• Shor's algorithm with fewer (pure) qubits
• Dissipative decoherence in the Grover algorithm
• Entanglement-screening by nonlinear resonances
• Quantum Plain and Carry Look-Ahead Adders
• Shor's factorization algorithm with a single control qubit and imperfections
• Quantum chaos algorithms and dissipative decoherence with quantum trajectories
• Appearance and Stability of Anomalously Fluctuating States in Shor's Factoring Algorithm
• Quantum Computing of Poincare Recurrences and Periodic Orbits
• Effects of dynamical phases in Shor's factoring algorithm with operational delays
• The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
• The Representation of Natural Numbers in Quantum Mechanics
• Effects of imperfections for Shor's factorization algorithm
• Robust quantum searching with spontaneously decaying qubits
• The modular multiplication operator and the quantized bakers maps
• CNOT-count optimized quantum circuit of the Shor's algorithm
• Initial states of qubit-boson models leading to conserved quantities
• Quantum Computation by Quantum Operations on Mixed States
• Quantum logic as a sum over classical logic gates
• Open n-Qubit System as a Quantum Computer with Four-Valued Logic
• Symmetry boosts quantum computer performance