A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations

Abstract

The problem of the quantitative degradation of the performance of a quantum computer due to noisy unitary gates (imperfect external control) is studied. It is shown that quite general conclusions on the evolution of the fidelity can be reached by using the conjecture that the set of states visited by a quantum algorithm can be replaced by the uniform (Haar) ensemble. These general results are tested numerically against quantum computer simulations of two particular periodically driven quantum systems.

15 pages, 10 figures; only minor corrections, one reference added. This is the version accepted for publication

References in corpus (23)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Mechanics helps in searching for a needle in a haystack
• Decoherence, einselection, and the quantum origins of the classical
• Quantum Computers and Dissipation
• Maintaining coherence in Quantum Computers
• Unification of Dynamical Decoupling and the Quantum Zeno Effect
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Quantum Chaos Border for Quantum Computing
• Toward an architecture for quantum programming
• Error Prevention Scheme with Four Particles
• Efficient Quantum Computing of Complex Dynamics
• Robust Control of Quantum Information
• Exponential Gain in Quantum Computing of Quantum Chaos and Localization
• Quantum computation with phase drift errors
• The effect of unitary noise on Grover's quantum search algorithm
• Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat
• Quantum computing of quantum chaos and imperfection effects
• Quantum Computing of Quantum Chaos in the Kicked Rotator Model
• Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaos
• Imperfection effects for multiple applications of the quantum wavelet transform
• Quantum computation of the Anderson transition in presence of imperfections
• Dynamical fidelity of a solid-state quantum computation
• Schrodinger cat animated on a quantum computer

Cited by in corpus (11)

• Dynamics of Loschmidt echoes and fidelity decay
• Scalable Noise Estimation with Random Unitary Operators
• Efficient error characterization in Quantum Information Processing
• Dissipative decoherence in the Grover algorithm
• Quantum chaos algorithms and dissipative decoherence with quantum trajectories
• Testing a Quantum Computer
• Fault Models for Quantum Mechanical Switching Networks
• Robust and efficient generator of almost maximal multipartite entanglement
• Classical versus quantum errors in quantum computation of dynamical systems
• Robust quantum searching with spontaneously decaying qubits
• Phase diagram for the Grover algorithm with static imperfections