SearcharxivSearch

arXiv subjects

Teiko Heinosaari

Publications and source records attributed to Teiko Heinosaari.

At least 19 recordsLinked to original sources

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

Perfect Discrimination of Non-Orthogonal Quantum States via Adaptive Post-Measurement Queries

A set of pairwise non-orthogonal quantum states cannot be perfectly discriminated, and this remains true even when one bit of classical partial information is available prior to the measurement. Contrary to the usual intuition that earlier information is at least as valuable as later information, we show that the same bit can be more useful when it arrives after the measurement. We present a framework for state discrimination in which the sender provides classical information in response to a request from the receiver, which we refer to as a query. In some cases, pairwise non-orthogonal states can be perfectly discriminated when the query is allowed to depend on the measurement outcome. We give a general method for finding the optimal strategy in this setting, which turns out to be the standard minimum-error discrimination problem for an auxiliary ensemble.

quant-ph

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

Orchestration paradoxes in national quantum computing innovation ecosystems

Effective orchestration is a critical driver of success in quantum computing innovation (QCI) ecosystems. Heterogeneous actor goals, roles, and power relations, however, produce tensions that confront orchestrators with paradoxical situations in which they must navigate trade-offs between competing demands. To orchestrate an ecosystem effectively, these tensions must be recognized and balanced rather than eliminated. Prior research has largely overlooked the role of paradoxes in ecosystem orchestration or has focused mainly on interfirm relationships. This study addresses this gap by examining a government led national QCI ecosystem that includes firms, research organizations, funding bodies, and governmental actors. Using an explorative case study with 15 informants from the Finnish QCI ecosystem and drawing on paradox theory as an analytical lens, we identify core paradoxical tensions and show how they challenge ecosystem orchestration. We contribute nuanced insights into the origins and dynamics of paradoxical tensions and discuss the implications for orchestrating multi-actor ecosystems.

physics.soc-ph

Metainformation in Quantum Guessing Games

Quantum guessing games offer a structured approach to analyzing quantum information processing, where information is encoded in quantum states and extracted through measurement. An additional aspect of this framework is the influence of partial knowledge about the input on the optimal measurement strategies. This kind of side information can significantly influence the guessing strategy and earlier work has shown that the timing of such side information, whether revealed before or after the measurement, can affect the success probabilities. In this work, we go beyond this established distinction by introducing the concept of metainformation. Metainformation is information about information, and in our context it is knowledge that additional side information of certain type will become later available, even if it is not yet provided. We show that this seemingly subtle difference between having no expectation of further information versus knowing it will arrive can have operational consequences for the guessing task. Our results demonstrate that metainformation can, in certain scenarios, enhance the achievable success probability up to the point that post-measurement side information becomes as useful as prior-measurement side information, while in others it offers no benefit. By formally distinguishing metainformation from actual side information, we uncover a finer structure in the interplay between timing, information, and strategy, offering new insights into the capabilities of quantum systems in information processing tasks.

quant-ph

Random Exclusion Codes: Quantum Advantages of Single-Shot Communication

Useful applications of quantum information technologies can be found by identifying tasks in which quantum resources outperform their classical counterparts. In this work, we introduce a two-party communication primitive, random exclusion code (REC), which is a single-shot prepare-and-measure protocol where a sender encodes a random message into a shorter sequence and a receiver attempts to exclude a randomly chosen letter in the original message. We present quantum advantages in RECs in two ways: probability and dimension. We show that RECs with quantum resources achieve higher success probabilities than classical strategies. We verify that the quantum resources required to describe detection events of RECs have a smaller dimension than classical ones. We also show that a guessing counterpart, random access codes (RACs), may not have a dimension advantage over classical resources. Our results elucidate various possibilities of achieving quantum advantages in two-party communication.

quant-ph

Towards reliable quantum software, algorithm and use-case development: Multidisciplinary analysis from the perspective of Finnish industries

Quantum computing is a disruptive technology with the potential to transform various fields. It has predicted abilities to solve complex computational problems beyond the reach of classical computers. However, developing quantum software faces significant challenges. Quantum hardware is yet limited in size and unstable with errors and noise. A shortage of skilled developers and a lack of standardization delay adoption. Quantum hardware is in the process of maturing and is constantly changing its characteristics rendering algorithm design increasingly complex, requiring innovative solutions. Project "Towards reliable quantum software development: Approaches and use-cases" TORQS has studied the dilemma of reliable software development and potential for quantum computing for Finnish industries from multidisciplinary points of views. Here we condense the main observations and results of the project into an essay roadmap and timeline for investing in quantum software, algorithms, hardware, and business.

quant-ph

Finite (quantum) effect algebras

We investigate finite effect algebras and their classification. We show that an effect algebra with $n$ elements has at least $n-2$ and at most $(n-1)(n-2)/2$ nontrivial defined sums. We characterize finite effect algebras with these minimal and maximal number of defined sums. The latter effect algebras are scale effect algebras (i.e., subalgebras of [0,1]), and only those. We prove that there is exactly one scale effect algebra with $n$ elements for every integer $n \geq 2$. We show that a finite effect algebra is quantum effect algebra (i.e. a subeffect algebra of the standard quantum effect algebra) if and only if it has a finite set of order-determining states. Among effect algebras with 2-6 elements, we identify all quantum effect algebras.

