scholarly journals Depolarizing behavior of quantum channels in higher dimensions

2011 ◽  
Vol 11 (5&6) ◽  
pp. 466-484
Author(s):  
Easwar Magesan
Keyword(s):  
Quantum Channel ◽  
Higher Dimensions ◽  
Uniqueness Result ◽  
Quantum Gate ◽  
Distance Measures ◽  
Independent Interest ◽  
Quantum Channels ◽  
Quantum Operations ◽  
Pure States ◽  
Depolarizing Channel

The paper analyzes the behavior of quantum channels, particularly in large dimensions, by proving various properties of the quantum gate fidelity. Many of these properties are of independent interest in the theory of distance measures on quantum operations. A non-uniqueness result for the gate fidelity is proven, a consequence of which is the existence of non-depolarizing channels that produce a constant gate fidelity on pure states. Asymptotically, the gate fidelity associated with any quantum channel is shown to converge to that of a depolarizing channel. Methods for estimating the minimum of the gate fidelity are also presented.

scholarly journals Relating Entropies of Quantum Channels

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 1028
Author(s):  
Dariusz Kurzyk ◽  
Łukasz Pawela ◽  
Zbigniew Puchała
Keyword(s):  
Relative Entropy ◽  
Upper Bound ◽  
Quantum Channel ◽  
Von Neumann Entropy ◽  
Quantum Channels ◽  
Von Neumann ◽  
Channel One ◽  
Depolarizing Channel

In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi–Jamiołkowski state. The second one is based on the relative entropy of the output of the extended channel relative to the output of the extended completely depolarizing channel. This entropy then needs to be optimized over all possible input states. Our results first show that the former entropy provides an upper bound on the latter. Next, we show that for unital qubit channels, this bound is saturated. Finally, we conjecture and provide numerical intuitions that the bound can also be saturated for random channels as their dimension tends to infinity.

Mixing doubly stochastic quantum channels with the completely depolarizing channel

2009 ◽  
Vol 9 (5&6) ◽  
pp. 406-413
Author(s):  
J. Watrous
Keyword(s):  
Quantum Channel ◽  
Convex Combination ◽  
Quantum Channels ◽  
Doubly Stochastic ◽  
Depolarizing Channel

It is proved that every doubly stochastic quantum channel that is properly averaged with the completely depolarizing channel can be written as a convex combination of unitary channels. It follows that within the space of doubly stochastic quantum channels, there is a ball with positive radius around the completely depolarizing channel within which all channels are convex combinations of unitary channels.

scholarly journals Jordan products of quantum channels and their compatibility

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Mark Girard ◽  
Martin Plávala ◽  
Jamie Sikora
Keyword(s):  
Quantum State ◽  
Sufficient Conditions ◽  
The Other ◽  
Independent Interest ◽  
Quantum Channels ◽  
Semidefinite Programs ◽  
Jordan Product ◽  
Marginal Problem ◽  
Jordan Products ◽  
Product Of Matrices

AbstractGiven two quantum channels, we examine the task of determining whether they are compatible—meaning that one can perform both channels simultaneously but, in the future, choose exactly one channel whose output is desired (while forfeiting the output of the other channel). Here, we present several results concerning this task. First, we show it is equivalent to the quantum state marginal problem, i.e., every quantum state marginal problem can be recast as the compatibility of two channels, and vice versa. Second, we show that compatible measure-and-prepare channels (i.e., entanglement-breaking channels) do not necessarily have a measure-and-prepare compatibilizing channel. Third, we extend the notion of the Jordan product of matrices to quantum channels and present sufficient conditions for channel compatibility. These Jordan products and their generalizations might be of independent interest. Last, we formulate the different notions of compatibility as semidefinite programs and numerically test when families of partially dephasing-depolarizing channels are compatible.

scholarly journals Probabilistic Resumable Quantum Teleportation of a Two-Qubit Entangled State

Entropy ◽  
2019 ◽  
Vol 21 (4) ◽  
pp. 352 ◽  
Author(s):  
Zhan-Yun Wang ◽  
Yi-Tao Gou ◽  
Jin-Xing Hou ◽  
Li-Ke Cao ◽  
Xiao-Hui Wang
Keyword(s):  
Quantum Channel ◽  
Quantum Teleportation ◽  
The State ◽  
Entangled States ◽  
Entangled State ◽  
Quantum Channels ◽  
Unknown State ◽  
Optimal Probability

