arXiv subjects

Ana Belén Sainz

Publications and source records attributed to Ana Belén Sainz.

At least 19 recordsLinked to original sources

arXiv2026

Noncontextuality inequalities for prepare-transform-measure scenarios

We provide the first systematic technique for deriving witnesses of contextuality in prepare-transform-measure scenarios. More specifically, we show how linear quantifier elimination can be used to compute a polytope of correlations consistent with generalized noncontextuality in such scenarios. This polytope is specified as a set of noncontextuality inequalities that are necessary and sufficient conditions for observed data in the scenario to admit of a classical explanation relative to any linear operational identities, if one ignores some constraints from diagram preservation. While including these latter constraints generally leads to tighter inequalities, it seems that nonlinear quantifier elimination would be required to systematically include them. We also provide a linear program which can certify the nonclassicality of a set of numerical data arising in a prepare-transform-measure experiment. We apply our results to get a robust noncontextuality inequality for transformations that can be violated within the stabilizer subtheory. Finally, we give a simple algorithm for computing all the linear operational identities holding among a given set of states, of transformations, or of measurements.

quant-ph↗

arXiv2026

Theory-agnostic nonclassicality certification in an integrated photonic circuit

Certifying nonclassicality without assuming any particular underlying physical theory constitutes both a foundational challenge and a requirement for device-independent protocols. Realizing such theory-independent certification in scalable architectures is essential for connecting fundamental tests with emerging quantum technologies. Integrated photonic circuits are a leading platform for scalable quantum information processing, motivating the development of rigorous methods to certify the nonclassical resources underpinning quantum advantage. In this paper, we report a theory-independent certification of generalized contextuality on a three-mode integrated photonic circuit. Our approach combines theory-agnostic tomography with simplex-embeddability certification---a framework that requires no assumptions about the underlying physical theory---and applies it to experimental data from a three-mode photonic circuit seeded by single photons. An independently constructed quantum model of the experiment provides a consistency check on the observed nonclassicality, without entering the certification as a theoretical assumption. The method rules out simplex-embeddability for our experimental data, providing robust, theory-independent evidence that our photonic circuit exhibits nonclassicality.

quant-ph↗

arXiv2026

Typicality of Contextuality

Identifying when observed statistics cannot be explained by any reasonable classical model is a central problem in quantum foundations. A principled and universally applicable approach to defining and identifying nonclassicality is given by the notion of generalized noncontextuality. Here, we study the typicality of contextuality -- namely, the likelihood that randomly chosen quantum preparations and measurements produce nonclassical statistics. Using numerical linear programs to test for the existence of a generalized-noncontextual model, we find that contextuality is fairly common: even in experiments with only a modest number of random preparations and measurements, contextuality arises with probability over 99%. We also show that while typicality of contextuality decreases as the purity (sharpness) of the preparations (measurements) decreases, this dependence is not especially pronounced, so contextuality is fairly typical even in settings with realistic noise. Finally, we show that although nonzero contextuality is quite typical, quantitatively high degrees of contextuality are not as typical, and so large quantum advantages (like for parity-oblivious multiplexing, which we take as a case study) are not as typical. We provide an open-source toolbox that outputs the typicality of contextuality as a function of tunable parameters (such as lower and upper bounds on purity and other constraints on states and measurements). This toolbox can inform the design of experiments that achieve the desired typicality of contextuality for specified experimental constraints.

quant-ph↗

arXiv2026

Tomographically-nonlocal entanglement

Entanglement is a central and subtle feature of quantum theory, whose structure and operational behavior can change dramatically when additional physical constraints, such as symmetries or superselection rules, are imposed. Such constraints can give rise to striking and counter-intuitive phenomena, including local broadcasting of entangled states and failures of entanglement monogamy. These effects naturally arise in tomographically nonlocal theories (like real quantum theory, twirled worlds, or fermionic quantum theory), where composite systems possess holistic degrees of freedom that are inaccessible to local measurements. In this work, we study entanglement in such theories within the framework of generalized probabilistic theories. We show that the failure of tomographic locality leads to two qualitatively distinct forms of entanglement, which we term $\textit{tomographically-local}$ entanglement and $\textit{tomographically-nonlocal}$ entanglement. We analyze the operational consequences of this distinction, proving that tomographically-nonlocal entanglement is useless for Bell nonlocality, steering, and teleportation, but sufficient for dense coding and perfectly secure data hiding. This framework clarifies the origin of several previously puzzling features of entanglement that arise when tomographic locality fails, as can happen even in quantum theory when one considers fermions or fundamental superselection rules.

