Cited by 49Quantum Computing Algorithms and ArchitectureQuantum Mechanics and ApplicationsQuantum Information and Cryptography

Adiabatic approximation for weakly open systems

Open access
Thunström, Patrik, Åberg, Johan, Sjöqvist, Erik·2005·Physical Review A

Abstract

We generalize the adiabatic approximation to the case of open quantum systems, in the joint limit of slow change and weak open system disturbances. We show that the approximation is ``physically reasonable'' as under wide conditions it leads to a completely positive evolution, if the original master equation can be written on a time-dependent Lindblad form. We demonstrate the approximation for a non-Abelian holonomic implementation of the Hadamard gate, disturbed by a decoherence process. We compare the resulting approximate evolution with numerical simulations of the exact equation.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.72.022328

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. Physics IV: Analysis of Operators (Academic Press, New York, 1978).
  2. [20]K. Kraus, States, Effects, and Operations , Lecture Notes in Physics Vol. 190 (Springer, Berlin, 1983).

Cited by

Authors
Thunström, P., Åberg, J., & Sjöqvist, E.
Affiliations
Uppsala University (SE)
Venue
Physical Review A
Published
2005-08-18
Volume
72
Issue
2
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2289110952
Cited by
49
References
28
Citations by year
2025: 1 · 2024: 1 · 2023: 3 · 2021: 3 · 2020: 2 · 2019: 1 · 2018: 3 · 2017: 2 · 2016: 5 · 2015: 1 · 2014: 1 · 2013: 3 · 2012: 2
FWCI
3.88
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
adiabatic approximation, open quantum systems, completely positive maps, master equation, holonomic quantum computation, non-Abelian holonomy, Hadamard gate, decoherence

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review