The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index; none of the 4 sources its claims cite is checked for support yet.
Completely positive linear maps on complex matrices
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 No basis given · 2 Sources not found · 2 Own interpretation
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For some improvement, we may require {u:} to be linearly independent, then {Vi} must be linearly independent too.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
None of the sources cited for this claim could be matched to a paper in Crossref, so there is nothing to check it against.
In the paper
“Q : !JXn,+9Xm is hermitian-preserving iff @ admits an expression @(A) = Zei V;CAV, where ei = + 1, Vi are n X m matrices.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
What the sources say
- Not matchedcites [7, p. 134, Theorem 2.11]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Not matchedcites [5, p. 259, Theorem 21]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For a linear map a: 9JIm,-+Izll,, it is obvious that Q is hermitian-preserving iff (@(Eik))jk is hermitian.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“THEOREM 2. Let Cp be a linear map from %!, to %Q,,,.Then @ is completely positive iff (@(Ejk))lG i,k9n is positiue.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Let { W,}; be a class of n X m matrices, then Q, has the expression @(A) = X;W:AWp iff there exists an isometric I! ' x E matrix (@Pi, such that Wp = Zipppi Vi for all p.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Let Q,: 9.Rm,41Qm,.Then ip is extreme in CP[ZRn, VA!,; K] iff @ admits an expression @(A)=ZiVFAVi for all A in 9X,,, where y are n X m matrices, Xi VF Vi = K, and { y vi} ii is a linearly independent set.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“THEOREM 1 . Let Q, : !J.R,+!&,,.Then CD is completely positive iff Q is of the form ia = ZiVTAV for all A in 92, where Vi are n X m matrices.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption: Every positive matrix can be expressed as a sum of rank-one positive matrices (vectors).
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“THEOREM 7 . Zf @:!!JL&lR,,, is positive, then there exist 2Xm matrices y such that Q(A) =ZiVi*AVi for all 2X2 symmetric A.”
§ Completely Positive Linear Maps on Complex Matrices > Additional information
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
None of the sources cited for this claim could be matched to a paper in Crossref, so there is nothing to check it against.
In the paper
“Let F be an mm,-coefficient quadratic form F(s, t) = B,?+ B,st + B,t2 with real indeterminates s, t.If F(s, t) is positive for all s, t, then there exist k X m matrices C, D, such that F(s, t) = (Cs + Dt)*(Cs + Dt).(k is a certain integer.)”
§ Completely Positive Linear Maps on Complex Matrices > Additional information
What the sources say
- Not matchedcites [3,Theorem 21]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Not matchedcites [6, Appendix III]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For each n urn matrix V, it is evident that the map: %!,-+m,,, with A + V* A V is completely positive.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 6
- Probably not a substantial claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Endowed with the natural ordering induced by !TQ,(!lP,J, the class of hermitian-preserving maps is a partially ordered vector space over the reals, while the class of completely positive linear maps is just the positive cone.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Suppose a: YJ?”+%P, is completely positive.From Remark 4, we can write 0 in the form O(A) = Z,!VTAVi where { Vi} f is a class of linearly independent n X m matrices; hence e < nm.”
§ Completely Positive Linear Maps on Complex Matrices > Additional information
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Moreover, if { W,}; is also a linearly independent set, then F ' = I', and ( ppJpi is unitary.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In the proof of Theorem 1, the expression (@(Ejk))+ = Xi”* q is not unique, hence ( Vi} is not uniquely determined.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is evident that CP[!&, iDi!,; K] is a convex set, hence it is the convex hull of its extreme points.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Each linear map Q, : !IR2,-+'171, is determined by its values on Eik.Hence ip is completely determined by the single element (@(Ejk))l < i, k G n E 9JIm, (TRJ.”
§ Completely Positive Linear Maps on Complex Matrices > Abstract
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In particular, if m = I, we obtain the well-known fact that @ is a 'pure state' (an extreme identity-preserving positive functional) on YJ$, iff @ is a 'vector state' (i.e., there exists a unit vector u such that Q(A) = v*Av for all A).”
§ Completely Positive Linear Maps on Complex Matrices > Additional information
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper relies on this without support.
Every positive matrix can be expressed as a sum of rank-one positive matrices (vectors).
“As (E&< i,kGn is positive, so P(EjJ)r< j,k(n E !I&, (!l.R,J is positive; thus there exist vectors vi” (regarded as nm x 1 matrices) such that (Q(Ejk))jk =Z,uFvi.”
The paper relies on this without support.
Theorem 7 is not valid for higher order matrices.
“We remark that Theorem 7 is not valid for higher order matrices.This is just because the quoted result for an mm,-coefficient quadratic form cannot be generalized to the case of more than 2 real indeterminates, as will be shown in a forthcoming paper.”
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“E (t,t 1 ) ⊗ 1 1 (| |) 1 = 1 iff E (t,t 1 ) is CP, > 1 otherwise.”
From Quantum non-Markovianity: characterization, quantification and detection (2014) · cites this paper as [19]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Complete positive maps are much easier to characterize than maps that are merely positive [19,20]; they admit the so-called Kraus representation,”
From Quantum non-Markovianity: characterization, quantification and detection (2014) · cites this paper as [19]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“For this, typical methods used to generate hybrid entangled states using q-plates [46] and static meta-surfaces [47,48] will not suffice, hence we make use of an all-digital SPC approach [49]”
From Non-local skyrmions as topologically resilient quantum entangled states of light (2024) · cites this paper as [48]
Experimental — accuracy not yet measuredIn the citing paper
“for a Hilbert space with finite dimension N S = dim H S complete positivity is equivalent to N S -positivity [13].”
From Foundations and measures of quantum non-Markovianity (2012) · cites this paper as [13]
In the citing paper
“Theorem 5. A linear map : M n → M n is completely positive if and only if ⊗ I M n is positivity-preserving on M n ⊗ M n or equivalently, if and only if the matrix”
From An analysis of completely-positive trace-preserving maps on M2 (2002) · cites this paper as [4]
In the citing paper
“Lemma 10.The minimal number of Kraus operators A k needed to represent a completely positive map in the form (1) is rank[β( )].”
From An analysis of completely-positive trace-preserving maps on M2 (2002) · cites this paper as [4]
In the citing paper
“Lemma 9. A stochastic map is an extreme point of S if and only if it can be written in the form (1) (necessarily with k A k A † k = I ), so that the set of matrices {A j A † k } is linearly independent.”
From An analysis of completely-positive trace-preserving maps on M2 (2002) · cites this paper as [4]
In the citing paper
“After the results were first published, it was shown by Gottesman[32] that fault tolerant procedures for the universal set of gates introduced by Shor can be constructed for any stabilizer code, using basically the same technique as presented by Shor for the CSS codes, a result which was generalized to qupits[33].”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [32]
In the citing paper
“qPCA for quantum states can be extended to quantum processes by using the Choi-Jamiolkowski state (1/d) ij |i j| ⊗ S(|i j|) for a completely positive map S (ref.22).”
From Quantum principal component analysis (2014) · cites this paper as [22]
In the citing paper
“qPCA can then be used to construct the eigenvectors corresponding to the dominant eigenvalues of this state: the resulting spectral decomposition in turn encapsulates many of the most important properties of the channel 22 .”
From Quantum principal component analysis (2014) · cites this paper as [22]
Citations
Cites
Arveson, W. (1969) · Acta Mathematica · doi:10.1007/bf02392388 · Cited by 1,107
Positive functions on 𝐶*-algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1955-0069403-4 · Cited by 1,085
Positive Functions on C ∗ -Algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.2307/2032342 · Cited by 753
Positive Linear Maps of Operator Algebras
Størmer, E. (2012) · Springer monographs in mathematics · doi:10.1007/978-3-642-34369-8 · Cited by 428
Arveson, W. (1972) · Acta Mathematica · doi:10.1007/bf02392166 · Cited by 382
Positive linear maps of operator algebras
Størmer, E. (1963) · Acta Mathematica · doi:10.1007/bf02391860 · Cited by 354
Positive Linear Maps on C*-Algebras
Choi, M.-D. (1972) · Canadian Journal of Mathematics · doi:10.4153/cjm-1972-044-5 · Cited by 239
Self-citationLinear transformations which preserve hermitian and positive semidefinite operators
de Pillis, J. (1967) · Pacific Journal of Mathematics · doi:10.2140/pjm.1967.23.129 · Cited by 188
On subalgebras of $C^*$-algebras
Arveson, W. (1969) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1969-12293-7 · Cited by 144
Synthesis of Finite Passive n-Ports with Prescribed Positive Real Matrices of Several Variables
Koga, T. (1968) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1968.1082780 · Cited by 91
Cited by
Sorted by citations
Items 2,601–2,678 of 2,678
Enhancing decoding performance using efficient error learning
Iyer, P. S., Jain, A., Bartlett, S. D., & Emerson, J. (2026) · Physical Review Applied · doi:10.1103/vtj7-nh6l · Cited by 6
Mereological quantum phase transitions
Zanardi, P., Dallas, E., & Andreadakis, F. (2026) · Physical Review A · doi:10.1103/r193-5s7w
Characterizations of completely positive trace preserving majorants
Kian, M., Delavar, M. R., & Krnić, M. (2026) · Linear Algebra and its Applications · doi:10.1016/j.laa.2026.02.035
Kuno, Y., Orito, T., & Ichinose, I. (2026) · SciPost Physics Core · doi:10.21468/scipostphyscore.9.1.014 · Cited by 1
Annihilating and breaking Lorentz cone entanglement
Piana, F. L., & Müller‐Hermes, A. (2026) · Linear Algebra and its Applications · doi:10.1016/j.laa.2026.03.012
Scalable tomography of many-body quantum environments with low temporal entanglement
Luchnikov, I. A., Sonner, M., & Abanin, D. A. (2026) · Physical Review A · doi:10.1103/78jc-wcqb
Existing experiments suffice to indirectly verify the quantum essence of gravity
Plávala, M. (2026) · Physical review. D/Physical review. D. · doi:10.1103/87dc-qt73
Kraus Maps and Complex Stiefel Manifolds
Russkikh, I. T., Volkov, B. O., & Pechen, A. N. (2025) · Russian Microelectronics · doi:10.1134/s1063739725601675
IMED, B. (2026) · Research Square · doi:10.21203/rs.3.rs-9118683/v1
Operational and entropic characterization of weight-based dynamic resource measures
Fu, Z., Wang, Y., & Li, L. (2026) · Laser Physics Letters · doi:10.1088/1612-202x/ae53c7
Thermalization of bottomonium in the quark-gluon plasma
Brambilla, N., Magorsch, T., & Vairo, A. (2026) · Journal of High Energy Physics · doi:10.1007/jhep04(2026)007
Quantum correlations and causal structures
Ibnouhsein, I. (2014) · theses.fr (ABES) · doi:10.70675/a546325bz1c6fz4174zaad3z9f5af10b4c2e · Cited by 1
Multipartite causal relations in quantum theory
Wechs, J. (2020) · theses.fr (ABES) · doi:10.70675/ee7ec00fz8807z4385z99aezdcb6820ec8aa
Entanglement in high dimensional quantum systems
Saideh, I. (2019) · theses.fr (ABES) · doi:10.70675/ef92a08az6eedz4d92z8ca9z14682121d1d7
Exact quantum noise deconvolution with partial knowledge of noise
Ahmadvand, N., & Memarzadeh, L. (2026) · Physical Review A · doi:10.1103/b92y-rp8j
Photonic Resources for the Implementation of Quantum Network Protocols
Neves, S. (2022) · theses.fr (ABES) · doi:10.70675/61e92952z6a72z46bfz978dz81b8020c4aee
Optimal measurement strategies for quantum states and quantum channels estimation
Milazzo, N. (2021) · theses.fr (ABES) · doi:10.70675/ab5e9c11z573dz4938za409z4aae63958c83
Multipartite communications over quantum networks
Meignant, C. (2021) · theses.fr (ABES) · doi:10.70675/3104b4a2z4773z4e41zb718zc3e93669f1aa
Automated design of photonic quantum circuits
Yao, Y. (2023) · theses.fr (ABES) · doi:10.70675/137f6c70zbc72z4cbdzb338z6722012d84e0
Entangling power of nonentangling channels
Pinske, J., Sperling, J., & Mølmer, K. (2026) · Physical Review A · doi:10.1103/vy93-dnc8
Colas, T. (2023) · theses.fr (ABES) · doi:10.70675/c036277dz5795z4dcaz8673z5e60a8568a01 · Cited by 5
On Adaptivity in Classical and Quantum Learning
Oufkir, A. (2023) · theses.fr (ABES) · doi:10.70675/bb8a85a6z8f6dz406ez8fb8ze4ae31a058ee
Spin network Entanglement and Bulk-Boundary Map in Loop Quantum Gravity
Chen, Q. (2022) · theses.fr (ABES) · doi:10.70675/0e468f9ez1ba1z4773z969dzdef8d8a59ebd
Geometric phase of arbitrary Mueller evolutions and its two-level quantum analog
Gil, J. J. (2026) · Optics Letters · doi:10.1364/ol.595899
The disparate impact of noise on quantum learning algorithms
Angrisani, A. (2023) · theses.fr (ABES) · doi:10.70675/69f942ebz4417z4eceza746z1c9d436d09bb · Cited by 1
Quantifying the imaginarity of quantum channels
Fu, S., Dong, T., & Li, X. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05159-4
Balancing Wireless Sensing Performance and Privacy Protection With Multi-Antenna Systems
Tan, H., Cai, Y., Sha, M., et al. (2026) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2026.3683275
Fan, Y., & Li, L. (2026) · Physics Letters A · doi:10.1016/j.physleta.2026.131690
Edge bits in an average symmetry protected topological mixed state
Kuno, Y. (2026) · Physical review. B./Physical review. B · doi:10.1103/6qjs-gzfk
A note on the extreme points of 1-qubit quantum Markov chains on 2 vertices
Lardizabal, C. F. (2026) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae6747
Open Quantum Dynamics without Complete Positivity: a Criticism
Benatti, F., Chruściński, D., & Pascazio, S. (2026) · Open Systems & Information Dynamics · doi:10.1142/s1230161226500010
Noise resilience in symmetric exchange interactions on NISQ processors
AbuGhanem, M. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07757-8
Isometric properties of completely positive maps
Sun, X., Gao, S., & Li, Y. W. (2026) · Positivity · doi:10.1007/s11117-026-01198-4
Quantum simulation in the entanglement picture
Wang, D.-S., Xu, X., & Liu, Y.-D. (2026) · Quantum Review Letters · doi:10.1016/j.qrl.2026.05.003 · Cited by 1
Pathak, V., & Srikanth, R. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05219-9
Multi-setting biased causal game with indefinite causal order
Gu, J., & Yan, X. (2026) · Laser Physics Letters · doi:10.1088/1612-202x/ae7051
Error threshold of Sachdev-Ye-Kitaev models from strong-to-weak parity symmetry breaking
Kim, J., Altman, E., & Lee, J. Y. (2026) · Physical review. B./Physical review. B · doi:10.1103/srf2-1f6d · Cited by 1
Operator delocalization in disordered spin chains via exact MPO marginals
Pineda-Jiménez, J., Collura, M., Passarelli, G., Lucignano, P., Rossini, D., & Russomanno, A. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae774b
Adaptive unitary quantum process tomography approaching the parameter-counting reference lower bound
Peilin, W., Tianqi, X., Zhangkai, Z., et al. (2026) · Acta Physica Sinica · doi:10.7498/aps.75.20260555
Commuting Quantum Operations Factorise
Renner, R., & Wolf, R. (2026) · Communications in Mathematical Physics · doi:10.1007/s00220-026-05655-9
Borrelli, R., & Takahashi, H. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0332266
Delayed-Choice Phenomena in the Projection Evolution Model
Góźdź, M., GÓŹDŹ, A., & Lider, K. (2026) · Entropy · doi:10.3390/e28060640
Dynamical irreversibility and local decoherence in quantum many-body chaos
de Leon, J. A., Gonzalez, M., & Diaz-Mejia, C. (2026) · Physical Review A · doi:10.1103/zdjp-1rck
Quantum Tsallis Relative Entropy with Localization Characteristics
Shuai, W. A. N. G., Gou, L., & Han, Q. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06385-3
Schmidt number witnesses from purity-controlled k -positive maps
Huang, W., & Li, B. (2026) · Laser Physics Letters · doi:10.1088/1612-202x/ae7704
Exponentially accelerated relaxation and quantum Mpemba effect in open quantum systems
Caldas, E. L., & Pires, D. P. (2026) · Physical Review A · doi:10.1103/7gsd-21tb
Felser, T., & Montangero, S. (2026) · Graduate texts in physics · doi:10.1007/978-3-032-17635-6_5
Covariant measures of non-Markovianity in curved spacetime
Waghmare, T. (2026) · Classical and Quantum Gravity · doi:10.1088/1361-6382/ae7d7c
Qudit Selection for Amplitude Damping Quantum Channel
Parthiv, K. G. K., Tiwari, N., & Selvamuthu, D. (2026) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc65185.2026.11555735
An analysis of Shor and Steane code performance under coherent errors
Liu, C. (2026) · International Journal of Quantum Information · doi:10.1142/s021974992650019x
Storage and retrieval of two unknown unitary channels
Sedlák, M., Stárek, R., Horová, N., Mičuda, M., Fiurášek, J., & Bisio, A. (2026) · Physical Review A · doi:10.1103/56sd-xw8b · Cited by 4
Sense-Then-Serve: A Novel Framework From ISAC Toward Sensing-Enhanced SWIPT
Wu, N., Li, H., Jiang, R., Su, N., Zhang, Y., Yuan, W., & You, C. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3707847
Singular value transformation for unknown quantum channels
Anonymous, Rossi, Z. M., Taranto, P., & Murao, M. (2026) · Physical Review A · doi:10.1103/321q-k5dh · Cited by 4
Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes
Wen, K.-X., Hu, D.-L., Li, S., & Xiang, Z.-L. (2026) · Physical Review A · doi:10.1103/yh45-pj3r
SU(2)-Covariant Quantum Channels
Rudnicki, Ł., Klimov, A. B., Muñoz, A. S., et al. (2026) · Symmetry · doi:10.3390/sym18071146
Beretta, G. P., Ray, R. K., & von Spakovsky, M. R. (2026) · Entropy · doi:10.3390/e28070772
Variational quantum operator simulation
Anonymous, Ito, K., Shimizu, Y., & Fujii, K. (2026) · Physical Review A · doi:10.1103/gv8m-gpdl · Cited by 1
Quantum Capacity Analysis of the DNA-to-Protein Channel via Extreme Channel Decomposition
Barbaro, A., & Magarini, M. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11587469
Geometry, symmetry, and topology of orientation‑reversing Pauli channels
Chuiko, G. P., Darnapuk, Y. S., & Kravchenko, P. (2026) · Physics Letters A · doi:10.1016/j.physleta.2026.132032
Model Checking Matrix Product States Against Linear Chain Logic
Xu, M., Chen, Y., & Guan, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32537-2_17
Quokka#: Quantum Computing with #SAT
Mei, J., Zak, D., Osama, M., Coopmans, T., & Laarman, A. (2026) · International Conference on Computer Aided Verification · doi:10.1007/978-3-032-32537-2_19 · Cited by 1
Optimising Trotter-Suzuki simulations of Markovian open quantum systems via classical search
Pillay, S. M., David, I. J., Sinayskiy, I., et al. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05267-1
Non‐Hermitian Photon Blockade With Quantum Jumps
Yin, S., Hao, X. Q., & Yi, X. X. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70358
Semidefinite programming for quantum channel learning
Anonymous, Dubov, V. V., Ivanov, V. K., et al. (2026) · Physical review. E · doi:10.1103/kdl5-smrh
Quantum Logic Networks: PLN-Style Inference in the Operator Evidence Algebra
Goertzel, B. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-33010-9_18
Temporal Quantum-like Cognition in a Free-Energy Variational Framework
Tanaka, S. (2026) · Entropy · doi:10.3390/e28080848
An Introduction to Quantum Information
Strömberg, T. (2026) · Springer theses · doi:10.1007/978-3-032-14267-2_1
Anonymous (2026) · Physical Review A · doi:10.1103/bgxx-s3qj
A hybrid ALS method for quantum channel reconstruction
Chu, M. T., & Lin, M. M. (2026) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drag080
Structure and Classification of Matrix Product Quantum Channels
Anonymous, Cirac, J. I., Trivedi, R., & Styliaris, G. (2026) · Physical Review Letters · doi:10.1103/4216-bgrp
Quantum interference conventions: Overlap determinability and the unified no-superposition principle
Bang, J., Cho, K., & Yee, K. H. (2026) · Physical Review A · doi:10.1103/s3mc-38zd
Halder, S. (2026) · Apress eBooks · doi:10.1007/979-8-8688-2857-7_6
Unique determination and generation of rank-two single-qubit quantum channels
Kuklina, N. E., Vasilenko, V. I., Volkov, B. O., & Pechen, A. N. (2026) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae9b4f
Information propagation through disordered quantum spin chains
Burrell, C. K. (2012) · OpenGrey (Institut de l'Information Scientifique et Technique)
Optimal control and quantum simulations in superconducting quantum devices
Egger, D. J. (2014) · Publications of the UdS (Saarland University) · doi:10.22028/d291-23000
Metadata
- Authors
- Choi, M.-D.
- Affiliations
- University of California, Berkeley (US)
- Corresponding author
- Choi, Man-Duen
- Venue
- Linear Algebra and its Applications
- Publisher
- Elsevier BV
- Published
- 1975-06
- Volume
- 10
- Issue
- 3
- Pages
- 285-290
- ISSN
- 0024-3795 (ISSN-L)
- OpenAlex
- W2116102644
- Cited by
- 2,659
- References
- 12
- Citations by year
- 2026: 122 · 2025: 216 · 2024: 189 · 2023: 205 · 2022: 161 · 2021: 167 · 2020: 132 · 2019: 152 · 2018: 112 · 2017: 98 · 2016: 95 · 2015: 100 · 2014: 93 · 2013: 90 · 2012: 97
- FWCI
- 4.55
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Linear Algebra and its Applications (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Mathematical Physics › Advanced Operator Algebra Research
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Keywords
- complex matrices, matrix algebra, positive linear maps, operator algebras
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.
A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
