arXiv subjects

Leevi Leppäjärvi

Publications and source records attributed to Leevi Leppäjärvi.

At least 19 recordsLinked to original sources

arXiv2026

Adversarial Information Gain in Non-ideal Quantum Measurements

Performing a quantum measurement yields two different results: a classical outcome drawn from a probability distribution, according to Born's rule, and a quantum outcome corresponding to the post-measurement state. Quantum devices that provide both outcomes can be described through quantum instruments. In a realistic scenario, one can expect that the observer's obtained classical and quantum outcomes are non-ideal: this can be due to experimental limitations, but could also be explained by adversarial interference, that is, a second party that disturbs the device through a concealed measurement to obtain information. The second scenario can be interpreted through quantum compatibility, as it implies that both the observer's instrument and the adversary's measurement can be performed simultaneously. In this work, we show how the noise of the observer's device relates to the amount of information that the adversary can obtain. We study scenarios in which the adversary aims to acquire information on the same basis as the observer's measurement, or on a mutually unbiased basis with respect to the observer's basis. In both cases, we derive necessary and sufficient conditions for the compatibility of a single qubit non-ideal quantum instrument and a noisy meter, from which we obtain the maximum amount of information that the adversary can extract in terms of the noise parameters of the observer's instrument. Finally, we provide the device implementation from the adversary's point of view for the same basis scenario.

quant-ph↗

arXiv2026

Nonclassical traits in multi-copy state discrimination

Quantum state discrimination is a fundamental information processing task that serves as a key component in many applications while also carrying foundational significance. In this work, we consider minimum error discrimination of multi-copy states, where instead of preparing a single system we assume that multiple instances of the same state are prepared. Now the discrimination allows for measurements from multiple parties with different measurement strategies varying from global measurement strategy to ones restricted to different forms of local operations and classical communication strategies. By comparing the average success probabilities in quantum and classical cases, we find a qubit strategy that outperforms all the bit strategies. On the other hand, we show that the classical measurement strategy does not give benefit in qubit over bit. However, we find that there are other (qu)bit-like operational theories which can outperform the best qubit strategies even with a classical measurement strategy and we are able to identify instances of different theories where different measurement strategies are optimal. In this way, we are able to find instances of nonlocality without entanglement as well as provide general bounds for bit-like operational theories.

quant-ph↗

arXiv2026

Quantifying randomness with measurement incompatibility

We present a trade-off between the amount of observed measurement incompatibility and the capabilities of a classical Eavesdropper in a prepare-and-measure scenario. The result is based on a qualitative connection between measurement incompatibility and randomness generation together with the utilization of incompatibility witnesses as randomness certificates. This allows one to use a geometric measure of incompatibility, the generalised robustness, to bound Eve's strategies through a semi-definite program, while providing an explicit protocol for generating randomness from any set of incompatible measurements. By translating the result to quantum steering, we find a tight connection between steerability and randomness generation in a setting using any finite number of measurement inputs. We further show how our techniques can be generalised to scenarios where Eve has a quantum memory by using a dimensional generalisation of joint measurability.

quant-ph↗

arXiv2025

Semi-device-independent channel identification with communication matrices

We look into the task of differentiating between any two quantum channels and reconstructing them from the obtained measurement statistics with possibly limited information about the experimental set-up. We employ the communication matrix formalism where the measurement statistics of a prepare-and-measure scenario is represented as a stochastic communication matrix. In order to differentiate between any two quantum channels, the informational completeness of the set-up is both necessary and sufficient. On the other hand, if we want to uniquely characterize any quantum channel, in addition we also need to have a complete description of the set-up. We show that in many important cases we can deduce this information directly from the communication matrix of the set-up before applying the channel. Given that we trust the dimension of the system, we show that we can deduce the information completeness of the set-up directly from the rank of the communication matrix. Furthermore, we show that another quantity of the communication matrix, called the information storability, can be used to self-test the set-up (up to unitary or antiunitary freedom) for an important class of states and measurements. This provides us a semi-device-independent way to identify quantum channels from the prepare-and-measure statistics. Lastly, we consider scenarios where we might have some additional information about the channels or additional resources at our disposal which could help us relax some of the assumptions of the proposed scenario.