quant-ph↗

arXiv2026

The resource theory of causal influence and knowledge of causal influence

Understanding and quantifying causal relationships between variables is essential for reasoning about the physical world. In this work, we develop a resource-theoretic framework to do so. Here, we focus on the simplest nontrivial setting -- two variables that are causally ordered, meaning that the first has the potential to influence the second, without hidden confounding. First, we introduce the resource theory that directly quantifies causal influence of a functional dependence in this setting and show that the problem of deciding convertibility of resources and identifying a complete set of monotones has a relatively straightforward solution. Following this, we introduce the resource theory that arises naturally when one has uncertainty about the functional dependence. We describe a linear program for deciding the question of whether one resource (i.e., state of knowledge about the functional dependence) can be converted to another. Then, we focus on the case where the variables are binary. In this case, we identify a triple of monotones that are complete in the sense that they capture the partial order over the set of all resources, and we provide an interpretation of each.

math.ST↗

arXiv2025

Activation of post-quantum steering

There are possible physical theories that give greater violations of Bell's inequalities than the corresponding Tsirelson bound, termed post-quantum non-locality. Such theories do not violate special relativity, but could give an advantage in certain information processing tasks. There is another way in which entangled quantum states exhibit non-classical phenomena, with one notable example being Einstein-Podolsky-Rosen (EPR) steering; a violation of a bipartite Bell inequality implies EPR steering, but the converse is not necessarily true. The study of post-quantum EPR steering is more intricate, but it has been shown that it does not always imply post-quantum non-locality in a conventional Bell test. In this work we show how to distribute resources in a larger network that individually do not demonstrate post-quantum non-locality but violate a Tsirelson bound for the network. That is, we show how to activate post-quantum steering so that it can now be witnessed as post-quantum correlations in a Bell scenario. One element of our work that may be of independent interest is we show how to self-test a bipartite quantum assemblage in a network, even assuming post-quantum resources.

quant-ph↗

arXiv2025

Shadows and subsystems of generalized probabilistic theories: when tomographic incompleteness is not a loophole for contextuality proofs

It is commonly believed that failures of tomographic completeness undermine assessments of nonclassicality in noncontextuality experiments. In this work, we study how such failures can indeed lead to mistaken assessments of nonclassicality. We then show that proofs of the failure of noncontextuality are robust to a very broad class of failures of tomographic completeness, including the kinds of failures that are likely to occur in real experiments. We do so by showing that such proofs actually rely on a much weaker assumption that we term relative tomographic completeness: namely, that one's experimental procedures are tomographic for each other. Thus, the failure of noncontextuality can be established even with coarse-grained, effective, emergent, or virtual degrees of freedom. This also implies that the existence of a deeper theory of nature (beyond that being probed in one's experiment) does not in and of itself pose any challenge to proofs of nonclassicality. To prove these results, we first introduce a number of useful new concepts within the framework of generalized probabilistic theories (GPTs). Most notably, we introduce the notion of a GPT subsystem, generalizing a range of preexisting notions of subsystems (including those arising from tensor products, direct sums, decoherence processes, virtual encodings, and more). We also introduce the notion of a shadow of a GPT fragment, which captures the information lost when one's states and effects are unknowingly not tomographic for one another.

quant-ph↗

arXiv2025

Proceedings of the 22nd International Conference on Quantum Physics and Logic

This volume contains the proceedings of the 22nd International Conference on Quantum Physics and Logic (QPL 2025), which was held from 14th to 18th July 2025, in Varna, Bulgaria, organised by Université libre de Bruxelles. QPL is an annual conference that brings together academic and industry researchers working on the mathematical foundations of quantum computation, quantum physics, and related areas. The main focus is on the use of algebraic and categorical structures, formal languages, semantic methods, as well as other mathematical and computer scientific techniques applicable to the study of physical systems, physical processes, and their composition.

quant-ph↗

arXiv2025

Every non-signalling channel is common-cause realizable

In this work we show that the set of non-signalling resources of a locally-tomographic generalised probabilistic theory (GPT), such as quantum and classical theory, coincides with its set of GPT-common-cause realizable resources, where the common causes come from an associated GPT. From a causal perspective, this result provides a reason for, in the study of resource theories of common-cause processes, taking the non-signalling channels as the resources of the enveloping theory. This answers a critical open question in Ref.~\cite{schmid2020postquantum}. An immediate corollary of our result is that every non-signalling assemblage is realizable in a GPT, answering in the affirmative the question posed in Ref.~\cite{cavalcanti2022post}.

