Distinguishing quantum operations having few Kraus operators

2008 ◽  
Vol 8 (8&9) ◽  
pp. 819-833
Author(s):  
J. Watrous

Entanglement is sometimes helpful in distinguishing between quantum operations, as differences between quantum operations can become magnified when their inputs are entangled with auxiliary systems. Bounds on the dimension of the auxiliary system needed to optimally distinguish quantum operations are known in several situations. For instance, the dimension of the auxiliary space never needs to exceed the dimension of the input space of the operations for optimal distinguishability, while no auxiliary system whatsoever is needed to optimally distinguish unitary operations. Another bound, which follows from work of R. Timoney , is that optimal distinguishability is always possible when the dimension of the auxiliary system is twice the number of operators needed to express the difference between the quantum operations in Kraus form. This paper provides an alternate proof of this fact that is based on concepts and tools that are familiar to quantum information theorists.

2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.


2014 ◽  
Vol 556-562 ◽  
pp. 4293-4296 ◽  
Author(s):  
Lv Jun Li

We present a bound for estimating the minimum-error probability of ambiguous discrimination between any m quantum operations. There are only Kraus-operators and aprioriprobabilities of the discriminated quantum operations in this bound, and which has nothing to do with the input states. To a certain extent, we generalize the bound on the minimum-error probability for ambiguous discrimination from mixed states to quantum operations.


2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Jhih-Yuan Kao ◽  
Chung-Hsien Chou

Abstract Quantum operations are the fundamental transformations on quantum states. In this work, we study the relation between entangling capacities of operations, geometry of operations, and positive partial transpose (PPT) states, which are an important class of states in quantum information. We show a method to calculate bounds for entangling capacity, the amount of entanglement that can be produced by a quantum operation, in terms of negativity, a measure of entanglement. The bounds of entangling capacity are found to be associated with how non-PPT (PPT preserving) an operation is. A length that quantifies both entangling capacity/entanglement and PPT-ness of an operation or state can be defined, establishing a geometry characterized by PPT-ness. The distance derived from the length bounds the relative entangling capability, endowing the geometry with more physical significance. We also demonstrate the equivalence of PPT-ness and separability for unitary operations.


2015 ◽  
Vol 15 (15&16) ◽  
pp. 1355-1364
Author(s):  
Zhaofang Bai ◽  
Shuanping Du

The relative entropy measure quantifying coherence, a key property of quantum system, is proposed recently. In this note, we firstly investigate structural characterization of maximally coherent states with respect to the relative entropy measure. It is shown that mixed maximally coherent states do not exist and every pure maximally coherent state has the form U|ψihψ|U† , |ψi = √1 d Pd k=1 |ki, U is diagonal unitary. Based on the characterization of pure maximally coherent states, for a bipartite maximally coherent state with dA = dB, we obtain that the super-additivity equality of relative entropy measure holds if and only if the state is a product state of its reduced states. From the viewpoint of resource in quantum information, we find there exists a maximally coherent state with maximal entanglement. Originated from the behaviour of quantum correlation under the influence of quantum operations, we further classify the incoherent operations which send maximally coherent states to themselves.


2009 ◽  
Vol 9 (1&2) ◽  
pp. 16-36
Author(s):  
N. Johnston ◽  
D.W. Kribs ◽  
V.I. Paulsen

The diamond and completely bounded norms for linear maps play an increasingly important role in quantum information science, providing fundamental stabilized distance measures for differences of quantum operations. We give a brief introduction to the theory of completely bounded maps. Based on this theory, we formulate an algorithm to compute the norm of an arbitrary linear map. We present an implementation of the algorithm via MATLAB, discuss its efficiency, and consider the case of differences of unitary maps.


2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
Andrei Khrennikov