quant-ph↗

arXiv2025

Factorization of multimeters: a unified view on nonclassical quantum phenomena

Quantum theory exhibits various nonclassical features, such as measurement incompatibility, contextuality, steering, and Bell nonlocality, which distinguish it from classical physics. These phenomena are often studied separately, but they possess deep interconnections. This work introduces a unified mathematical framework based on commuting diagrams that unifies them. By representing collections of measurements (multimeters) as maps to the set of column-stochastic matrices, we show that measurement compatibility and simulability correspond to specific factorizations of these maps through intermediate systems. We apply this framework to put forward connections between different nonclassical notions and provide factorization-based characterizations for steering assemblages and Bell correlations, including a new perspective on the CHSH inequality witnessing measurement incompatibility. We also investigate the symmetric $n$-extensions of multimeters and no-signaling behaviors and connect these extensions to a notion of $n$-wise compatibility and to the existence of $n$-wise LHV models, respectively. Furthermore, we investigate robustness to noise of nonlocal features by examining factorization conditions for maps involving noisy state spaces, providing geometric criteria for when noisy multimeters can be simulated by simpler measurement settings.

quant-ph↗

arXiv2025

On the simulation of quantum multimeters

In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformations between multimeters. However, not all of these transformations correspond to valid simulations, as otherwise we could create any resource from nothing. For example, the set of transformations includes maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. From the perspective of an experimenter with a given multimeter as part of a complicated setup, having to discard the multimeter and using a different one instead is undesirable. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.

quant-ph↗

arXiv2024

Simple Information Processing Tasks with Unbounded Quantum Advantage

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of the system. We show that already in the simplest possible scenarios it is possible to detect a definite, unbounded advantage of quantum systems over classical systems. We do this by constructing a family of operationally meaningful communication tasks each of which on one hand can be implemented by using just a single qubit but which on the other hand require unboundedly larger classical system for classical implementation. Furthemore, we show that even though with the additional resource of shared randomness the proposed communication tasks can be implemented by both quantum and classical systems of the same size, the number of coordinated actions needed for the classical implementation also grows unboundedly. In particular, no finite storage can be used to store all the coordinated actions needed to implement all the possible quantum communication tasks with classical systems. As a consequence, shared randomness cannot be viewed as a free resource.

quant-ph↗

arXiv2024

Incompatibility of quantum instruments

Quantum instruments describe outcome probability as well as state change induced by measurement of a quantum system. Incompatibility of two instruments, i. e. the impossibility to realize them simultaneously on a given quantum system, generalizes incompatibility of channels and incompatibility of positive operator-valued measures (POVMs). We derive implications of instrument compatibility for the induced POVMs and channels. We also study relation of instrument compatibility to the concept of non-disturbance. Finally, we prove equivalence between instrument compatibility and postprocessing of certain instruments, which we term complementary instruments. We illustrate our findings on examples of various classes of instruments.

quant-ph↗

arXiv2024

Generating random Gaussian states

We develop a method for the random sampling of (multimode) Gaussian states in terms of their covariance matrix, which we refer to as a random quantum covariance matrix (RQCM). We analyze the distribution of marginals and demonstrate that the eigenvalues of an RQCM converge to a shifted semicircular distribution in the limit of a large number of modes. We provide insights into the entanglement of such states based on the positive partial transpose (PPT) criteria. Additionally, we show that the symplectic eigenvalues of an RQCM converge to a probability distribution that can be characterized using free probability. We present numerical estimates for the probability of a RQCM being separable and, if not, its extendibility degree, for various parameter values and mode bipartitions.

quant-ph↗

arXiv2023

Encoding and decoding of information in general probabilistic theories

