Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 183

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Pairwise concurrence dynamics: a four-qubit model

Open access
Yönaç, M, Yu, Ting, Eberly, J H · 2007 · Journal of Physics B: Atomic, Molecular and Optical Physics

Abstract

We examine entanglement dynamics via concurrence among four two-state systems labelled A , a , B , b . The four systems are arranged on an addressable 'lattice' in such a way that A and a at one location labelled Aa can interact with each other via excitation exchange, and the same for B and b at location Bb . The Aa location is prepared entangled with the Bb location, but their mutual complete isolation prevents interaction in the interval between actions of an external addressing agent. There are six pairwise concurrences on the lattice, and we follow their evolution in the interval between external actions. We show how entanglement evolves and may exhibit the non-analytic effect termed entanglement sudden death (ESD), with periodic recovery. These loss and gain processes may be interpreted as entanglement transfers between the subsystems.

Overview

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.1088/0953-4075/40/9/s02

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

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

Self-check

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

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

Citations

Cites

Show all 4 references

Cited by

See all 183

Metadata

Authors
Yönaç, M., Yu, T., & Eberly, J. H.
Venue
Journal of Physics B: Atomic, Molecular and Optical Physics
Published
2007-04-18
Volume
40
Issue
9
Pages
S45-S59
ISSN
  • 0953-4075 (ISSN-L)
  • 1361-6455
OpenAlex
W2122273529
Cited by
183
References
4
FWCI
32.70
Type
journal article
Language
en
Open access
bronze

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Pairwise concurrence dynamics: a four-qubit model. https://app.cochat.ai/papers/10.1088/0953-4075/40/9/s02
The paper
Yönaç, M., Yu, T., & Eberly, J. H. (2007). Pairwise concurrence dynamics: a four-qubit model. Journal of Physics B: Atomic, Molecular and Optical Physics. https://doi.org/10.1088/0953-4075/40/9/s02

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.