We investigate the task of identifying the parity (odd vs even) of an unknown permutation applied to $n$ particles. Classically, using fewer than $n$ distinct labels per particle limits the success probability to random guessing, whereas quantum mechanics, exploiting entanglement in both preparation and measurement, accomplishes the task perfectly with as few as $\big\lceil \sqrt{n}\big\rceil$ levels per particle [\href{https://doi.org/10.1103/yhyv-xnwq}{PRL {\bf 135}, 260603 (2025)}]. We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies. Moreover, such product preparations yield perfect success in locally quantum theories, where elementary systems are quantum but their composition follows the minimal tensor product structure of generalized probabilistic theories (GPTs). We further identify GPT models that accomplish the task with certainty without requiring entanglement either at the preparation stage or at the measurement stage. Our central result establishes that the linear dimension of the elementary systems, rather than entanglement, is the fundamental resource governing the existence of probabilistic advantage in the permutation parity problem. In particular, below the required dimension threshold, no amount of entanglement can improve upon the random-guessing limit.
We investigate the task of identifying the parity (odd vs even) of an unknown permutation applied to n particles. Classically, using fewer than n distinct labels per particle limits the success probability to random guessing, whereas quantum mechanics, exploiting entanglement in both preparation and measurement, accomplishes the task perfectly with as few as ⌈n⌉ levels per particle [\href{https://doi.org/10.1103/yhyv-xnwq}{PRL {\bf 135}, 260603 (2025)}]. We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies. Moreover, such product preparations yield perfect success in locally quantum theories, where elementary systems are quantum but their composition follows the minimal tensor product structure of generalized probabilistic theories (GPTs). We further identify GPT models that accomplish the task with certainty without requiring entanglement either at the preparation stage or at the measurement stage. Our central result establishes that the linear dimension of the elementary systems, rather than entanglement, is the fundamental resource governing the existence of probabilistic advantage in the permutation parity problem. In particular, below the required dimension threshold, no amount of entanglement can improve upon the random-guessing limit.
We establish a sharp quantum advantage in determining the parity (even-odd) of an unknown permutation applied to any number n≥3 of particles. Classically, this is impossible with fewer than n labels, being that the success is limited to random guessing. Quantum mechanics does it with certainty with as few as ⌈sqrt[n] ⌉ distinguishable states per particle, thanks to entanglement. Below this threshold, not even quantum mechanics helps: both classical and quantum success are limited to random guessing. For small n, we provide explicit expressions for states that ensure perfect parity identification. We also assess the minimum entanglement these states need to carry, finding it to be close to maximal, and even maximal in some cases. The task requires no oracles or contrived setups and provides a simple, rigorous example of genuine quantum advantage.
A central question in quantum information is whether a given set of states can provide an advantage in some information-processing task. We establish a universal connection between two such questions: how well a set of states can be discriminated, and whether it can power tasks whose advantage stems from generalized contextuality. Working in the framework of generalized probabilistic theories (GPTs), which includes quantum and classical systems as special cases, we show that any set of states able to provide a nonclassical advantage in a contextuality-powered task must obey nontrivial upper bounds on the success probability of every state discrimination task using the full set. Contextual advantage therefore implies limited distinguishability, exposing a trade-off between two basic operational resources. Importantly, this is more than a statement about the idealized limit: perfect distinguishability is not needed to preclude contextuality. Our thresholds lie strictly below unity, so any set whose discrimination performance exceeds them while still imperfectly distinguishable is already guaranteed to admit a noncontextual explanation. The bounds follow from a simple geometric property, linear dependence of the state set, take a closed analytical form, and depend only on the prior of the task and the convex geometry of the states. As an illustration, we apply them to generalized parity-oblivious multiplexing, where sufficiently high success in the task implies that at least one sub-ensemble of the codebook cannot power any contextual advantage.
A permutation of n particles is either even or odd according to the parity of the number of pairwise swaps required to realize it. Classically, deterministic identification of this parity requires n distinct local labels, one for each particle. A recently proposed quantum protocol [A. Diebra et al., Phys. Rev. Lett. 135, 260603 (2025)] reduces this requirement to a local dimension dmin = ⌈√n⌉ by exploiting multipartite entanglement, while retaining deterministic parity identification after a single application of the permutation. Here, we experimentally realize the minimal nontrivial case, n = 3 and d = 2, by mapping the parity-sensitive state structure onto a coherent superposition of Hermite–Gaussian spatial modes. A programmable multi-plane light converter implements all six elements of the permutation group S3, and a single projection measurement separates the even and odd permutation classes with a visibility of V ≃ 0.78. Our experiment reproduces, with structured classical light, the operational mechanism underlying this multipartite quantum-advantage protocol and establishes programmable spatial-mode processing as a versatile platform for exploring quantum protocols based on symmetry, interference, and reduced dimensional resources.
A permutation of n particles is either even or odd according to the parity of the number of pairwise swaps required to realize it. Classically, deterministic identification of this parity requires n distinct local labels, one for each particle. A recently proposed quantum protocol [A. Diebra et al., Phys. Rev. Lett. 135, 260603 (2025)] reduces this requirement to a local dimension dmin = ⌈√n⌉ by exploiting multipartite entanglement, while retaining deterministic parity identification after a single application of the permutation. Here, we experimentally realize the minimal nontrivial case, n = 3 and d = 2, by mapping the parity-sensitive state structure onto a coherent superposition of Hermite–Gaussian spatial modes. A programmable multi-plane light converter implements all six elements of the permutation group S3, and a single projection measurement separates the even and odd permutation classes with a visibility of V ≃ 0.78. Our experiment reproduces, with structured classical light, the operational mechanism underlying this multipartite quantum-advantage protocol and establishes programmable spatial-mode processing as a versatile platform for exploring quantum protocols based on symmetry, interference, and reduced dimensional resources.
Inspired by its fundamental importance in quantum mechanics, we define and study the notion of entanglement for abstract physical theories, investigating its profound connection with the concept of superposition. We adopt the formalism of general probabilistic theories (GPTs), encompassing all physical models whose predictive power obeys minimal requirements. Examples include classical theories, which do not exhibit superposition and whose state space has the shape of a simplex, quantum mechanics, as well as more exotic models such as Popescu-Rohrlich boxes. We call two GPTs entangleable if their composite admits either entangled states or entangled measurements, and conjecture that any two non-classical theories are in fact entangleable. We present substantial evidence towards this conjecture by proving it (1) for the simplest case of 3-dimensional theories; (2) when the local state spaces are discrete, which covers foundationally relevant cases; (3) when one of the local theories is quantum mechanics. Furthermore, (4) we envision the existence of a quantitative relation between local non-classicality and global entangleability, explicitly describing it in the geometrically natural case where the local state spaces are centrally symmetric.
Quantum theory is considered to be the most fundamental and most accurate physical theory of today. Although quantum theory is conceptually difficult to understand, its mathematical structure is quite simple. What determines this particularly simple and elegant mathematical structure? In short: Why is quantum theory as it is? Addressing such questions is the aim of investigating the foundations of quantum theory. In the past this field of research was sometimes considered as an academic subject without much practical impact. However, with the emergence of quantum information theory this perception has changed significantly and both fields started to fruitfully influence each other. Today fundamental aspects of quantum theory attract increasing attention and the field belongs to the most exciting subjects of theoretical physics. This thesis is concerned with a particular branch in this field, namely, with so-called Generalized Probabilistic Theories (GPTs), which provide a unified theoretical framework in which classical and quantum theory emerge as special cases. This is used to examine nonlocal features that help to distinguish quantum theory from alternative toy theories. In order to extend the scope of theories that can be examined with the framework, we also introduce several generalizations to the framework itself. We start in Chapter 1 with introducing the standard GPT framework and summarize previous results, based on a review paper of the author [New J. Phys. 13, 063024 (2011)]. To keep the introduction accessible to a broad readership, we follow a constructive approach. Starting from few basic physically motivated assumptions we show how a given set of observations can be manifested in an operational theory. Furthermore, we characterize consistency conditions limiting the range of possible extensions. We point out that non-classical features of single systems can equivalently result from higher dimensional classical theories that have been restricted. Entanglement and non-locality, however, are shown to be genuine non-classical features. We review features that have been found to be specific for quantum theory separably or single and joint systems. Chapter 2 incorporates results published in [J. Phys. A 47(32), pp. 1-32 (2014)] and [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)]. The GPT framework is applied to show how the structure of local state spaces indirectly affects possible nonlocal correlations, which are global properties of a theory. These correlations are stronger than those possible in a classical theory, but happen to show different restrictions that can be linked to the structure of subsystems. We first illustrate the phenomenon with toy theories with particular local state spaces. We than show that a particular class of joint states (inner product states), whose existence depends on geometrical properties of the local subsystems, can only have correlations for a known limited set called Q1. All bipartite correlations of both, quantum and classical correlations, can be mapped to measurement statistics from such joint states. Chapter 3 shows unpublished results on entanglement swapping in GPTs. This protocol, which is well known in quantum information theory, allows to nonlocally transfer entanglement to initially unentangled parties with the help of a third party that shares entanglement with each. We review our approach published in [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)], which mimics the joint systems' structure of quantum theory by modifying a popular toy theory known as boxworld. However, it is illustrated that this approach fails for bigger multipartite systems due to inconsistencies evoked by entanglement swapping. It turns out that the GPT framework does not allow entanglement swapping for general subsystems with two-dimensional state spaces with transitive pure states. Altering the GPT framework to allow completely globally degrees of freedom, however, enables us to construct consistent entanglement swapping for these subsystems. This construction resembles the situation in quantum theory on a real Hilbert space. A questionable assumption usually taken in the standard GPT framework is the so-called no-restriction hypothesis. It states that the measurement that are possible in a theory can be derived from the state space. In fact, this assumption seems to exist for reasons of mathematical convenience, but it seems to lack physical motivation. We generalize the GPT framework to also account for systems that do not obey the no-restriction hypothesis in Chapter 4, which presents results published in [Phys. Rev. A 87, 052131 (2013)] and [Proc. QPL 2013, to be published in EPTCS]. The extended framework includes new classes of probabilistic theories. As an example, we show how to construct theories that include intrinsic noise. We also provide a "self-dualization" procedure that requires the violation of the no-restriction hypothesis. This procedure restricts the measurement of arbitrary theories such that the theories act as if they were self-dual. Self-duality has recently gathered lots of interest, since such theories share many features of quantum theory. For example Tsirelson’s bound holds for correlations on the maximally entangled state in these theories. Finally, we characterize the maximal set of joint states that can be consistently defined for given subsystems. This generalizes the maximal tensor product of the standard GPT framework.