quant-ph

Maximal Elements of Quantum Communication

A prepare-and-measure scenario is naturally described by a communication matrix that collects all conditional outcome probabilities of the scenario into a row-stochastic matrix. The set of all possible communication matrices is partially ordered via the possibility to transform one matrix to another by pre- and post-processings. By considering maximal elements in this preorder for a subset of matrices implementable in a given theory, it becomes possible to identify communication matrices of maximum utility, i.e., matrices that are not majorized by any other matrices in the theory. The identity matrix of an appropriate size is the greatest element in classical theories, while the maximal elements in quantum theory have remained unknown. We completely characterize the maximal elements in quantum theory, thereby revealing the essential structure of the set of quantum communication matrices. In particular, we show that the identity matrix is the only maximal element in quantum theory but, as opposed to a classical theory, it is not the greatest element. Quantum theory can hence be seen to be distinct from classical theory by the existence of incompatible communication matrices.

quant-ph

Quantum Computing for All: Online Courses Built Around Interactive Visual Quantum Circuit Simulator

Quantum computing is a highly abstract scientific discipline, which, however, is expected to have great practical relevance in future information technology. This forces educators to seek new methods to teach quantum computing for students with diverse backgrounds and with no prior knowledge of quantum physics. We have developed an online course built around an interactive quantum circuit simulator designed to enable easy creation and maintenance of course material with ranging difficulty. The immediate feedback and automatically evaluated tasks lowers the entry barrier to quantum computing for all students, regardless of their background.

cs.SE

Tsirelson inequalities: Detecting cheating and quantumness in a single framework

Quantumness refers to the peculiar and counterintuitive characteristics exhibited by quantum systems. Tsirelson inequalities have emerged as a powerful tool in quantum theory to detect quantumness and entanglement of harmonic oscillators, spins undergoing uniform precession, and anharmonic systems. In this paper we harness the versatility of Tsirelson inequalities to address two distinct problems: detecting cheating in classic shell games and probing quantumness in spatially separated systems and harmonic oscillators. By adopting a black-box approach and a geometric characterization of the space of conditional probabilities, we demonstrate that Tsirelson inequalities can be used in both scenarios, enabling us to uncover quantum signatures and identify cheaters in a single unified framework. This connection provides an intuitive different perspective on quantumness of mechanical systems.

quant-ph

Can a qudit carry more information than a dit?

Conventional wisdom suggests that within a fixed preparation-measurement setup, a qubit system offers no advantage over a bit. This indeed holds true when considering the standard communication and the famous Holevo bound then formalizes the statement that one qubit can encode at most one bit of information. However, there exist subtle differences between these two physical systems that, when properly exploited, can be converted into practical applications. We begin by discussing the similarities between qudits and dits as information carriers. Then we recall a general framework for communication tasks and review some differences that qudits and dits have. In the end, we present a simple communication application that utilizes the quantum character of the qubit.

quant-ph

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

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

Dispensing of quantum information beyond no-broadcasting theorem -- is it possible to broadcast anything genuinely quantum?

No-broadcasting theorem is one of the most fundamental results in quantum information theory; it guarantees that the simplest attacks on any quantum protocol, based on eavesdropping and copying of quantum information, are impossible. Due to the fundamental importance of the no-broadcasting theorem, it is essential to understand the exact boundaries of this limitation. We generalize the standard definition of broadcasting by restricting the set of states which we want to broadcast and restricting the sets of measurements which we use to test the broadcasting. We show that in some of the investigated cases broadcasting is equivalent to commutativity, while in other cases commutativity is not necessary.

quant-ph

Anticipative measurements in hybrid quantum-classical computation

Before the availability of large scale fault-tolerant quantum devices, one has to find ways to make the most of current noisy intermediate-scale quantum devices. One possibility is to seek smaller repetitive hybrid quantum-classical tasks with higher fidelity, rather than directly pursuing large complex tasks. We present an approach in this direction where the quantum computation is supplemented by a classical result. While the presence of the supplementary classical information helps alone, taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. Anticipative quantum measurements lead to improved success rate over cases where we would use quantum measurements optimized without assuming the later arriving supplementing information. Importantly, in an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end, without the need for feedback from the one to the other computation, a feature which hence allows for running both computations in parallel. We demonstrate the method with an experiment using an IBMQ device and show that it leads to an improved success rate even in a real noisy setting.

quant-ph

Order preserving maps on quantum measurements

We study the partially ordered set of equivalence classes of quantum measurements endowed with the post-processing partial order. The post-processing order is fundamental as it enables to compare measurements by their intrinsic noise and it gives grounds to define the important concept of quantum incompatibility. Our approach is based on mapping this set into a simpler partially ordered set using an order preserving map and investigating the resulting image. The aim is to ignore unnecessary details while keeping the essential structure, thereby simplifying e.g. detection of incompatibility. One possible choice is the map based on Fisher information introduced by Huangjun Zhu, known to be an order morphism taking values in the cone of positive semidefinite matrices. We explore the properties of that construction and improve Zhu's incompatibility criterion by adding a constraint depending on the number of measurement outcomes. We generalize this type of construction to other ordered vector spaces and we show that this map is optimal among all quadratic maps.

quant-ph

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