Encoding and decoding are the two key steps in information processing. In this work we study the encoding and decoding capabilities of operational theories in the context of information-storability game, where the task is to freely choose a set of states from which one state is chosen at random and by measuring the state it must be identified; a correct guess results in as many utiles as the number of states in the chosen set and an incorrect guess means a penalty of a fixed number of utiles. We connect the optimal winning strategy of the game to the amount of information that can be stored in a given theory, called the information storability of the theory, and show that one must use so-called nondegradable sets of states and nondegradable measurements whose encoding and decoding properties cannot be reduced. We demonstrate that there are theories where the perfect discrimination strategy is not the optimal one so that the introduced game can be used as an operational test for super information storability. We further develop the concept of information storability by giving new useful conditions for calculating it in specific theories.

quant-ph↗

arXiv2023

Semi-device-independent certification of number of measurements

We develop a method for semi-device-independent certification of number of measurements. We achieve this by testing whether Bob's steering equivalent observables (SEO) can be simulated by k measurements, which we do by testing whether they are k-compatible with separable joint observable. This test can be performed with the aid of hierarchy of semidefinite programs, and whenever it fails one can conclude that Alice must have access to at least k + 1 incompatible measurements.

quant-ph↗

arXiv2021

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↗

arXiv2021

Measurement simulability and incompatibility in quantum theory and other operational theories

In this thesis, we consider the properties of measurements in quantum theory and other operational theories. After having introduced the framework of operational theories, we consider a communication scheme based on an experimental prepare-and-measure scenario and demonstrate this with different communication tasks. This gives us context for how the different communication tasks can be implemented in different theories, in doing so establishing quantum theory intuitively as an operational theory among other theories. The main property of measurements we focus on in this work is the simulation of measurements, which consists of manipulating the inputs and outputs of the measurement devices. We study how using this process on existing measurement devices can be used to operationally imitate new devices, and what kind of structure the simulation process induces on measurements. We also consider applications of simulability. Firstly, we consider operational restrictions imposed upon measurements. We argue that the restricted set of physical measurements must be closed with respect to the simulation process since the simulation of physical devices must lead to other physically feasible devices. We demonstrate different types of restrictions by classifying them. As a second application we see how the simulation of measurements relates to compatibility of measurements and how it can be viewed as a generalisation of it. This allows us to present an operational principle previously known to quantum theory, the no-free-information principle, according to which any measurement that is compatible with all other measurement must not provide any useful, and therefore free, information about the system. Whilst this principle holds in quantum theory, there are non-classical theories for which it is violated, and so enforcing this principle may be considered a way to exclude some unphysical theories.

quant-ph↗

arXiv2020

Post-processing of quantum instruments

Studying sequential measurements is of the utmost importance to both the foundational aspects of quantum theory and the practical implementations of quantum technologies, with both of these applications being abstractly described by the concatenation of quantum instruments into a sequence of certain length. In general, the choice of instrument at any given step in the sequence can be conditionally chosen based on the classical results of all preceding instruments. For two instruments in a sequence we consider the conditional second instrument as an effective way of post-processing the first instrument into a new one. This is similar to how a measurement described by a positive operator-valued measure (POVM) can be post-processed into another by way of classical randomization of its outcomes using a stochastic matrix. In this work we study the post-processing relation of instruments and the partial order it induces on their equivalence classes. We characterize the greatest and the least element of this order, give examples of post-processings between different types of instruments and draw connections between post-processings of some of these instruments and their induced POVMs.

quant-ph↗

arXiv2020

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↗

arXiv2019

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↗

arXiv2019

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↗

arXiv2018

Entanglement Protection via Periodic Environment Resetting in Continuous Time Quantum Dynamical Processes

The temporal evolution of entanglement between a noisy system and an ancillary system is analyzed in the context of continuous time open quantum system dynamics. Focusing on a couple of analytically solvable models for qubit systems, we study how Markovian and non-Markovian characteristics influence the problem, discussing in particular their associated entanglement-breaking regimes. These performances are compared with those one could achieve when the environment of the system is forced to return to its input configuration via periodic instantaneous resetting procedures.

quant-ph↗