We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations.
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they…
In this article we show that, in a two-arm interferometer, pure quantum states of perfect path distinguishability (particles) are geometrically equidistant from all states with constant path distinguishability D. This property is not shared by other states, such as perfect fringe-visibility (waves) or maximally entangled quantum states (entanglon). Indeed, the Bures distance between a particle and any other state depends only the distinguishability of the latter. On the contrary, the Bures distance between a wave or an entanglon, and any other single photon state depends on other set of parame…
We find that the perfect distinguishability of two quantum operations by a parallel scheme depends only on an operator subspace generated from their Choi-Kraus operators. We further show that any operator subspace can be obtained from two quantum operations in such a way. This connection enables us to study the parallel distinguishability of operator subspaces directly without explicitly referring to the underlining quantum operations. We obtain a necessary and sufficient condition for the parallel distinguishability of an operator subspace that is either one-dimensional or Hermitian. In both …
Let $s_1,s_2,\ldots s_n$ be states of a general probability theory, and $\mathcal A$ be the set of all subsets of indices $H \subset [n]\equiv\{1,2,\ldots n\}$ such that the states $(s_j)_{j\in H}$ are jointly perfectly distinguishable. All subsets with a single element are of course in $\mathcal A$, and since smaller collections are easier to distinguish, if $H\in \mathcal A$ and $L \subset H$ then $L\in \mathcal A$; in other words, $\mathcal A$ is a so-called $\textit{independence system}$ on the set of indices $[n]$. In this paper it is shown that every independence system on $[n]$ can be r…
In the topic of perfect local distinguishability of orthogonal multipartite quantum states, most results obtained so far pertain to bipartite systems whose subsystems are of specific dimensions. In contrast very few results for bipartite systems whose subsystems are of arbitrary dimensions, are known. This is because a rich variety of (algebraic or geometric) structure is exhibited by different sets of orthogonal states owing to which it is difficult to associate some common property underlying them all, i.e., a common property that would play a crucial role in the local distinguishability of …
Distinguishing physical processes is one of the fundamental problems in quantum physics. Although distinguishability of quantum preparations and quantum channels have been studied considerably, distinguishability of quantum measurements remains largely unexplored. We investigate the problem of single-shot discrimination of quantum measurements using two strategies, one based on single quantum systems and the other one based on entangled quantum systems. First, we formally define both scenarios. We then construct sets of measurements (including non-projective) in arbitrary finite dimensions tha…
Local distinguishability of six bipartite orthogonal product states
College of Computer Science and Engineering, Shandong University of Science and Technology（山东科技大学计算机科学与工程学院）；College of Cyberspace Science and Technology, Beijing University of Technology（北京工业大学网络空间技术学院）；College of Mathematics and Systems Science, Shandong University of Science and Technology（山东科技大学数学与系统科学学院）
Local distinguishability of five orthogonal product states on bipartite and tripartite quantum systems
College of Computer Science and Engineering, Shandong University of Science and Technology（山东科技大学计算机科学与工程学院）；Faculty of Information Technology, Beijing University of Technology（北京工业大学信息学部）；College of Mathematics and Systems Science, Shandong University of Science and Technology（山东科技大学数学与系统科学学院）
We investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between $M$ quantum states that become identical under a completely decohering map. Similarly, we study distinguishability of $M$ quantum channels that cannot be distinguished when one is restricted to decohered input and output states. The studied problems arise naturally in the presence of a superselection rule, allow one to quantify the amount of information that can be encoded in phase degrees of freedom (coherences), and are related to time-energy uncertainty relation. We p…
Monolithic Quantum Error Correction in the Presence of Distinguishability
Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（量子信息与计算机科学联合中心，美国国家标准与技术研究院/马里兰大学）；Center for Quantum Science and Engineering, Department of Physics & Astronomy, University of California Los Angeles（加州大学洛杉矶分校物理与天文学系量子科学与工程中心）；Department of Physics & Astronomy, University of California Los Angeles（加州大学洛杉矶分校物理与天文学系）；Joint Quantum Institute, NIST/University of Maryland（美国国家标准与技术研究院/马里兰大学联合量子研究所）
The are substantial studies on distinguishabilities, especially local distinguishability, of quantum states. It is shown that a necessary condition of a local distinguishable state set is the total Schmidt rank not larger than the system dimension. However, if we view states in a larger system, the restriction will be invalid. Hence, a nature problem is that can indistinguishable states become distinguishable by viewing them in a larger system without employing extra resources. In this paper, we consider this problem for (perfect or unambiguous) LOCC$_{1}$, PPT and SEP distinguishabilities. We…
Suppose a set of $m$-partite, $m\geq3$, pure orthogonal fully separable states is given. We consider the task of distinguishing these states perfectly by local operations and classical communication (LOCC) in different $k$-partitions, $1<k<m$. Based on this task, it is possible to classify the sets of product states into different classes. For tripartite systems, a classification of the sets with explicit examples is presented. Few important cases related to the aforesaid task are also studied when the number of parties, $m\geq4$. These cases never appear for a tripartite system. However, to d…
We study discrimination of m quantum measurements in the scenario when the unknown measurement with n outcomes can be used only once. We show that ancilla-assisted discrimination procedures provide a nontrivial advantage over simple (ancilla-free) schemes for perfect distinguishability and we prove that inevitably m <= n. We derive necessary and sufficient conditions of perfect distinguishability of general binary measurements. We show that the optimization of the discrimination of projective qubit measurements and their mixtures with white noise is equivalent to the discrimination of specific…
The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measuring complementary physical quantities by a single measurement, we demonstrate that the distinguishability can be perfectly retrieved simply with the help of posterior classical partial information. We demonstrate this by showing an ensemble of non-orthogonal pure states such that a state randomly sampled from the ensemble can be perfectly identified by a single measurement with help of the post-processing of the measur…
Contextual advantage implies limited distinguishability in any physical theory
Perimeter Institute for Theoretical Physics（Perimeter理论物理研究所）；University of Gdańsk（格但斯克大学）；University of São Paulo（圣保罗大学）；Polish Academy of Sciences（波兰科学院）
We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of entanglement required to accomplish the task perfectly for sets of orthogonal states and argue that it quantifies information nonlocality.
Quantum error correction and symmetries play central roles in quantum information science and physics. It is known that quantum error-correcting codes covariant with respect to continuous symmetries cannot correct erasure errors perfectly (an important case being the Eastin-Knill theorem), in contrast to the case without symmetry constraints. Furthermore, there are fundamental limits on the accuracy of such covariant codes for approximate quantum error correction. Here, we consider the quantum error correction capability of random covariant codes. In particular, we show that $U(1)$-covariant c…
Non-classical interference of photons lies at the heart of optical quantum information processing. This effect is exploited in universal quantum gates as well as in purpose-built quantum computers that solve the BosonSampling problem. Although non-classical interference is often associated with perfectly indistinguishable photons this only represents the degenerate case, hard to achieve under realistic experimental conditions. Here we exploit tunable distinguishability to reveal the full spectrum of multi-photon non-classical interference. This we investigate in theory and experiment by contro…
Decoherence is the fundamental obstacle limiting the performance of quantum information processing devices. The problem of transmitting a quantum state (known or unknown) from one place to another is of great interest in this context. In this work, by following the recent theoretical proposal [Opt. Eng. {\bf 59}, 061625 (2020)] we study an application of quantum state-dependent pre- and post-processing unitary operations for protecting the given (multi-qubit) quantum state against the effect of decoherence acting on all qubits. We observe the increase in the fidelity of the output quantum stat…
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary operators that can create the maximum average entanglement when acting on product states have to satisfy additional constraints. These have been called "2-unitaries" and are examples of perfect tensors that can be used to construct absolutely maximally entangled states of four parties. Hitherto, no systematic method exists, in any local dimension, which resul…
For any pair of quantum states (the hypotheses), the task of binary quantum hypotheses testing is to derive the tradeoff relation between the probability $p_{01}$ of rejecting the null hypothesis and $p_{10}$ of accepting the alternative hypothesis. The case when both hypotheses are explicitly given was solved in the pioneering work by Helstrom. Here, instead, for any given null hypothesis as a pure state, we consider the worst-case alternative hypothesis that maximizes $p_{10}$ under a constraint on the distinguishability of such hypotheses. Additionally, we restrict the optimization to separ…
Quantum error correction and symmetries play central roles in quantum information science and physics. It is known that quantum error-correcting codes that obey (are covariant with respect to) continuous symmetries in a certain sense cannot correct erasure errors perfectly (a well-known result in this regard being the Eastin-Knill theorem in the context of fault-tolerant quantum computing), in contrast to the case without symmetry constraints. Furthermore, several quantitative fundamental limits on the accuracy of such covariant codes for approximate quantum error correction are known. Here, w…
We study the distinguishability norms associated to families of locally restricted POVMs on multipartite systems. These norms (introduced by Matthews, Wehner and Winter) quantify how quantum measurements, subject to locality constraints, perform in the task of discriminating two multipartite quantum states. We mainly address the following question regarding the behaviour of these distinguishability norms in the high-dimensional regime: On a bipartite space, what are the relative strengths of standard classes of locally restricted measurements? We show that the class of PPT measurements typical…
We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $k \leq d$ orthogonal maximally entangled states in $\mathbb{C}^{d}\otimes\mathbb{C}^{d}$ that are not perfectly distinguishable by LOCC. A recent result by Yu, Duan, and Ying [Phys. Rev. Lett. 109 020506 (2012) -- arXiv:1107.3224 [quant-ph]] gives an affirmative answer for the case $k = d$. We give, for the first time, a proof that such sets of states indeed exist even in the case $k < d$. Our result is constructive …
In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of achievable exponent pairs is characterized by the quantum Hoeffding bound theorem. A super-exponential decrease for both types of error probabilities is only possible in the trivial case when the two states are orthogonal, and hence can be perfectly distinguished using only a single copy of the system. In this paper we show that a qualitatively different behavio…
Here we demonstrate generating and storing entanglement in a solid state spin-wave quantum memory with on-demand read out using the process of rephased amplified spontaneous emission (RASE). Amplified spontaneous emission (ASE), resulting from an inverted ensemble of Pr$^{3+}$ ions doped into a Y$_2$SiO$_5$ crystal, generates entanglement between collective states of the praseodymium ensemble and the output light. The ensemble is then rephased using a four-level photon echo technique. Entanglement between the ASE and its echo is confirmed and the inseparability violation preserved when the RAS…
We conduct the first detailed analysis in quantum information of recently derived operator relations from the study of quantum one-way local operations and classical communications (LOCC). We show how operator structures such as operator systems, operator algebras, and Hilbert C*-modules all naturally arise in this setting, and we make use of these structures to derive new results and new derivations of some established results in the study of LOCC. We also show that perfect distinguishability under one-way LOCC and under arbitrary operations is equivalent for several families of operators tha…
We present a general approach to measurement-based quantum feedback that employs proportional and quantum state-based (PaQS) feedback components to obtain locally optimal protocols. To demonstrate the power of the method, we first show that it reproduces many known feedback protocols, and then apply it to generation of multipartite entanglement with an emphasis on remote entanglement, which requires spatially local feedback Hamiltonians. The symmetry of both measurement and feedback operators is found to be essential for construction of effective protocols. We show that under perfect measureme…
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be perfectly distinguished due to the non-orthogonality of the quantum states carrying them. So far, the decoding process has been approached in two ways: (i) The message is always inferred, but with an associated (minimum) error; (ii) the message is inferred without error, but only sometimes; in case of failure, nothing else is done. Here, we generalize on the…
ICFO – Institut de Ciències Fotòniques, The Barcelona Institute of Science and Technology（光子科学研究所，巴塞罗那科技研究院）；Dahlem Center for Complex Quantum Systems, Department of Physics, Freie Universität Berlin（达勒姆复杂量子系统中心，柏林自由大学物理系）
研究了在确定性情况下和不确定性情况下的最优密集编码，在确定性情况下，当协议成功时，使用Schmidt秩为$\bar D$的部分纠缠纯态和维数为$D$的无噪声量子信道（概率$τ_x$）Bob肯定知道Alice发送了消息$x$，并且当它失败时（概率$1-τ_x$）他知道它已经失败。Alice允许任何单次（一次性）编码过程，Bob允许任何单次测量。对于$\bar D\leq D$的约束是获得$L_d$的纠缠态的最大施密特系数方面，并与出版的结果比较由Mozes等人。对于$\bar D > D$它表明，$L_d$是严格小于$D^2$，除非$\bar D$是一个整数倍的$D$，在这种情况下，不需要均匀（最大）纠缠，以实现最佳的协议。明确的情况下，研究$\bar D \leq D$，假设$τ_x>0$的一组$\bar D D$消息，并得到一个界的平均$\lgl1/τ\rgl$。平均值$\lglτ\rgl$的界限需要通过对于不同消息正交的等距（当$\bar D=D$时为酉）进行编码的附加假设。当$τ_x$是一个独立于$x$的常数时，这两个边界都是饱和的，通过基于一次性纠缠浓度的协议。对于$\bar D > D$，示出了（至少）$D^2$消息可以被明确地发送。酉（等距）编码是否足以实现最佳协议仍然是一个主要的未回答的问题，无论是对于我们的工作还是对于以前使用部分纠缠态（包括噪声（混合）态）进行密集…