We explicitly present a generalized quantum teleportation of a two-qubit entangled state protocol, which uses two pairs of partially entangled particles as quantum channel. We verify that the optimal probability of successful teleportation is determined by the smallest superposition coefficient of these partially entangled particles. However, the two-qubit entangled state to be teleported will be destroyed if teleportation fails. To solve this problem, we show a more sophisticated probabilistic resumable quantum teleportation scheme of a two-qubit entangled state, where the state to be teleported can be recovered by the sender when teleportation fails. Thus the information of the unknown state is retained during the process. Accordingly, we can repeat the teleportion process as many times as one has available quantum channels. Therefore, the quantum channels with weak entanglement can also be used to teleport unknown two-qubit entangled states successfully with a high number of repetitions, and for channels with strong entanglement only a small number of repetitions are required to guarantee successful teleportation.

Hierarchical Identity-Based Signature in Polynomial Rings

2020 ◽  
Vol 63 (10) ◽  
pp. 1490-1499
Author(s):  
Zhichao Yang ◽  
Dung H Duong ◽  
Willy Susilo ◽  
Guomin Yang ◽  
Chao Li ◽  
...  
Keyword(s):  
Higher Dimensions ◽  
Polynomial Rings ◽  
Independent Interest ◽  
Private Key ◽  
Large Community ◽  
New Construction ◽  
Identity Based ◽  
And Storage ◽  
New Algorithms ◽  
Core Role

Abstract Hierarchical identity-based signature (HIBS) plays a core role in a large community as it significantly reduces the workload of the root private key generator. To make HIBS still available and secure in post-quantum era, constructing lattice-based schemes is a promising option. In this paper, we present an efficient HIBS scheme in polynomial rings. Although there are many lattice-based signatures proposed in recent years, to the best of our knowledge, our HIBS scheme is the first ring-based construction. In the center of our construction are two new algorithms to extend lattice trapdoors to higher dimensions, which are non-trivial and of independent interest. With these techniques, the security of the new scheme can be proved, assuming the hardness of the Ring-SIS problem. Since operations in the ring setting are much faster than those over integers and the new construction is the first ring-base HIBS scheme, our scheme is more efficient and practical in terms of computation and storage cost when comparing to the previous constructions.

scholarly journals Construction of genuinely entangled subspacesand the associated bounds on entanglement measures for mixed states

2021 ◽  
Author(s):  
Konstantin Antipin
Keyword(s):  
Information Processing ◽  
Quantum Information ◽  
Lower Bounds ◽  
Quantum Information Processing ◽  
Multipartite Entanglement ◽  
Quantum Channels ◽  
Valuable Resource ◽  
Mixed States ◽  
Entanglement Measures ◽  
Pure States

Abstract Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information processing. A recent direction of research is the construction of genuinely entangled subspaces — the class of subspaces consisting entirely of genuinely entangled pure states. In this paper we present methods of construction of such subspaces including those of maximal possible dimension. The approach is based on the composition of bipartite entangled subspaces and quantum channels of certain types. The examples include maximal subspaces for systems of three qubits, four qubits, three qutrits. We also provide lower bounds on two entanglement measures for mixed states, the concurrence and the convex-roof extended negativity, which are directly connected with the projection on genuinely entangled subspaces.

Performance characterization of Pauli channels assisted by indefinite causal order and post-measurement

2020 ◽  
Vol 20 (15&16) ◽  
pp. 1261-1280
Author(s):  
Francisco Delgado ◽  
Carlos Cardoso-Isidoro
Keyword(s):  
Quantum Channel ◽  
Communication Channel ◽  
Quantum Communication ◽  
Quantum Channels ◽  
Causal Order ◽  
Combined Process ◽  
Performance Characterization ◽  
Output State ◽  
Transmission Of Information