quant-ph↗

arXiv2025

Robustness of contextuality under different types of noise as quantifiers for parity-oblivious multiplexing tasks

Generalised contextuality is the notion of nonclassicality powering up a myriad of quantum tasks, among which is the celebrated case of a two-party information processing task where classical information is compressed in a quantum channel, the parity-oblivious multiplexing (POM) task. The success rate is the standard quantifier of resourcefulness for this task, while robustness-based quantifiers are as operationally motivated and have known general properties. In this work, we leverage analytical and numerical tools to estimate robustness of contextuality in POM scenarios under different types of noise. We conclude that for the 3-to-1 case robustness of contextuality to depolarisation, as well as a minimisation of robustness of contextuality to dephasing over all bases, are good quantifiers for the nonclassical advantage of this scenario. Moreover, we obtain a general relation between robustness of contextuality to depolarisation and the success rate in any $n$-to-1 POM scenario and show how it can be used to bound the number of bits encoded in this task.

quant-ph↗

arXiv2024

Indistinguishability in general probabilistic theories

The existence of indistinguishable quantum particles provides an explanation for various physical phenomena we observe in nature. We lay out a path for the study of indistinguishable particles in general probabilistic theories (GPTs) via two frameworks: the traditional GPT framework and the diagrammatic framework of process theories. In the first approach we define different types of indistinguishable particle by the orbits of symmetric states under transformations. In the diagrammatic approach, we find a decomposition of the symmetrised state space using two key constructions from category theory: the biproduct completion and the Karoubi envelope. In both cases for pairs of indistinguishable particles in quantum theory we recover bosons and fermions.

quant-ph↗

arXiv2024

A hierarchy of semidefinite programs for generalised Einstein-Podolsky-Rosen scenarios

Correlations in Einstein-Podolsky-Rosen (EPR) scenarios, captured by \textit{assemblages} of unnormalised quantum states, have recently caught the attention of the community, both from a foundational and an information-theoretic perspective. The set of quantum-realisable assemblages, or abbreviated to quantum assemblages, are those that arise from multiple parties performing local measurements on a shared quantum system. In general, deciding whether or not a given assemblage is a quantum assemblage, i.e. membership of the set of quantum assemblages, is a hard problem, and not always solvable. In this paper we introduce a hierarchy of tests where each level either determines non-membership of the set of quantum assemblages or is inconclusive. The higher the level of the hierarchy the better one can determine non-membership, and this hierarchy converges to a particular set of assemblages. Furthermore, this set to which it converges contains the quantum assemblages. Each test in the hierarchy is formulated as a semidefinite program. This hierarchy allows one to upper bound the quantum violation of a steering inequality and the quantum advantage provided by quantum EPR assemblages in a communication or information-processing task.

quant-ph↗

arXiv2024

Activation of post-quantumness in bipartite generalised EPR scenarios

In a standard bipartite Einstein-Podolsky-Rosen (EPR) scenario, Alice and Bob share a system prepared in an entangled state and Alice performs local measurements. One possible generalisation of this set-up is to allow Bob to also locally process his subsystem. Then, correlations generated in such generalised EPR scenarios are examples of non-signalling bipartite resources, called assemblages, that can exhibit post-quantum behavior, i.e., cannot be generated using solely quantum systems. There exist assemblages that, despite being post-quantum resources, can only generate quantum correlations in bipartite Bell-type scenarios. Here, we present a protocol for activation of post-quantumness in bipartite generalised EPR scenarios such as the so-called Bob-with-input, measurement-device-independent, and channel EPR scenarios. By designing a protocol that involves distributing the assemblages in a larger network, we derive tailored Bell inequalities which can be violated beyond their quantum bound in this new set-up. Our results show that in all of the above generalised scenarios, the post-quantumness of the assemblages can be witnessed at the level of correlations they produce.

quant-ph↗

arXiv2024

Revisiting dynamics of quantum causal structures -- when can causal order evolve?

