Realistic lower bounds for the factorization time of large numbers on a quantum computer
arXiv:quant-ph/9512001 · doi:10.1103/PhysRevA.53.2986
Abstract
We investigate the time T a quantum computer requires to factorize a given number dependent on the number of bits L required to represent this number. We stress the fact that in most cases one has to take into account that the execution time of a single quantum gate is related to the decoherence time of the qubits that are involved in the computation. Although exhibited here only for special systems, this inter-dependence of decoherence and computation time seems to be a restriction in many current models for quantum computers and leads to the result that the computation time T scales much stronger with L than previously expected.
10 pages + 3 latex-figures
References in corpus (2)
Cited by in corpus (50)
- Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
- The Quantum Jump Approach to Dissipative Dynamics in Quantum Optics
- Quantum Computing
- Preserving coherence in quantum computation by pairing quantum bits
- From quantum cellular automata to quantum lattice gases
- Quantum Computing Using Dissipation to Remain in a Decoherence-Free Subspace
- Proposal for teleportation of an atomic state via cavity decay
- Optimal local implementation of non-local quantum gates
- Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer
- Approximate Quantum Fourier Transform and Decoherence
- Fast quantum gates for cold trapped ions
- Basics of Quantum Computation
- Efficient factorization with a single pure qubit and mixed qubits
- Quantum Physics and Computers
- Hyperfine Coherence in the Presence of Spontaneous Photon Scattering
- Dynamical description of quantum computing: generic nonlocality of quantum noise
- Quantum gates with "hot" trapped ions
- Decoherence limits to quantum computation using trapped ions
- Using a quantum computer to investigate quantum chaos
- Cold Trapped Ions as Quantum Information Processors
- Decoherence Bounds on Quantum Computation with Trapped Ions
- Quantum error correction in the presence of spontaneous emission
- Quantum Information Processing in Strongly Detuned Optical Cavities
- Fidelity and leakage of Josephson qubits
- Driving Atoms Into Decoherence-Free States
- Factoring in a Dissipative Quantum Computer
- Prevention of dissipation with two particles
- Preparation of pseudo-pure states by line-selective pulses in Nuclear Magnetic Resonance
- Optimal quantum codes for preventing collective amplitude damping
- Controlling decoherence of a two-level-atom in a lossy cavity
- Resonant cancellation of off-resonant effects in a multilevel qubit
- Journeys from Quantum Optics to Quantum Technology
- Concentration for unknown atomic entangled states via cavity decay
- Quantum Magnetism of Spin-Ladder Compounds with Trapped-Ion Crystals
- Effects of noise on quantum error correction algorithms
- Perturbative expansions for the fidelities and spatially correlated dissipation of quantum bits
- Conditional generation of error syndromes in fault-tolerant error correction
- Quantum state manipulation of trapped atomic ions
- Quantum dense coding scheme via cavity decay
- Optimal Clock Speed of Single-Qubit Operations on Open Quantum Systems
- Effects of dynamical phases in Shor's factoring algorithm with operational delays
- Upper Bounds for the Number of Quantum Clones under Decoherence
- Scaling of Decoherence Effects in Quantum Computers
- Enhanced Quantum Estimation via Purification
- Non-dissipative decoherence bounds on quantum computation
- Decoherence Rates in Large Scale Quantum Computers and Macroscopic Systems
- Correcting the effects of spontaneous emission on cold trapped ions
- Lower bounds on the absorption probability of beam splitters
- Coherent manipulation of two dipole-dipole interacting ions
- Correlations in interference and diffraction