Daniel Cariello

dblp:155/6288 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0001-5548-5453ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 79% Algorithms and data structures · 10% Combinatorics and discrete mathematics · 10%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
positive partial transpose
0.212016
Completely Reducible Maps in Quantum Information Theory · IEEE Trans. Inf. Theory 2016
Quantum computing and quantum information
quantum information theory
0.212016
Completely Reducible Maps in Quantum Information Theory · IEEE Trans. Inf. Theory 2016
Algorithms and data structures
linear algebra
0.112016
Completely Reducible Maps in Quantum Information Theory · IEEE Trans. Inf. Theory 2016
Quantum computing and quantum information › quantum measurement
mutually unbiased bases
0.112016
Completely Reducible Maps in Quantum Information Theory · IEEE Trans. Inf. Theory 2016
Combinatorics and discrete mathematics › matrix theory
perron-frobenius theory
0.112016
Completely Reducible Maps in Quantum Information Theory · IEEE Trans. Inf. Theory 2016

Methods — techniques the papers use, named apart from their topics

realignment map · 0.2perron-frobenius theory · 0.2partial transposition · 0.2
YearPublicationVenuePosition
2016 Completely Reducible Maps in Quantum Information Theory
abstract
In order to compute the Schmidt decomposition of A ∈ Mk⊗ Mm, we must consider an associated self-adjoint map. Here, we show that if A is positive under partial transposition (PPT) or symmetric with positive coefficients (SPCs) or invariant under realignment, then its associated self-adjoint map is completely reducible. We give applications of this fact in quantum information theory. We recover some theorems (recently proved for PPT and SPC matrices), and we prove them for matrices invariant under realignment using theorems of the Perron-Frobenius theory. We also provide a new proof of the fact that if Ckcontains k mutually unbiased bases, then there exists another orthonormal basis which is mutually unbiased with these k bases. We study other types of matrices that could have the same property. We consider a collection of linear transformations acting on Mk⊗ Mk, which contains the partial transpositions and the realignment map. For each linear transformation, we consider the set of matrices in Mk⊗ Mk≃ M(k2) that are positive and remain positive, or invariant, under the action of this linear transformation. Within this family of sets, we have the set of PPT matrices, the set of SPC matrices and the set of matrices invariant under realignment. We show that these three sets are the only sets of this family, such that the associated self-adjoint map of each matrix is completely reducible. We also show that every matrix invariant under realignment is PPT in M2⊗ M2and we present a counterexample in Mk⊗ Mkand k ≥ 3.
Daniel Cariello
IEEE Trans. Inf. Theory1