Recently, there has been substantial interest in studying the dynamics of quantum theory beyond that of states, in particular, the dynamics of channels, measurements, and higher-order transformations. Ref. [Phys. Rev. X 8(1), 011047 (2018)] pursues this using the process-matrix formalism, together with a definition of the possible dynamics of such process matrices, and focusing especially on the question of evolution of causal structures. One of its major conclusions is a strong theorem saying that within the formalism, under continuous and reversible transformations, the causal order between operations must be preserved. Our result here challenges that of Ref. [Phys. Rev. X 8(1), 011047 (2018)]: if one is to take into account a full picture of the physical evolution of operations within the standard quantum-mechanical formalism, then the conclusion of Ref. [Phys. Rev. X 8(1), 011047 (2018)] does not hold. That is, we show that under certain continuous and reversible dynamics, the causal order between operations is not necessarily preserved. We moreover identify and analyse the root of this apparent contradiction, specifically, that the commonly accepted and widely applied framework of higher-order processes, whilst mathematically sound, is not always appropriate for drawing conclusions on physical dynamics. Finally, we show how to reconcile the elements of the whole picture following the intuition based on entanglement processing by local operations and classical communication.

quant-ph↗

arXiv2024

Accessible fragments of generalized probabilistic theories, cone equivalence, and applications to witnessing nonclassicality

The formalism of generalized probabilistic theories (GPTs) was originally developed as a way to characterize the landscape of conceivable physical theories. Thus, the GPT describing a given physical theory necessarily includes all physically possible processes. We here consider the question of how to provide a GPT-like characterization of a particular experimental setup within a given physical theory. We show that the resulting characterization is not generally a GPT in and of itself-rather, it is described by a more general mathematical object that we introduce and term an accessible GPT fragment. We then introduce an equivalence relation, termed cone equivalence, between accessible GPT fragments (and, as a special case, between standard GPTs). We give a number of examples of experimental scenarios that are best described using accessible GPT fragments, and where moreover cone-equivalence arises naturally. We then prove that an accessible GPT fragment admits of a classical explanation if and only if every other fragment that is cone-equivalent to it also admits of a classical explanation. Finally, we leverage this result to prove several fundamental results regarding the experimental requirements for witnessing the failure of generalized noncontextuality. In particular, we prove that neither incompatibility among measurements nor the assumption of freedom of choice is necessary for witnessing failures of generalized noncontextuality, and, moreover, that such failures can be witnessed even using arbitrarily inefficient detectors.

quant-ph↗

arXiv2024

Contextuality with vanishing coherence and maximal robustness to dephasing

Generalized contextuality is a resource for a wide range of communication and information processing protocols. However, contextuality is not possible without coherence, and so can be destroyed by dephasing noise. Here, we explore the robustness of contextuality to partially dephasing noise in a scenario related to state discrimination (for which contextuality is a resource). We find that a vanishing amount of coherence is sufficient to demonstrate the failure of noncontextuality in this scenario, and we give a proof of contextuality that is robust to arbitrary amounts of partially dephasing noise. This is in stark contrast to partially depolarizing noise, which is always sufficient to destroy contextuality.

quant-ph↗

arXiv2024

Contextuality without incompatibility

The existence of incompatible measurements is often believed to be a feature of quantum theory which signals its inconsistency with any classical worldview. To prove the failure of classicality in the sense of Kochen-Specker noncontextuality, one does indeed require sets of incompatible measurements. However, a more broadly applicable notion of classicality is the existence of a generalized-noncontextual ontological model. In particular, this notion can imply constraints on the representation of outcomes even within a single nonprojective measurement. We leverage this fact to demonstrate that measurement incompatibility is neither necessary nor sufficient for proofs of the failure of generalized noncontextuality. Furthermore, we show that every proof of the failure of generalized noncontextuality in a quantum prepare-measure scenario can be converted into a proof of the failure of generalized noncontextuality in a corresponding scenario with no incompatible measurements.

quant-ph↗

arXiv2024

A linear program for testing nonclassicality and an open-source implementation

A well motivated method for demonstrating that an experiment resists any classical explanation is to show that its statistics violate generalized noncontextuality. We here formulate this problem as a linear program and provide an open-source implementation of it which tests whether or not any given prepare-measure experiment is classically-explainable in this sense. The input to the program is simply an arbitrary set of quantum states and an arbitrary set of quantum effects; the program then determines if the Born rule statistics generated by all pairs of these can be explained by a classical (noncontextual) model. If a classical model exists, it provides an explicit model. If it does not, then it computes the minimal amount of noise that must be added such that a model does exist, and then provides this model. We generalize all these results to arbitrary generalized probabilistic theories (and accessible fragments thereof) as well; indeed, our linear program is a test of simplex-embeddability.

quant-ph↗