Searcharxiv⌕ Search

arXiv subjects

Teiko Heinosaari

Publications and source records attributed to Teiko Heinosaari.

At least 37 records · Page 2Linked to original sources

Random access test as an identifier of nonclassicality

Random access codes are an intriguing class of communication tasks that reveal an operational and quantitative difference between classical and quantum information processing. We formulate a natural generalization of random access codes and call them random access tests, defined for any finite collection of measurements in an arbitrary finite dimensional general probabilistic theory. These tests can be used to examine collective properties of collections of measurements. We show that the violation of a classical bound in a random access test is a signature of either measurement incompatibility or super information storability. The polygon theories are exhaustively analyzed and a critical difference between even and odd polygon theories is revealed.

quant-ph↗

Testing incompatibility of quantum devices with few states

When observations must come from incompatible devices and cannot be produced by compatible devices? This question motivates two integer valued quantifications of incompatibility, called incompatibility dimension and compatibility dimension. The first one quantifies how many states are minimally needed to detect incompatibility if the test states are chosen carefully, whereas the second one quantifies how many states one may have to use if they are randomly chosen. With concrete examples we show that these quantities have unexpected behaviour with respect to noise.

quant-ph↗

Quantum guessing games with posterior information

Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial information after a quantum measurement has been performed. We present a general framework for quantum guessing games with posterior information and derive structure and reduction theorems that enable to analyze any such game. We formalize symmetry of guessing games and characterize the optimal measurements in cases where the symmetry is related to an irreducible representation. The application of guessing games to incompatibility detection is reviewed and clarified. All the presented main concepts and results are demonstrated with examples.

quant-ph↗

Communication tasks in operational theories

