A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically coordinated to simulate sets of quantum states. These models have natural operational interpretation in prepare-and-measure scenarios and they can account for many non-commuting quantum state sets. We develop systematic methods both for classically simulating quantum sets and for showing that no such simulation exists, thereby certifying quantum coherence. In particular, we determine the exact noise rates required to classically simulate the entire state space of quantum theory. We also reveal connections between the operational classicality of sets and the well-known fundamental concepts of joint measurability and Einstein-Podolsky-Rosen steering. Here, we present an avenue to understand how and to what extent quantum states defy generic models based on classical devices, which also has relevant implications for quantum information applications.
A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically coordinated to simulate sets of quantum states. These models have natural operational interpretation in prepare-and-measure scenarios and they can account for many non-commuting quantum state sets. We develop systematic methods both for classically simulating quantum sets and for showing that no such simulation exists, thereby certifying quantum coherence. In particular, we determine the exact noise rates required to classically simulate the entire state space of quantum theory. We also reveal connections between the operational classicality of sets and the well-known fundamental concepts of joint measurability and Einstein-Podolsky-Rosen steering. Here, we present an avenue to understand how and to what extent quantum states defy generic models based on classical devices, which also has relevant implications for quantum information applications.
Superposition is the core feature that sets quantum theory apart from classical physics. Here, we investigate whether sets of quantum measurements can be modelled by using devices limited to performing jointly diagonalisable measurements. This leads us to introduce classical measurement models, where many such devices are connected together through classical randomness and post-processing. Such classical measurement models are intermediate between the notion of commutative measurements and joint measurability. Towards understanding these models we (i) identify exact noise and loss rates at which all projective measurements admit a classical model, (ii) propose numerical methods to construct classical models for finite sets of measurements, and (iii) show how to construct witnesses for ruling out the existence of classical models. In addition, we show that classical measurement models also have operational implications in non-disturbance tasks where sequential quantum measurements are implemented with classical side-information. Our work provides a new approach to the role of superposition in quantum measurements.
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.
Abstract If the presence of entanglement could be certified in a device-independent (DI) way, it is likely to provide various quantum information processing tasks with unconditional security. Recently, it was shown that a DI protocol, combining measurement-device-independent techniques with self-testing, is able to verify all entangled states, however, it imposes demanding requirements on its experimental implementation. In this work, we propose a much less-demanding protocol based on Einstein-Podolsky-Rosen (EPR) steering to certify entanglement. We establish a complete framework for DI verification of EPR steering in which all steerable states could be verified. We then analyze its robustness towards noise and imperfections of self-testing by considering the measurement scenario with three settings at each side. Finally, a four-photon experiment is implemented to demonstrate that even Bell local states can be device-independently verified. Our work may pave the way for realistic applications of secure quantum information tasks.
The study of stronger-than-quantum phenomena (i.e., postquantum) has enabled a deeper understanding of the scope of quantum theory. Much is known about the case of correlations in Bell scenarios, where the device-independent framework allowed us to explore its possibilities independently of the formalism of quantum theory. However, less is known about the phenomenon of Einstein-Podolsky-Rosen steering. Here, the `characterised parties' are assumed to describe their systems locally through the quantum formalism, which inconveniences a theory-independent description. In addition, a theorem by Gisin and Hughston, Josza and Wootters further hindered the discovery of the phenomenon. The study of postquantum steering, initiated about a decade ago, has been quite fruitful, including: the development of mathematical formalisms that frame the effect, resource theories that quantify it as a resource, and activation protocols that relate it to Bell correlations. However, all these results have a limitation in common: they apply to scenarios with only one quantum party.
Here we articulate the concept of postquantum steering for scenarios with multiple quantum parties, bringing in the missing piece to the puzzle. We provide an algorithm to certify postquantumness, which in some cases also certifies quantumness. We also define a hierarchy of semidefinite programs that bounds the set of quantum assemblages from the outside. Moreover, we show that the study of postquantum steering is fundamentally relevant since it is not just a mere mathematical curiosity allowed by the no-signalling principle, but it may arise within compositional theories beyond quantum theory. Our work further discovers a peculiarity of steering: its theory-independent description fundamentally prevents a direct connection with Bell nonlocality -- e.g., nonclassical Bell correlations do not imply nonclassical steering.
In the effort to develop useful quantum computers, simulating quantum machines with conventional classical computing resources is a key capability. Such simulations will always face limits, preventing the emulation of quantum computers at substantial scale; however, by pushing the envelope through optimal choices of algorithms and hardware, the value of simulator tools can be maximized. This work reviews state-of-the-art numerical simulation methods, i.e., classical algorithms that emulate quantum computer evolution under specific operations. We focus on the mainstream state-vector and tensor-network paradigms, while briefly mentioning alternative methods. Moreover, we review the diverse applications of simulation across different facets of quantum computer development, including understanding the fundamental differences between quantum and classical computations, exploring algorithmic design for quantum advantage, predicting quantum processor performance at the design stage, and efficiently characterizing fabricated devices for rapid iterations. This review complements recent surveys of current tools and implementations; here, we aim to provide readers with an essential understanding of the theoretical basis of classical simulation methods, a detailed discussion of their advantages and limitations, and an overview of the demands and challenges arising from practical use cases.
This paper provides a systematic study of the operational idea that a quantum “state” is only defined up to what can be distinguished by a chosen family of observables. Concretely, any von Neumann algebra of observables M induces an equivalence relation on pure and mixed states by declaring two preparations indiscernible when they give identical statistics for every observable in M. The corresponding quotient, the Holevo space associated with M, is the effective (relational) state space of the experiment, explicitly dependent on the observer’s available measurements. We analyse the resulting geometry and topology of these quotients, and prove a context-complete classical representation theorem: for every von Neumann algebra M there is a canonical lift a↦â to bounded continuous functions on the Holevo space, reproducing expectation values pointwise. In the commutative case this reduces to ordinary probability theory on the joint spectrum. The framework is illustrated in explicit examples, including position measurements of a free particle and polarisation measurements in the qubit, Einstein–Podolsky–Rosen (EPR), and Bell settings. In particular, in the EPR scenario Charlie’s joint observable defines a simplex of joint outcome distributions, whereas the Alice/Bob marginal viewpoint collapses the effective description to a lower-dimensional space by “forgetting” the correlation parameter. We show that by varying the polariser settings, the indiscernibility classes become conjugated (and generically reshuffled), and different settings are typically incompatible at the level of observable algebras.