Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Fidelity decay for complex quantum dynamics and quantum computations

Tomaž Prosen

Published Sep 12, 2006• 0 citations
OpenAlex

Related papers

Characterization of Complex Quantum Dynamics with a Scalable NMR Information Processor

Colm A. Ryan, Joseph Emerson, David Poulin +2 more

We present experimental results on the measurement of fidelity decay under contrasting system dynamics using a nuclear magnetic resonance quantum information processor. The measurements were performed by implementing a scalable circuit in the model of deterministic quantum computation with only one quantum bit. The results show measurable differences between regular and complex behavior and for complex dynamics are faithful to the expected theoretical decay rate. Moreover, we illustrate how the experimental method can be seen as an efficient way for either extracting coarse-grained information about the dynamics of a large system or measuring the decoherence rate from engineered environments.

arXiv:quant-ph/0506085•Physical Review Letters•Dec 15, 2005•39 citations

Fidelity of quantum operations

Line Hjortshøj Pedersen, Niels Martin Møller, Klaus Mølmer

arXiv:quant-ph/0701138•Physics Letters A•Feb 26, 2007•339 citations

Quantum chaos algorithms and dissipative decoherence with quantum trajectories

Jae Weon Lee, Dima L. Shepelyansky

Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, the quantum ergodic regime, and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It is shown that the fidelity of quantum computation decays exponentially with time and that the decay rate is proportional to the number of qubits, number of quantum gates, and per gate dissipation rate induced by external decoherence. In the limit of strong dissipation the quantum algorithm generates a quantum attractor which may have a complex or simple structure. We also compare the effects of dissipative decoherence with the effects of static imperfections.

arXiv:quant-ph/0501120•Physical Review E•May 5, 2005•16 citations

Model dynamics for quantum computing

Frank Tabakin A

arXiv:1611.00664•Annals of Physics•May 16, 2017•15 citations

Quantum algorithms for quantum dynamics

Alexander Miessen, Pauline J. Ollitrault, Francesco Tacchino +1 more

Nature Computational Science•Dec 30, 2022•93 citations

Exponential Speedup with a Single Bit of Quantum Information: Measuring the Average Fidelity Decay

David Poulin, Robin Blume-Kohout, Raymond Laflamme +1 more

We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation. Thus for those maps admitting an efficient gate decomposition, it provides an exponential speedup over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of eigenvector statistics. Our result also illustrates the role of chaos in the process of decoherence.

arXiv:quant-ph/0310038•Physical Review Letters•Apr 30, 2004•79 citations
We present experimental results on the measurement of fidelity decay under contrasting system dynamics using a nuclear magnetic resonance quantum information processor. The measurements were performed by implementing a scalable circuit in the model of deterministic quantum computation with only one quantum bit. The results show measurable differences between regular and complex behavior and for complex dynamics are faithful to the expected theoretical decay rate. Moreover, we illustrate how the experimental method can be seen as an efficient way for either extracting coarse-grained information about the dynamics of a large system or measuring the decoherence rate from engineered environments.
Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, the quantum ergodic regime, and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It is shown that the fidelity of quantum computation decays exponentially with time and that the decay rate is proportional to the number of qubits, number of quantum gates, and per gate dissipation rate induced by external decoherence. In the limit of strong dissipation the quantum algorithm generates a quantum attractor which may have a complex or simple structure. We also compare the effects of dissipative decoherence with the effects of static imperfections.
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation. Thus for those maps admitting an efficient gate decomposition, it provides an exponential speedup over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of eigenvector statistics. Our result also illustrates the role of chaos in the process of decoherence.