Efficient quantum computing insensitive to phase errors

Simple item page
dc.creatorGeorgeot, B.
dc.creatorShepelyansky, D. L.
dc.date2001-02-16
dc.date2001-05-29
dc.date.accessioned2026-07-07T06:01:38Z
dc.date.available2026-07-07T06:01:38Z
dc.descriptionWe 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.
dc.description6 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
dc.identifierhttps://arxiv.org/abs/quant-ph/0102082
dc.identifierhttp://arxiv.org/abs/quant-ph/0102082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89329
dc.subjectQuantum Physics
dc.subjectCondensed Matter
dc.subjectChaotic Dynamics
dc.titleEfficient quantum computing insensitive to phase errors
dc.typetext

Files

Collections

arXiv