Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuasi inversion of qubit channels
72
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quantum operations, or quantum channels cannot be inverted in general. An arbitrary state passing through a quantum channel looses its fidelity with the input. Given a quantum channel ${cal E}$, we introduce the concept of its quasi-inverse as a map ${cal E}^{qi}$ which when composed with ${cal E}$ increases its average input-output fidelity in an optimal way. The channel ${cal E}^{qi}$ comes as close as possible to the inverse of a quantum channel. We give a complete classification of such maps for qubit channels and provide quite a few illustrative examples.
rate research
Read More
Noncommuting observables cannot be simultaneously measured, however, under local hidden variable models, they must simultaneously hold premeasurement values, implying the existence of a joint probability distribution. We study the joint distributions of noncommuting observables on qubits, with possible criteria of positivity and the Frechet bounds limiting the joint probabilities, concluding that the latter may be negative. We use symmetrization, justified heuristically and then more carefully via the Moyal characteristic function, to find the quantum operator corresponding to the product of noncommuting observables. This is then used to construct Quasi-Bell inequalities, Bell inequalities containing products of noncommuting observables, on two qubits. These inequalities place limits on local hidden variable models that define joint probabilities for noncommuting observables. We find Quasi-Bell inequalities have a quantum to classical violation as high as $frac{3}{2}$, higher than conventional Bell inequalities. The result demonstrates the theoretical importance of noncommutativity in the nonlocality of quantum mechanics, and provides an insightful generalization of Bell inequalities.
We extend the definition of the conditional min-entropy from bipartite quantum states to bipartite quantum channels. We show that many of the properties of the conditional min-entropy carry over to the extended version, including an operational interpretation as a guessing probability when one of the subsystems is classical. We then show that the extended conditional min-entropy can be used to fully characterize when two bipartite quantum channels are related to each other via a superchannel (also known as supermap or a comb) that is acting on one of the subsystems. This relation is a pre-order that extends the definition of quantum majorization from bipartite states to bipartite channels, and can also be characterized with semidefinite programming. As a special case, our characterization provides necessary and sufficient conditions for when a set of quantum channels is related to another set of channels via a single superchannel. We discuss the applications of our results to channel discrimination, and to resource theories of quantum processes. Along the way we study channel divergences, entropy functions of quantum channels, and noise models of superchannels, including random unitary superchannels, and doubly-stochastic superchannels. For the latter we give a physical meaning as being completely-uniformity preserving.
We show that any incoherent qubit channel could be decomposed into four incoherent Kraus operators. The proof consists in showing existence of four incoherent Kraus operators by decomposing the corresponding Choi-Jamiol{}kowski-Sudarshan matrix. We mention some applications of this optimal decomposition. We also show that the Kraus rank and incoherent rank are different even for qubit channel.
A complete analysis of multi-mode bosonic Gaussian channels is proposed. We clarify the structure of unitary dilations of general Gaussian channels involving any number of bosonic modes and present a normal form. The maximum number of auxiliary modes that is needed is identified, including all rank deficient cases, and the specific role of additive classical noise is highlighted. By using this analysis, we derive a canonical matrix form of the noisy evolution of n-mode bosonic Gaussian channels and of their weak complementary counterparts, based on a recent generalization of the normal mode decomposition for non-symmetric or locality constrained situations. It allows us to simplify the weak-degradability classification. Moreover, we investigate the structure of some singular multi-mode channels, like the additive classical noise channel that can be used to decompose a noisy channel in terms of a less noisy one in order to find new sets of maps with zero quantum capacity. Finally, the two-mode case is analyzed in detail. By exploiting the composition rules of two-mode maps and the fact that anti-degradable channels cannot be used to transfer quantum information, we identify sets of two-mode bosonic channels with zero capacity.
The states of three-qubit systems split into two inequivalent types of genuine tripartite entanglement, namely the Greenberger-Horne-Zeilinger (GHZ) type and the $W$ type. A state belonging to one of these classes can be stochastically transformed only into a state within the same class by local operations and classical communications. We provide local quantum operations, consisting of the most general two-outcome measurement operators, for the deterministic transformations of three-qubit pure states in which the initial and the target states are in the same class. We explore these transformations, originally having standard GHZ and standard $W$ states, under the local measurement operations carried out by a single party and $p$ ($p=2,3$) parties (successively). We find a notable result that the standard GHZ state cannot be deterministically transformed to a GHZ-type state in which all its bipartite entanglements are nonzero, i.e., a transformation can be achieved with unit probability when the target state has at least one vanishing bipartite concurrence.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
