Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum channel. Error correction and unambiguous error correction with nonzero probability are discussed in terms of unambiguous unitary quantum channels. We not only re-derive the well-known condition for a set of errors to be correctable with certainty, but also obtain a necessary and sufficient condition for the errors caused by a noisy channel to be correctable with any nonzero probability. Dense coding with a partially entangled state can also be viewed as an unambiguous unitary quantum channel when all messages are required to be transmitted with equal probability of success, the maximal achievable probability of success is derived and the optimum protocol is also obtained.
We address the problem of unambiguous comparison of a pair of unknown qudit unitary channels. Using the framework of process positive operator valued measures (PPOVM) we characterize all solutions and identify the optimal ones. We prove that the entanglement is the key ingredient in designing the optimal experiment for comparison of unitary channels. Without entanglement the optimality can not be achieved. The proposed scheme is also experimentally feasible.
We address the problem of unambiguous discrimination among oracle operators. The general theory of unambiguous discrimination among unitary operators is extended with this application in mind. We prove that entanglement with an ancilla cannot assist any discrimination strategy for commuting unitary operators. We also obtain a simple, practical test for the unambiguous distinguishability of an arbitrary set of unitary operators on a given system. Using this result, we prove that the unambiguous distinguishability criterion is the same for both standard and minimal oracle operators. We then show…
We formulate minimum-error and unambiguous discrimination problems for quantum processes in the language of process positive operator valued measures (PPOVM). In this framework we present the known solution for minimum-error discrimination of unitary channels. We derive a "fidelity-like" lower bound on the failure probability of the unambiguous discrimination of arbitrary quantum processes. This bound is saturated (in a certain range of apriori probabilities) in the case of unambiguous discrimination of unitary channels. Surprisingly, the optimal solution for both tasks is based on the optimiz…
We investigate a discrimination scheme between unitary processes. By introducing a margin for the probability of erroneous guess, this scheme interpolates the two standard discrimination schemes: minimum-error and unambiguous discrimination. We present solutions for two cases. One is the case of two unitary processes with general prior probabilities. The other is the case with a group symmetry: the processes comprise a projective representation of a finite group. In the latter case, we found that unambiguous discrimination is a kind of "all or nothing": the maximum success probability is eithe…
Quantum hypothesis testing is an important tool for quantum information processing. Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained. In both scenarios, the testing between quantum states are relatively well-understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channe…
We study how to unambiguously identify a given quantum pure state with one of the two reference pure states when no classical knowledge on the reference states is given but a certain number of copies of each reference quantum state are presented. By the unambiguous identification, we mean that we are not allowed to make a mistake but our measurement can produce an inconclusive result. Assuming the two reference states are independently distributed over the whole pure state space in a unitary invariant way, we determine the optimal mean success probability for an arbitrary number of copies of t…
In the theory of quantum information, the mixed-unitary quantum channels, for any positive integer dimension $n$, are those linear maps that can be expressed as a convex combination of conjugations by $n\times n$ complex unitary matrices. We consider the mixed-unitary rank of any such channel, which is the minimum number of distinct unitary conjugations required for an expression of this form. We identify several new relationships between the mixed-unitary rank~$N$ and the Choi rank~$r$ of mixed-unitary channels, the Choi rank being equal to the minimum number of nonzero terms required for a K…
For a positive integer $d$ and a unitary representation $ρ:G\rightarrow\mathrm{U}(d)$ of a compact group $G$, the twirling channel for this representation is the linear mapping $Φ: M_d\rightarrow M_d$ defined as $Φ(X)=\int_{G}\mathrm{d}μ(g)\,ρ(g)Xρ(g^{-1})$ for every $X\in M_d$, where $μ$ is the Haar measure on $G$. Such channels are examples of mixed-unitary channels, as they are in the convex hull of the set of unitary channels of a fixed size. By Carathéodory's theorem, these channels can always be expressed as a finite linear combination of unitary channels. We consider the mixed-unitary r…
We consider unitary conjugation channels with continuous random phases. The spectral properties of the channel average are examined, thereby the asymptotic behaviors of the repeated quantum interactions of the motion are derived. We then study the channels with uniformly distributed continuous phases on an interval. In this context, it is shown that discrete phases are sufficient to achieve the channel average.
The coherence-breaking channels play a significant role in quantum information theory. We study the coherence-breaking channels and give a method to amend the coherence-breaking channels by applying unitary operations. For given incoherent channel $Φ$, we give necessary and sufficient conditions for the channel to be a coherence-breaking channel and amend it via unitary operations. For qubit incoherent channels $Φ$ that are not coherence-breaking ones, we consider the mapping $Φ\circΦ$ and present the conditions for coherence-breaking and channel amendment as well.
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output $p$-norm can be equivalently restated in terms of random unitary channels. This is done by constructing a random unitary approximation to a general quantum channel. This approximation can be constructed efficiently, and so it is also applied to the computational problem of distinguishing quantum circuits. It is shown that the problem of distinguishing random unitary circuits is …
For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are also advantageous for this task. However, for the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal, even when compared to general strategies. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of u…
We address the question of existence of private quantum channel for qubits encoded in polarization degrees of freedom of a photon, that remains secure even if multi-photon (instead of single-photon) pulse is emitted. We show that random unitary channel distributed according to SU(2) Haar measure has this property. Further we analyze the qubit unitary k-designs. We show they ensure security if the photons' parity of the source is guaranteed. Otherwise, the qubit unitary k-designs do not guarantee perfect security.
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We show that the optimal measurement can be computed very efficiently in polynomial time by exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed…
We show that two qubits, initially in a fully classical state, can develop significant quantum correlations as measured by the quantum discord (QD) under the action of a local memoryless noise (specifically we consider the case of a Markovian amplitude-damping channel). This is analytically proven after deriving in a compact form the QD for the class of separable states involved in such a process. We provide a picture in the Bloch sphere that unambiguously highlights the physical mechanism behind the effect regardless of the specific measure of QCs adopted.
By preparing an input state and measuring an observable for the output state, we can measure a quantum channel. Following the formulation given by Xiao et al., we study an uncertainty relation for ancilla-free measurements of random unitary channels acting on a qubit. We obtain an explicit formula and give a necessary and sufficient condition for this formula to be nontrivial.
We study the number of measurements required for quantum process tomography under prior information, such as a promise that the unknown channel is unitary. We introduce the notion of an interactive observable and we show that any unitary channel acting on a $d$-level quantum system can be uniquely identified among all other channels (unitary or otherwise) with only $O(d^2)$ interactive observables, as opposed to the $O(d^4)$ required for tomography of arbitrary channels. This result generalizes, so that channels with at most $q$ Kraus operators can be identified with only $O(qd^2)$ interactive…
We investigate the simultaneous estimation of $n$ not necessarily identical unitary channels using multi-partite entanglement. We examine whether it is possible for the rate at which the mean square error decreases to be greater than that using the channels individually. For a reasonably general situation, in which there is no functional dependence between the channels, we show that this is not possible. We look at a case in which the channels are not necessarily identical but depend on a common variable. In this case, the mean square error decreases more rapidly using multi-partite entangleme…
In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the discrimination among finite number of alternatives as the discrimination among finite number of average constituents. Using this framework I solve several unambiguous tasks. I present a solution to optimal unambiguous comparison of two ensembles of unknown quantum states. I consider two cases: 1) The two unknown states are arbitrary pure states of qudits. 2) Alternati…
We show that a quantum channel $\mathcal{N}$ constructed by averaging over $\mathcal{O}(\log d/ε^2)$ randomly chosen unitaries gives a local $ε$-randomizing map with non-negative probability. The idea comes from a small $ε$-net construction on the higher dimensional unit sphere or quantum pure states. By exploiting the net, we analyze the concentrative phenomenon of an output reduced density matrix of the channel, and this analysis imply that there exists a local random unitary channel, with relatively small unitaries, generically.
In this paper, we consider the generalized measurement where one particular quantum signal is unambiguously extracted from a set of non-commutative quantum signals and the other signals are filtered out. Simple expressions for the maximum detection probability and its POVM are derived. We applyl such unambiguous quantum state filtering to evaluation of the sensing of decoherence channels. The bounds of the precision limit for a given quantum state of probes and possible device implementations are discussed.
A bipartite state which is secretly chosen from a finite set of known entangled pure states cannot be immediately useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown state, we introduce a new way to locally manipulate the original quantum system: either identify the state successfully or distill some pure entanglement. Remarkably, if many copies are available, we show that any finite set of entangled pure states, whatever orthogonal or not, can be locally distinguished in this way, which further implies that pure entang…
We address the problem of finding the optimal joint unitary transformation on system + ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. We present a solution to the problem for dim(H)=2 for both system and ancilla.
We investigate robustness of probabilistic storage and retrieval device optimized for phase gates to noise. We use noisy input composed of convex combination of unitary channel with either depolarizing or dephasing channel. We find out that the resistance to dephasing noise is higher than to depolarization. Interestingly, for the depolarisation the retrieval reduces the degree of noise. We also examine the possible realizations showing that their performance is different when the noise is present.
The problem of unambiguously distinguishing among nonorthogonal but linearly independent quantum states can be solved by mapping the set of nonorthogonal quantum states onto a set of orthogonal ones, which can then be distinguished without error. Such nonunitary transformations can be performed conditionally on quantum systems; a unitary transformation is carried out on a larger system of which the system of interest is a subsytem, a measurement is performed, and if the proper result is obtained, the desired nonunitary transformation will have been performed on the subsystem. We show how to co…
We show that there exist Gaussian channels which are amendable. A channel is amendable if when applied twice is entanglement breaking while there exists a unitary filter such that, when interposed between the first and second action of the map, prevents the global transformation from being entanglement breaking [Phys. Rev. A 86, 052302 (2012)]. We find that, depending on the structure of the channel, the unitary filter can be a squeezing transformation or a phase shift operation. We also propose two realistic quantum optics experiments where the amendability of Gaussian channels can be verifie…
We prove that if any error channel has a Kraus decomposition that is simultaneously correctable and Hilbert-Schmidt (HS) complete, then the existence of Kraus sets with these properties guarantees the correctability of all quantum channels. As a proof of the existence of such Kraus sets, the $n$-level depolarization channel is shown to have a random-unitary (RU) decomposition that is both HS complete and correctable due its RU nature, thereby proving that all quantum channels are correctable. As an application, conditions for universal error-correction operations are presented.
We study efficient quantum certification algorithms for quantum state set and unitary quantum channel. We present an algorithm that uses $O(\varepsilon^{-4}\ln |\mathcal{P}|)$ copies of an unknown state to distinguish whether the unknown state is contained in or $\varepsilon$-far from a finite set $\mathcal{P}$ of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. Previous study showed that one can distinguish whether an unknown unitary $U$ is equal to or $\varepsilon$-far from a known or unknown unitary $V$ in fixed dimension with $O(\va…
We study the super dense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and non-unitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The super dense coding capacity for some special channels and resource states is derived for unitary encoding. We also provide an example of a memory channel where non-unitary encoding leads to an improvement in the super dense coding capacity.
We report a bulk optics experiment demonstrating the possibility of restoring the entanglement distribution through noisy quantum channels by inserting a suitable unitary operation (filter) in the middle of the transmission process. We focus on two relevant classes of single-qubit channels consisting in repeated applications of rotated phase damping or rotated amplitude damping maps, both modeling the combined Hamiltonian and dissipative dynamics of the polarization state of single photons. Our results show that interposing a unitary filter between two noisy channels can significantly improve …
We investigate the effect of different types of non-unitary quantum channels on multi-qubit quantum systems. For an $n$-qubit system and a particular channel, in order to draw unbiased conclusions about the system as a whole as opposed to specific states, we evolve a large number of randomly generated states under the given channel. We increase the number of qubits and study the effect of system size on the decoherence processes. The entire scheme is repeated for various types of environments which include dephasing channel, depolarising channel, collective dephasing channel and zero temperatu…
Characterizing quantum channels from local-unitary invariants
Institute for Quantum Inspired and Quantum Optimization, Hamburg University of Technology（汉堡工业大学量子启发与量子优化研究所）；University of Tsukuba（筑波大学）；Center for Artificial Intelligence Research (C-AIR), University of Tsukuba（筑波大学人工智能研究中心）
Stochastic channels are ubiquitous in the field of quantum information because they are simple and easy to analyze. In particular, Pauli channels and depolarizing channels are widely studied because they can be efficiently simulated in many relevant quantum circuits. Despite their wide use, the properties of general stochastic channels have received little attention. In this paper, we prove that the diamond distance of a general stochastic channel from the identity coincides with its process infidelity to the identity. We demonstrate with an explicit example that there exist multi-qubit stocha…
We address the question of a quantum memory storage of quantum dynamics. In particular, we design an optimal protocol for $N\to 1$ probabilistic storage-and-retrieval of unitary channels on $d$-dimensional quantum systems. If we may access the unknown unitary gate only $N$-times, the optimal success probability of perfect retrieval of its single use is $N/(N-1+d^2)$. The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perf…
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure between a given CPT map and the set of random unitary maps, and methods for calculating it. In this way one could determine whether non-classical error mechanisms such as spontaneous decay or photon loss dominate over classical uncertainties, for example in a phase parameter. The present paper is a step towards achieving this goal.
We address the problem of quantum reading of optical memories, namely the retrieving of classical information stored in the optical properties of a media with minimum energy. We present optimal strategies for ambiguous and unambiguous quantum reading of unitary optical memories, namely when one's task is to minimize the probability of errors in the retrieved information and when perfect retrieving of information is achieved probabilistically, respectively. A comparison of the optimal strategy with coherent probes and homodyne detection shows that the former saves orders of magnitude of energy …
We address the question of finding the most effective convex decompositions into boundary elements (so-called boundariness) for sets of quantum states, observables and channels. First we show that in general convex sets the boundariness essentially coincides with the question of the most distinguishable element, thus, providing an operational meaning for this concept. Unexpectedly, we discovered that for any interior point of the set of channels the optimal decomposition necessarily contains a unitary channel. In other words, for any given channel the best distinguishable one is some unitary c…
We show that weighted unitary 2-designs define optimal measurements on the system-ancilla output state for ancilla-assisted process tomography of unital quantum channels. Examples include complete sets of mutually unbiased unitary-operator bases. Each of these specifies a minimal series of optimal orthogonal measurements. General quantum channels are also considered.
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. As a consequence, we find that the collection of channels expressible as convex combinations of unitary channels has non-zero Borel measure within the space of doubly stochastic channels.
We construct a practical method for finding optimal Gaussian probe states for the estimation of parameters encoded by Gaussian unitary channels. This method can be used for finding all optimal probe states, rather than focusing on the performance of specific states as shown in previous studies. As an example, we apply this method to find optimal probes for the channel that combines the phase-change and squeezing channels, and for generalized two-mode squeezing and mode-mixing channels. The method enables a comprehensive study of temperature effects in Gaussian parameter estimation. It has been…
We study the ability of a quantum channel to generate quantum coherence when it applies to incoherent states. We define the measure of coherence generating power (CGP) for a generic quantum channel to be the average coherence generated by the quantum channel acting on a uniform ensemble of incoherent states based on the skew information-based coherence measure. We present explicitly the analytical formulae of the CGP for any arbitrary finite dimensional unitary channels. We derive the mean value of the CGP over the unitary groups and investigate the typicality of the normalized CGP. Furthermor…
A quantum channel is said to be a mixed-unitary channel if it can be expressed as a convex combination of unitary channels. We prove that, given the Choi representation of a quantum channel, it is NP-hard with respect to polynomial-time Turing reductions to determine whether or not that channel is a mixed-unitary channel. This hardness result holds even under the assumption that the channel is not within an inverse-polynomial distance (in the dimension of the space upon which it acts) of the boundary of the mixed-unitary channels.
Discrimination between unknown processes chosen from a finite set is experimentally shown to be possible even in the case of non-orthogonal processes. We demonstrate unambiguous deterministic quantum process discrimination (QPD) of non-orthogonal processes using properties of entanglement, additional known unitaries, or higher dimensional systems. Single qubit measurement and unitary processes and multipartite unitaries (where the unitary acts non-separably across two distant locations) acting on photons are discriminated with a confidence of $\geq97%$ in all cases.
