相关论文: Entanglement Breaking Rank via Complementary Chann…
Discrete-time quantum walks provide a natural framework for quantum transport on complex networks. On regular structures, coin-walker entanglement has been widely used to characterize quantum transport and to support quantum algorithmic…
Quantum networks entangle remote nodes by distributing quantum states, which inevitably suffer from decoherence while traversing quantum channels. Pertinent decoherence mechanisms govern the channel capacity, its reach, and the quality and…
Concurrence and further entanglement quantifyers can be computed explicitly for channels of rank two if representable by just two Kraus operators. Almost all details are available for the subclass of rank two 1-qubit-channels. There is a…
In this thesis work, we have studied the role of positive and completely positive maps in detecting entanglement.
Single-qubit channels are studied under two broad classes: amplitude damping channels and generalized depolarizing channels. A canonical derivation of the Kraus representation of the former, via the Choi isomorphism is presented for the…
Given a completely positive map, we introduce a set of algebras that we refer to as its generalized multiplicative domains. These algebras are generalizations of the traditional multiplicative domain of a completely positive map and we…
We identify a universal short-time structure in symmetry-resolved entanglement dynamics -- the entanglement channel wave (ECW) -- arising from the decomposition of entanglement into conserved-quantum-number sectors that host robust,…
While algebraic derivations establish theoretical limits for quantum cloning, practical implementations require explicit operator representations that are often unavailable analytically. We present a computational framework that…
Covariance matrices are a useful tool to investigate correlations and entanglement in quantum systems. They are widely used in continuous variable systems, but recently also for finite dimensional systems powerful entanglement criteria in…
Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the…
Although quantum entanglement has already been verified experimentally and applied in quantum computing, quantum sensing and quantum networks, most of the existing measures cannot characterize the entanglement faithfully. In this work, by…
A condition for reversibility (sufficiency) of a channel with respect to a given countable family of states with bounded rank is obtained. This condition shows that a quantum channel preserving the Holevo quantity of at least one (discrete…
Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
Large-scale quantum networks have been employed to overcome practical constraints of transmissions and storage for single entangled systems. Our goal in this article is to explore the strong entanglement distribution of quantum networks. We…
We derive a general criterion to detect entangled states in multi-partite systems based on the symmetric logarithmic derivative quantum Fisher information. This criterion is a direct consequence of the fact that separable states do not…
We present two projects concerning the main part of my PhD work. In the first one we study quantum channels, which are the most general operations mapping quantum states into quantum states, from the point of view of their divisibility…
We present a formalism to detect genuine multipartite entanglement by considering projection map which is a positive but not completely positive map. Projection map has been motivated by the no-pancake theorem which repudiates the existence…
We investigate the hypercube networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information each part of a network shares with the rest of the…
Let M and N be full matrix algebras. A unital completely positive (UCP) map \phi:M\to N is said to preserve entanglement if its inflation \phi\otimes \id_N : M\otimes N\to N\otimes N has the following property: for every maximally entangled…