We investigate the question which communication tasks can be accomplished within a given operational theory. The concrete task is to find out which communication matrices have a prepare-and-measure implementation with states and measurement from a given theory. To set a general framework for this question we develop the ultraweak matrix majorization in the set of communication matrices. This preorder gives us means to determine when one communication task is more difficult than another. Furthermore, we introduce several monotones which can be used to compare and characterize the communication matrices. We observe that not only do the monotones allow us to compare communication matrices, but also their maximal values in a given theory are seen to relate to some physical properties of the theory. The maximal values can then be thought as `dimensions', allowing us to compare different theories to each other. We analyse the introduced monotones one by one and demonstrate how the set of implementable communication matrices is different in several theories with the focus being mainly on the difference between classical and quantum theories of a given dimension.

quant-ph↗

Quantum State Discrimination via Repeated Measurements and the Rule of Three

The task of state discrimination for a set of mutually orthogonal pure states is trivial if one has access to the corresponding sharp (projection-valued) measurement, but what if we are restricted to an unsharp measurement? Given that any realistic measurement device will be subject to some noise, such a problem is worth considering. In this paper we consider minimum error state discrimination for mutually orthogonal states with a noisy measurement. We show that by considering repetitions of commutative Lüders measurements on the same system we are able to increase the probability of successfully distinguishing states. In the case of binary Lüders measurements we provide a full characterisation of the success probabilities for any number of repetitions. This leads us to identify a 'rule of three', where no change in probability is obtained from a second measurement but there is noticeable improvement after a third. We also provide partial results for $N$-valued commutative measurements where the rule of three remains, but the general pattern present in binary measurements is no longer satisfied.

quant-ph↗

Random positive operator valued measures

We introduce several notions of random positive operator valued measures (POVMs), and we prove that some of them are equivalent. We then study statistical properties of the effect operators for the canonical examples, obtaining limiting eigenvalue distributions with the help of free probability theory. Similarly, we obtain the large system limit for several quantities of interest in quantum information theory, such as the sharpness, the noise content, and the probability range. Finally, we study different compatibility criteria, and we compare them for generic POVMs.

quant-ph↗

Operational restrictions in general probabilistic theories

The formalism of general probabilistic theories provides a universal paradigm that is suitable for describing various physical systems including classical and quantum ones as particular cases. Contrary to the usual no-restriction hypothesis, the set of accessible meters within a given theory can be limited for different reasons, and this raises a question of what restrictions on meters are operationally relevant. We argue that all operational restrictions must be closed under simulation, where the simulation scheme involves mixing and classical post-processing of meters. We distinguish three classes of such operational restrictions: restrictions on meters originating from restrictions on effects; restrictions on meters that do not restrict the set of effects in any way; and all other restrictions. We fully characterize the first class of restrictions and discuss its connection to convex effect subalgebras. We show that the restrictions belonging to the second class can impose severe physical limitations despite the fact that all effects are accessible, which takes place, e.g., in the unambiguous discrimination of pure quantum states via effectively dichotomic meters. We further demonstrate that there are physically meaningful restrictions that fall into the third class. The presented study of operational restrictions provides a better understanding on how accessible measurements modify general probabilistic theories and quantum theory in particular.

quant-ph↗

Quantum random access codes and incompatibility of measurements

We prove that quantum random access code (QRAC) performs better than its classical counterpart only when incompatible quantum measurements are used in the decoding task. As a consequence, evaluating the average success probability for QRAC provides a semi-device independent test for the detection of quantum incompatibility. We further demonstrate that any incompatible pair of projective measurements gives an advantage over all classical strategies. Finally, we establish a connection between the maximal average success probability for QRAC and earlier quantities introduced to assess incompatibility.

quant-ph↗

Witnessing incompatibility of quantum channels

We introduce the notion of incompatibility witness for quantum channels, defined as an affine functional that is non-negative on all pairs of compatible channels and strictly negative on some incompatible pair. This notion extends the recent definition of incompatibility witnesses for quantum measurements. We utilize the general framework of channels acting on arbitrary finite dimensional von Neumann algebras, thus allowing us to investigate incompatibility witnesses on measurement-measurement, measurement-channel and channel-channel pairs. We prove that any incompatibility witness can be implemented as a state discrimination task in which some intermediate classical information is obtained before completing the task. This implies that any incompatible pair of channels gives an advantage over compatible pairs in some such state discrimination task.

quant-ph↗

Whenever a quantum environment emerges as a classical system, it behaves like a measuring apparatus

We study the dynamics of a quantum system $Γ$ with an environment $Ξ$ made of $N$ elementary quantum components. We aim at answering the following questions: can the evolution of $Γ$ be characterized by some general features when $N$ becomes very large, regardless of the specific form of its interaction with each and every component of $Ξ$? In other terms: should we expect all quantum systems with a macroscopic environment to undergo a somehow similar evolution? And if yes, of what type? In order to answer these questions we use well established results from large-$N$ quantum field theories, particularly referring to the conditions ensuring a large-$N$ quantum model to be effectively described by a classical theory. We demonstrate that the fulfillment of these conditions, when properly imported into the framework of the open quantum systems dynamics, guarantees that the evolution of $Γ$ is always of the same type of that expected if $Ξ$ were a measuring apparatus, no matter the details of the actual interaction. On the other hand, such details are found to determine the specific basis w.r.t. which $Γ$ undergoes the decoherence dictated by the dynamical description of the quantum measurement process. This result wears two hats: on the one hand it clarifies the physical origin of the formal statement that, under certain conditions, any channel from $ρ_Γ$ to $ρ_Ξ$ takes the form of a measure-and-prepare map, as recently shown in Ref. [1]; on the other hand, it formalizes the qualitative argument that the reason why we do not observe state superpositions is the continual measurement performed by the environment.

quant-ph↗

No-free-information principle in general probabilistic theories

In quantum theory, the no-information-without-disturbance and no-free-information theorems express that those observables that do not disturb the measurement of another observable and those that can be measured jointly with any other observable must be trivial, i.e., coin tossing observables. We show that in the framework of general probabilistic theories these statements do not hold in general and continue to completely specify these two classes of observables. In this way, we obtain characterizations of the probabilistic theories where these statements hold. As a particular class of state spaces we consider the polygon state spaces, in which we demonstrate our results and show that while the no-information-without-disturbance principle always holds, the validity of the no-free-information principle depends on the parity of the number of vertices of the polygons.

quant-ph↗

Noise-disturbance relation and the Galois connection of quantum measurements

The relation between noise and disturbance is investigated within the general framework of Galois connections. Within this framework, we introduce the notion of leak of information, mathematically defined as one of the two closure maps arising from the observable-channel compatibility relation. We provide a physical interpretation for it, and we give a comparison with the analogous closure maps associated with joint measurability and simulability for quantum observables.

quant-ph↗

Obtaining conclusive information from incomplete experimental quantum tomography

We demonstrate that incomplete quantum tomography can give conclusive information in experimental realizations. We divide the state space into a union of multiple disjoint subsets and determine conclusively which of the subsets a system, prepared in completely unknown state, belongs to. In other words we construct and solve membership problems. Our membership problems are partitions of the state space into a union of four disjoint sets formed by fixing two maximally entangled reference states and boundary values of fidelity function "radius" between the reference states and the unknown preparation. We study the necessary and sufficient conditions of the measurements which solve these membership problems conclusively. We construct and experimentally implement such informationally incomplete measurement on two-photon polarization states with combined one-qubit measurements, and solve the membership problem in example cases.

quant-ph↗

Quantum Incompatibility Witnesses

We demonstrate that quantum incompatibility can always be detected by means of a state discrimination task with partial intermediate information. This is done by showing that only incompatible measurements allow for an efficient use of premeasurement information in order to improve the probability of guessing the correct state. Thus, the gap between the guessing probabilities with pre- and postmeasurement information is a witness of the incompatibility of a given collection of measurements. We prove that all linear incompatibility witnesses can be implemented as some state discrimination protocol according to this scheme. As an application, we characterize the joint measurability region of two noisy mutually unbiased bases.

quant-ph↗

Communication of partial ignorance with qubits

We introduce a class of communication tests where the task is to communicate partial ignorance by means of a physical system. We present a full characterization of the implementations of these tests in the qubit case and partial results for qudits. A peculiar observation is that two physical systems with the same operational dimensions may differ with respect to implementations of these tasks, as is shown to be the case for the qubit and rebit. Finally, we consider the natural question whether some of the communication tests are more difficult than others. A new preordering that we call the ultraweak matrix majorization is presented to answer this question in a theory-independent way.

quant-ph↗

Post-processing minimal joint observables

A finite set of quantum observables (positive operator valued measures) is called compatible if these observables are marginals of a some observable, called a joint observable of them. For a given set of compatible observables, their joint observable is in general not unique and it is desirable to take a minimal joint observable in the post-processing order since a less informative observable disturbs less the system. We address the question of the minimality of finite-outcome joint observables and prove that any joint observable is lower bounded by a minimal joint observable in the post-processing order. We also give characterizations of the minimality of a joint observable that can be checked by finite-step algorithms and apply them to the case of non-commuting dichotomic qubit observables.

quant-ph↗

Antidistinguishability of Pure Quantum States

The Pusey-Barrett-Rudolph theorem has recently provoked a lot of discussion regarding the reality of the quantum state. In this article we focus on a property called antidistinguishability, which is a main component in constructing the proof for the PBR theorem. In particular we study algebraic conditions for a set of pure quantum states to be antidistinguishable, and a novel sufficient condition is presented. We also discuss a more general criterion which can be used to show that the sufficient condition is not necessary. Lastly, we consider how many quantum states needs to be added into a set of pure quantum states in order to make the set antidistinguishable. It is shown that in the case of qubit states the answer is one, while in the general but finite dimensional case the answer is at most $n$, where $n$ is the size of the original set.

quant-ph↗