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
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Later on, the problem to decide whether a quantum channel is Markovian was shown to be very hard in the complexity theory sense [98,99]; however it has been analyzed for small-sized systems in [77] and [100].”
From Quantum non-Markovianity: characterization, quantification and detection (2014) · cites this paper as [99]
Citations
Cites
(1979) · Cited by 43,841
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Perturbation Theory for Linear Operators
Kato, T. (1995) · Classics in Mathematics · doi:10.1007/978-3-642-66282-9 · Cited by 16,290
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Horn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
On the generators of quantum dynamical semigroups
Lindblad, G. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608499 · Cited by 7,548 · cited 3×
“Two questions naturally arise: given a master equation, does it generate a a completely positive evolution (and if so which CPT maps does it produce)? Conversely, given one or more CPT maps, is there an underlying Markovian master equation that generates them (and if so which one)? These questions can equivalently be…”
BackgroundTheory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Research works printed but not linked: 2
- Papadimitriou, C.H.: Computational Complexity. Reading, MA: Addison Wesley (1993)
- Carette, P.: Characterizations of embeddable 3x3 stochastic matrices with a negative eigenvalue. New York J. Math. 1, 120 (1995)
Cited by
Quantum non-Markovianity: characterization, quantification and detection
Rivas, Á., Huelga, S. F., & Plenio, M. B. (2014) · Reports on Progress in Physics · doi:10.1088/0034-4885/77/9/094001 · Cited by 1,035
Koch, C. P., Boscain, U., Calarco, T., Dirr, G., Filipp, S., Glaser, S. J., Kosloff, R., Montangero, S., Schulte-Herbrüggen, T., Sugny, D., et al. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00138-x · Cited by 405
Can one trust quantum simulators?
Hauke, P., Cucchietti, F. M., Tagliacozzo, L., Deutsch, I., & Lewenstein, M. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/8/082401 · Cited by 315
Dynamical maps beyond Markovian regime
Chruściński, D. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.09.003 · Cited by 173
Dissipative Quantum Church-Turing Theorem
Kliesch, M., Barthel, T., Gogolin, C., Kastoryano, M., & Eisert, J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.120501 · Cited by 154
Self-citation
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.