Efficient quantum computing insensitive to phase errors
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for exponentially many orbits even when the quantum fidelity drops to zero. Such phase-insensitive algorithms open new possibilities for computation on realistic quantum computers.
6 pages, 2 figures, to appear in "Electronic Correlations: from meso- to nano-physics", edited by G. Montambaux and T. Martin, Rencontres de Moriond (2001); more detailed discussion of measurements added
6 pages, 2 figures, to appear in "Electronic Correlations: from meso- to nano-physics", edited by G. Montambaux and T. Martin, Rencontres de Moriond (2001); more detailed discussion of measurements added