Nowadays it is practically forgotten that for observables with degenerate spectra the original von Neumann projection postulate differs crucially from the version of the projection postulate which was later formalized by Lüders. The latter (and not that due to von Neumann) plays the crucial role in the basic constructions of quantum information theory. We start this paper with the presentation of the notions related to the projection postulate. Then we remind that the argument of Einstein-Podolsky-Rosen against completeness of QM was based on the version of the projection postulate which is nowadays called Lüders postulate. Then we recall that all basic measurements on composite systems are represented by observables with degenerate spectra. This implies that the difference in the formulation of the projection postulate (due to von Neumann and Lüders) should be taken into account seriously in the analysis of the basic constructions of quantum information theory. This paper is a review devoted to such an analysis.


2009 ◽  
Vol 07 (07) ◽  
pp. 1303-1311 ◽  
Author(s):  
ANDREI KHRENNIKOV

This note is devoted to some foundational aspects of quantum mechanics (QM) related to quantum information (QI), especially quantum teleportation and "one way quantum computing." We emphasize the role of the projection postulate (determining post-measurement states) in QI and the difference between its Lüders and von Neumann versions. As is well-known, these postulates differ in the case of observables with degenerate spectra. Such observables are important in operations with entangled states: any measurement on one subsystem is represented by an observable with degenerate spectrum in the Hilbert space of a composite system. Some QI schemes (e.g. quantum teleportation and "one way quantum computing") are based on the use of Lüders postulate. The formal application of von Neumann postulate can block these QI schemes. In this note, we present a list of natural conditions under which von Neumann's description of measurements via refinement implies Lüders projection postulate.


2021 ◽  
Vol 2038 (1) ◽  
pp. 012008
Author(s):  
Sanjib Dey

Abstract Quantum resource theory is perhaps the most revolutionary framework that quantum physics has ever experienced. It plays vigorous roles in unifying the quantification methods of a requisite quantum effect as wells as in identifying protocols that optimize its usefulness in a given application in areas ranging from quantum information to computation. Moreover, the resource theories have transmuted radical quantum phenomena like coherence, nonclassicality and entanglement from being just intriguing to being helpful in executing realistic thoughts. A general quantum resource theoretical framework relies on the method of categorization of all possible quantum states into two sets, namely, the free set and the resource set. Associated with the set of free states there is a number of free quantum operations emerging from the natural constraints attributed to the corresponding physical system. Then, the task of quantum resource theory is to discover possible aspects arising from the restricted set of operations as resources. Along with the rapid growth of various resource theories corresponding to standard harmonic oscillator quantum optical states, significant advancement has been expedited along the same direction for generalized quantum optical states. Generalized quantum optical framework strives to bring in several prosperous contemporary ideas including nonlinearity, PT -symmetric non-Hermitian theories, q-deformed bosonic systems, etc., to accomplish similar but elevated objectives of the standard quantum optics and information theories. In this article, we review the developments of nonclassical resource theories of different generalized quantum optical states and their usefulness in the context of quantum information theories.


2006 ◽  
Vol 04 (01) ◽  
pp. 105-118 ◽  
Author(s):  
MICHAł HORODECKI ◽  
PAWEł HORODECKI ◽  
RYSZARD HORODECKI ◽  
MARCO PIANI

Quantum information, though not precisely defined, is a fundamental concept of quantum information theory which predicts many fascinating phenomena and provides new physical resources. A basic problem is to recognize the features of quantum systems responsible for those phenomena. One of these important features is that non-commuting quantum states cannot be broadcast: two copies cannot be obtained out of a single copy, not even reproduced marginally on separate systems. We focus on the difference in information content between one copy and two copies, which is a basic manifestation of the gap between quantum and classical information. We show that if the chosen information measure is the Holevo quantity, the difference between the information content of one copy and two copies is zero if and only if the states can be broadcast. We propose a new approach in defining measures of quantumness of ensembles based on the difference in information content between the original ensemble and the ensemble of duplicated states. We comment on the permanence property of quantum states and the recently introduced superbroadcasting operation. We also provide an appendix where we discuss the status of quantum information in quantum physics, based on the so-called isomorphism principle.


Sign in / Sign up

Export Citation Format

Share Document