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

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

The Complexity of Relating Quantum Channels to Master Equations

Cubitt, Toby S., Eisert, Jens, Wolf, Michael M. · 2012 · Communications in Mathematical Physics

Overview

Integrity signals

Registry

Crossref · 10.1007/s00220-011-1402-y

Cites

59 of 59 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 56 references

Research works printed but not linked: 2

  1. Papadimitriou, C.H.: Computational Complexity. Reading, MA: Addison Wesley (1993)
  2. Carette, P.: Characterizations of embeddable 3x3 stochastic matrices with a negative eigenvalue. New York J. Math. 1, 120 (1995)

Cited by

See all 64

Metadata

Authors
Cubitt, T. S., Eisert, J., & Wolf, M. M.
Affiliations
  • Universidad Complutense de Madrid (ES)
  • University of Potsdam (DE)
  • University of Copenhagen (DK)
Corresponding author
Cubitt, Toby S.
Venue
Communications in Mathematical Physics
Published
2012-01-04
Volume
310
Issue
2
Pages
383-418
ISSN
  • 0010-3616 (ISSN-L)
  • 1432-0916
OpenAlex
W2130724093
Cited by
44
References
56
Citations by year
2026: 2 · 2025: 3 · 2024: 3 · 2023: 2 · 2022: 8 · 2021: 5 · 2020: 3 · 2019: 5 · 2018: 3 · 2017: 1 · 2016: 1 · 2014: 2 · 2013: 1 · 2012: 5
FWCI
2.52
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
  • Communications in Mathematical Physics (publishedVersion)
  • publish.UP (University of Potsdam) (submittedVersion)
  • Research at the University of Copenhagen (University of Copenhagen) (submittedVersion)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
Lindblad master equation, completely positive trace-preserving maps, open quantum systems, NP-hardness, P versus NP, quantum process tomography

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: The Complexity of Relating Quantum Channels to Master Equations. https://app.cochat.ai/papers/10.1007/s00220-011-1402-y
The paper
Cubitt, T. S., Eisert, J., & Wolf, M. M. (2012). The Complexity of Relating Quantum Channels to Master Equations. Communications in Mathematical Physics. https://doi.org/10.1007/s00220-011-1402-y

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.