A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels which is applied to an input register. It is well-known that such a device is impossible with a finite-dimensional program register for any set that contains infinitely many unitary quantum channels (Nielsen and Chuang's No-Programming Theorem), meaning that a universal programmable quantum processor does not exist. The situation changes if the system has symmetries. Indeed, here we consider group-covariant channels. If the group acts irreducibly on the channel input, these channels can be implemented exactly by a programmable quantum processor with finite program dimension (via teleportation simulation, which uses the Choi-Jamiolkowski state of the channel as a program). Moreover, by leveraging the representation theory of the symmetry group action, we show how to remove redundancy in the program and prove that the resulting program register has minimum Hilbert space dimension. Furthermore, we provide upper and lower bounds on the program register dimension of a processor implementing all group-covariant channels approximately.
A universal programmable detector is a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite dimension d for the ancilla only approximate universal programmability is possible, with "size" d=f(1/e) increasing function of the "accuracy" 1/e. In this letter we show that, much better than the exponential size known in the literature, one can achieve polynomial size. An explicit example with linear size is also presented. Finally, we show that for covariant measurements exact programmability is feasible.
Formalism of discrete noncommutative Fourier transform is developed and applied to the study of Weyl-covariant channels. We then extend a result in quant-ph/0509126 concerning a bound of the maximal output 2-norm of a Weyl-covariant channel. A class of channels which attain the bound is introduced, for which the multiplicativity of the maximal output 2-norm is proven. Complementary channels are described which share the multiplicativity properties with the Weyl-covariant channels.
Constructing all extreme instances of the set of completely positive trace-preserving (CPTP) maps, i.e., quantum channels, is a challenging valuable open problem in quantum information theory. Here we introduce a systematic approach that enables us to construct exactly those extreme channels that are covariant with respect to a finite discrete group or a compact connected Lie group. Innovative labeling of quantum channels by group representations enables us to identify the subset of group-covariant channels whose elements are group-covariant generalized-extreme channels. Furthermore, we exploi…
Compatibility conditions of quantum channels featuring symmetry through covariance are studied. Compatibility here means the possibility of obtaining two or more channels through partial trace out of a broadcasting channel. We see that covariance conditions can be used to simplify compatibility conditions as the broadcasting channel can be assumed to be covariant in a particular way. A particular emphasis is on Weyl covariance and in determining compatibility conditions for Weyl-covariant channels. The concrete examples studied include the case of a non-compact continuous phase space and the c…
Additivity of minimal entropy output is proven for the class of quantum channels $Λ_t (A):=t A^{T}+(1-t)τ(A)$ in the parameter range $-2/(d^2-2)\le t \le 1/(d+1)$.
We investigate the Weyl channels being covariant with respect to the maximum commutative group of unitary operators. This class includes the quantum depolarizing channel and the "two-Pauli" channel as well. Then, we show that our estimation of the output entropy for a tensor product of the phase damping channel and the identity channel based upon the decreasing property of the relative entropy allows to prove the additivity conjecture for the minimal output entropy for the quantum depolarizing channel in any prime dimesnsion and for the "two Pauli" channel in the qubit case.
We study the performance of the super dense coding protocol in the presence of quantum channels with covariant noise. We first consider the bipartite case and review in a unified way the case of general Pauli channels. We discuss both the cases of unitary and non-unitary encoding. We also study the multipartite scenario and investigate the case of many senders and one receiver.
We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with $U^c$ being the contragradient representation). Using the theory of group representations, we obtain the spectral decomposition of any such linear map. The eigenvalues and orthogonal projections arising in this decomposition are expressed entirely in terms of representation characteristics of the group $G$. This in turn yields necessary and sufficient conditions…
The quantum speed of evolution for the phase covariant map is investigated. This involves absorption, emission and dephasing processes. We consider the maps under various combinations of the above processes to investigate the effect of phase covariant maps on quantum speed limit time. For absorption-free phase covariant maps, combinations of dissipative and CP-(in)divisible (non)-Markovian dephasing noises are considered. The role of coherence-mixedness balance on the speed limit time is checked in the presence of both vacuum and finite temperature effects. We also investigate the rate at whic…
We study the limitations of deterministic programmability of quantum circuits, e.g., quantum computer. More precisely, we analyse the programming of quantum observables and channels via quantum multimeters. We show that the programming vectors for any two different sharp observables are necessarily orthogonal, whenever post-processing is not allowed. This result then directly implies that also any two different unitary channels require orthogonal programming vectors. This approach generalizes the well-known orthogonality result first proven by Nielsen and Chuang. In addition, we give size-boun…
The additivity of the minimal output entropy and that of the $χ$-capacity are known to be equivalent for finite-dimensional irreducibly covariant channels. In this paper we formulate a list of conditions allowing to establish similar equivalence for infinite-dimensional covariant channels with constrained input. This is then applied to Bosonic Gaussian channels with quadratic input constraint to extend the classical capacity results of the recent paper \cite{ghg} to the case where the complex structures associated with the channel and with the constraint operator need not commute. In particula…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the "quantum switch", which can be programmed to switch the order of two channels with a single use of each one.
A direct proof of the relation between the one-shot classical capacity and the minimal output entropy for covariant quantum channels is suggested. The structure of covariant channels is described in some detail. A simple proof of a general inequality for entanglement-assisted classical capacity is given.
Institute of Physics, Faculty of Physics, Astronomy and Informatics, Nicolaus Copernicus University（尼古拉·哥白尼大学物理、天文与信息学院物理研究所）；Tata Institute of Fundamental Research Hyderabad（塔塔基础研究所海得拉巴分所）；Institute for Quantum Studies, Chapman University（查普曼大学量子研究学院）；Department of Computer Science, Texas Tech University（德克萨斯理工大学计算机科学系）
We review some partial results for two strictly related problems. The first problem consists in finding the optimal joint unitary transformation on system and ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. In this respect we present a solution for dimension two for both system and ancilla. The second problem consists in finding the optimal universal programmable detector, namely a device that can be tuned to perform any desired measurement on a given quantum system, by changing the state of an ancilla. With a finite di…
Every completely positive map G that commutes which the Hamiltonian time evolution is an integral or sum over (densely defined) CP-maps G_σwhere σis the energy that is transferred to or taken from the environment. If the spectrum is non-degenerated each G_σis a dephasing channel followed by an energy shift. The dephasing is given by the Hadamard product of the density operator with a (formally defined) positive operator. The Kraus operator of the energy shift is a partial isometry which defines a translation on R with respect to a non-translation-invariant measure. As an example, I calculate t…
A generalization of the Choi-Jamiolkowski isomorphism for completely positive maps between operator algebras is introduced. Particular emphasis is placed on the case of normal unital completely positive maps defined between von Neumann algebras. This generalization is applied especially to the study of maps which are covariant under actions of a symmetry group. We highlight with the example of, e.g., phase-shift-covariant quantum channels the ease of this method in particular in the case of a compact symmetry group. We also discuss the case of channels which are covariant under actions of the …
The imposition of symmetry upon the nature and structure of quantum observables has recently been extensively studied, with quantum reference frames playing a crucial role. In this paper, we extend this work to quantum transformations, giving quantitative results showing, in direct analogy to the case of observables, that a "large" reference frame is required for non-covariant channels to be well approximated by covariant ones. We apply our findings to the concrete setting of SU(2) symmetry.
We study multipartite super dense coding in the presence of a covariant noisy channel. We investigate the case of many senders and one receiver, considering both unitary and non-unitary encoding. We study the scenarios where the senders apply local encoding or global encoding. We show that, up to some pre-processing on the original state, the senders cannot do better encoding than local, unitary encoding. We then introduce general Pauli channels as a significant example of covariant maps. Considering Pauli channels, we provide examples for which the super dense coding capacity is explicitly de…
We investigate information theoretic properties of low rank (less than or equal to 3) quantum channels with $SU(2)$-symmetry, where we have a complete description. We prove that PPT property coincides with entanglement-breaking property and that degradability seldomly holds in this class. In connection with these results we will demonstrate how we can compute Holevo and coherent information of those channels. In particular, we exhibit a strong form of additivity violation of coherent information, which resembles the superactivation of coherent information of depolarizing channels.
We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing the set of input-output correlations compatible with any arbitrary given quantum channel. For binary (i.e., two input symbols, two output symbols) correlations, we show that extremal correlations are always achieved by orthogonal encodings and measurements, irrespective of whether or not the channel preserves commutativity. We further provide a full, closed-fo…
We introduce positive operator-valued measure (POVM) generated by the projective unitary representation of a direct product of locally compact Abelian group $G$ with its dual $\hat G$. The method is based upon the Pontryagin duality allowing to establish an isometrical isomorphism between the space of Hilbert-Schmidt operators in $L^2(G)$ and the Hilbert space $L^2(\hat G\times G)$. Any such a measure determines a pair of hybrid (containing classical and quantum parts) quantum channels consisting of the measurement channel and the channel transmitting an initial quantum state to the ensemble o…
We characterize the operational capabilities of quantum channels which can neither create nor detect quantum coherence vis-à-vis efficiently manipulating coherence as a resource. We study the class of dephasing-covariant operations (DIO), unable to detect the coherence of any input state, as well as introduce an operationally-motivated class of channels $ρ$-DIO which is tailored to a specific input state. We first show that pure-state transformations under DIO are completely governed by majorization, establishing necessary and sufficient conditions for such transformations and adding to the li…
In this paper, we prove that it is impossible to construct a convariant quantum feedback control instruments which aim to correct the channel noise imposed on an unknown qubit. The proof is based on the searching for the optimal quantum control protocol and it turns out there exist no better %\textit{Complete Positive Trace %Preserving}(CPTP) maps complete positive and covariant quantum operations which provide a higher fidelity than the trivial Identity operators. The generalization of the investigation to bipartite entangled pure state is also included.
We review Wehrl's definition of a semiclassical entropy in terms of coherent states and give an introductory overview of Lieb's conjecture, its proof (including earlier results), generalizations, and the role of covariant quantum channels in this context. These structures motivate an alternative definition of coherent states and have interesting physical applications and implications.
Software-defined networking offers a device-agnostic programmable framework to encode new network functions. Externally centralized control plane intelligence allows programmers to write network applications and to build functional network designs. OpenFlow is a key protocol widely adopted to build programmable networks because of its programmability, flexibility and ability to interconnect heterogeneous network devices. We simulate the functional topology of a multi-node quantum network that uses programmable network principles to manage quantum metadata for protocols such as teleportation, s…
Recently, the Gaussian optimizer conjecture in quantum information theory was confirmed for bosonic Gaussian gauge-covariant or contravariant channels. These results use the i.i.d. model of the quantum noise. In this paper we consider quantum Gaussian signal+noise model with time-continuous stationary coloured noise. A proof of the coding theorem for the classical capacity of quantum broadband gauge-covariant Gaussian channels is given. We also discuss and compare the "broadband" and the "bandpass" models of time-continuous time-continuous stationary coloured noise.
In this paper we will demonstrate that any compact quantum group can be used as symmetry groups for quantum channels, which leads us to the concept of covariant channels. We, then, unearth the structure of the convex set of covariant channels by identifying all extreme points under the assumption of multiplicity-free condition for the associated fusion rule, which provides a wide generalization of some recent results. The presence of quantum group symmetry contrast to the group symmetry will be highlighted in the examples of quantum permutation groups and $SU_q(2)$. In the latter example, we w…
Reciprocal pairs of quantum channels are defined as completely positive transformations which admit a rigid, distance-preserving, yet not completely-positive transformation that allows to reproduce the outcome of one from the corresponding outcome of the other. From a classical perspective these transmission lines should exhibit the same communication efficiency. This is no longer the case in the quantum setting: explicit asymmetric behaviours are reported studying the classical communication capacities of reciprocal pairs of depolarizing and Weyl-covariant channels.
In this work we design a specific simulation tool for quantum channels which is based on the use of a control system. This allows us to simulate an average quantum channel which is expressed in terms of an ensemble of channels, even when these channel-components are not jointly teleportation-covariant. This design is also extended to asymptotic simulations, continuous ensembles, and memory channels. As an application, we derive relative-entropy-of-entanglement upper bounds for private communication over various channels, including non-Gaussian mixtures of bosonic lossy channels. Among other re…
From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels
School of Data Science, The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳）数据科学学院）；International Quantum Academy（国际量子学院）；Graduate School of Mathematics, Nagoya University（名古屋大学大学院数学研究科）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；Perimeter Institute for Theoretical Physics（理论物理珀米特研究所）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）
We address the problem of optimally approximating the action of a desired and unavailable quantum channel $Φ$ having at our disposal a single use of a given set of other channels $\{Ψ_i \}$. The problem is recast to look for the least distinguishable channel from $Φ$ among the convex set $\sum_i p_i Ψ_i$, and the corresponding optimal weights $\{ p_i \}$ provide the optimal convex mixing of the available channels $\{Ψ_i \}$. For single-qubit channels we study specifically the cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map…
Effective dynamics of qubit networks via phase-covariant quantum ensembles
Institute of Gravitation and the Cosmos, The Pennsylvania State University（宾夕法尼亚州立大学引力与宇宙学研究所）；Department of Physics, The Pennsylvania State University（宾夕法尼亚州立大学物理系）
We find optimality conditions for testers in discrimination of quantum channels. These conditions are obtained using semidefinite programming and are similar to optimality conditions for POVMs obtained by Holevo for ensembles of quantum states. We get a simple condition for existence of an optimal tester with any given input state with maximal Schmidt rank, in particular with a maximally entangled input state and we show the pitfalls of using input states with not maximal Schmidt rank. In case when maximally entangled state is not the optimal input state an error estimate is obtained. The resu…
Statistical estimation and test of unknown channels have attracted interest of many researchers. In optimizing the process of inference, an important step is optimization of the input state, which in general do depend on the kind of inference (estimation or test, etc.), on the error measure, and so on. But sometimes, there is a universally optimal input state, or an input state best for all the statistical inferences and for all the risk functions. In the paper, the existence of a universally optimal state is shown for group covariant/contravariant channels, unital qubit channels and some meas…
Passive light-source side channel in quantum key distribution (QKD) makes the quantum signals more distinguishable thus provides additional information about the quantum signal to an eavesdropper. The explicit eavesdropping strategies aimed at the passive side channel known to date were limited to the separate measurement of the passive side channel in addition to the operational degree of freedom. Here we show how to account for the joint eavesdropping on both operational degree of freedom and the passive side channel of the generic form. In particular, we use the optimal phase-covariant clon…
We address quantum communication channels based on phase modulation of coherent states and analyze in details the effects of static and dynamical (stochastic) phase diffusion. We evaluate mutual information for an ideal phase receiver and for a covariant phase-space-based receiver, and compare their performances by varying the number of symbols in the alphabet and/or the overall energy of the channel. Our results show that phase communication channels are generally robust against phase noise, especially for large alphabets in the low energy regime. In the presence of dynamical (non-Markovian) …
We address the general problem of removing correlations from quantum states while preserving local quantum information as much as possible. We provide a complete solution in the case of two qubits, by evaluating the minimum amount of noise that is necessary to decorrelate covariant sets of bipartite states. We show that two harmonic oscillators in arbitrary Gaussian state can be decorrelated by a Gaussian covariant map. Finally, for finite-dimensional Hilbert spaces, we prove that states obtained from most cloning channels (e.g., universal and phase-covariant cloning) can be decorrelated only …
We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels the norm of the output is maximized for the output being a normalized projection. We prove the additivity of the minimal output Renyi entropies with entropic parameters contained in [0, 2], generalizing an argument by Alicki and Fannes, and present a number of examples in detail. In order to relate these results to the classical information capacity, we introduce a weak form of covariance of a channel. We then identify several instances of w…
The class of quantum states known as Werner states have several interesting properties, which often serve to illuminate unusual properties of quantum information. Closely related to these states are the Holevo-Werner channels whose Choi matrices are Werner states. Exploiting the fact that these channels are teleportation covariant, and therefore simulable by teleportation, we compute the ultimate precision in the adaptive estimation of their channel-defining parameter. Similarly, we bound the minimum error probability affecting the adaptive discrimination of any two of these channels. In this …
