Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ion Nechita

dblp:122/0319 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0003-3016-7795ORCID · corroborated

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

Theory of computation · 3

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
2 papers
Quantum computing and quantum information · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum information theory
minimum output entropy
0.522018
On the Minimum Output Entropy of Random Orthogonal Quantum Channels · IEEE Trans. Inf. Theory 2018
Quantum Channels With Polytopic Images and Image Additivity · IEEE Trans. Inf. Theory 2015
Quantum computing and quantum information
quantum channel
0.522018
On the Minimum Output Entropy of Random Orthogonal Quantum Channels · IEEE Trans. Inf. Theory 2018
Quantum Channels With Polytopic Images and Image Additivity · IEEE Trans. Inf. Theory 2015
Quantum computing and quantum information › quantum channel capacity
additivity
0.212015
Quantum Channels With Polytopic Images and Image Additivity · IEEE Trans. Inf. Theory 2015

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

stinespring dilation · 0.3haar measure · 0.3eigenvalue distribution · 0.3convex hull · 0.2
YearPublicationVenuePosition
2018 On the Minimum Output Entropy of Random Orthogonal Quantum Channels
abstract
We consider the sequences of random quantum channels defined by using the Stinespring formula with Haar-distributed random orthogonal matrices. For any fixed sequence of input states, we study the asymptotic eigenvalue distribution of the outputs through the tensor powers of random channels. We show that the input states achieving minimum output entropy are tensor products of maximally entangled states (Bell states) when the tensor power is even. This phenomenon is completely different from the one for random quantum channels constructed from Haar-distributed random unitary matrices, which leads us to formulate some conjectures about the regularized minimum output entropy.
Motohisa Fukuda, Ion Nechita
IEEE Trans. Inf. Theory2
2015 Quantum Channels With Polytopic Images and Image Additivity
abstract
We study quantum channels with respect to their image, i.e., the image of the set of density operators under the action of the channel. We first characterize the set of quantum channels having polytopic images and show that additivity of the minimal output entropy can be violated in this class. We then provide a complete characterization of quantum channels T that are universally image additive in the sense that for any quantum channel S, the image of T ⊗ S is the convex hull of the tensor product of the images of T and S. These channels turn out to form a strict subset of entanglement breaking channels with polytopic images and a strict superset of classical-quantum channels.
Motohisa Fukuda, Ion Nechita, Michael M. Wolf
IEEE Trans. Inf. Theory2
2013 Almost Hadamard matrices: The case of arbitrary exponents
Teodor Banica, Ion Nechita
Discret. Appl. Math.2