Indefinite causal order has introduced disruptive procedures to improve the fidelity of quantum communication by introducing the superposition of { orders} on a set of quantum channels. It has been applied to several well characterized quantum channels as depolarizing, dephasing and teleportation. This work analyses the behavior of a parametric quantum channel for single qubits expressed in the form of Pauli channels. Combinatorics lets to obtain affordable formulas for the analysis of the output state of the channel when it goes through a certain imperfect quantum communication channel when it is deployed as a redundant application of it under indefinite causal order. In addition, the process exploits post-measurement on the associated control to select certain components of transmission. Then, the fidelity of such outputs is analysed to characterize the generic channel in terms of its parameters. As a result, we get notable enhancement in the transmission of information for well characterized channels due to the combined process: indefinite causal order plus post-measurement.

Solution to time-energy costs of quantum channels

2015 ◽  
Vol 15 (7&8) ◽  
pp. 685-693
Author(s):  
Chi-Hang F. Fung ◽  
H. F. Chau ◽  
Chi-Kwong Li ◽  
Nung-Sing Sze
Keyword(s):  
Lower Bound ◽  
Semidefinite Programming ◽  
Energy Cost ◽  
Quantum Channel ◽  
Positive Semidefinite ◽  
Energy Costs ◽  
Quantum Channels ◽  
General Quantum ◽  
Special Cases

We derive a formula for the time-energy costs of general quantum channels proposed in [Phys. Rev. A {\bf 88}, 012307 (2013)]. This formula allows us to numerically find the time-energy cost of any quantum channel using positive semidefinite programming. We also derive a lower bound to the time-energy cost for any channels and the exact the time-energy cost for a class of channels which includes the qudit depolarizing channels and projector channels as special cases.

Generalized three-party sharing of operations on remote single qutrit

2014 ◽  
Vol 12 (03) ◽  
pp. 1450011 ◽  
Author(s):  
Pengfei Xing ◽  
Yimin Liu ◽  
Chuanmei Xie ◽  
Xiansong Liu ◽  
Zhanjun Zhang
Keyword(s):  
Success Probability ◽  
Entangled States ◽  
Entangled State ◽  
Quantum Channels ◽  
Channel State ◽  
Classical Communication ◽  
Maximally Entangled State ◽  
Quantum Operations ◽  
Local Operation ◽  
Maximally Entangled States

Two three-party schemes are put forward for sharing quantum operations on a remote qutrit with local operation and classical communication as well as shared entanglements. The first scheme uses a two-qutrit and three-qutrit non-maximally entangled states as quantum channels, while the second replaces the three-qutrit non-maximally entangled state with a two-qutrit. Both schemes are treated and compared from the four aspects of quantum and classical resource consumption, necessary-operation complexity, success probability and efficiency. It is found that the latter is overall more optimal than the former as far as a restricted set of operations is concerned. In addition, comparisons of both schemes with other four relevant ones are also made to show their two features, including degree generalization and channel-state generalization. Furthermore, some concrete discussions on both schemes are made to expose their important features of security, symmetry and experimental feasibility. Particularly, it is revealed that the success probabilities and intrinsic efficiencies in both schemes are completely determined by the shared entanglement.

LIMITATION ON THE ACCESSIBLE INFORMATION FOR QUANTUM CHANNELS WITH INEFFICIENT MEASUREMENTS

2005 ◽  
Vol 03 (supp01) ◽  
pp. 87-95
Author(s):  
KURT JACOBS
Keyword(s):  
Quantum System ◽  
Von Neumann Entropy ◽  
Quantum Channels ◽  
Initial State ◽  
Von Neumann ◽  
Classical Information ◽  
Quantum Operations ◽  
Amount Of Information ◽  
Accessible Information

To transmit classical information using a quantum system, the sender prepares the system in one of a set of possible states and sends it to the receiver. The receiver then makes a measurement on the system to obtain information about the senders choice of state. The amount of information which is accessible to the receiver depends upon the encoding and the measurement. Here we derive a bound on this information which generalizes the bound derived by Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76, 3452 (1996)] to include inefficient measurements, and thus all quantum operations. This also allows us to obtain a generalization of a bound derived by Hall [Hall, Phys. Rev. A 55, 100 (1997)], and to show that the average reduction in the von Neumann entropy which accompanies a measurement is concave in the initial state, for all quantum operations.

Sign in / Sign up

Export Citation Format

Share Document