arXiv subjects

Santiago Zamora

Publications and source records attributed to Santiago Zamora.

13 recordsLinked to original sources

arXiv2026

The logical set of Gaussian states under the stabilizer subsystem decomposition

Universal quantum computation requires non-Gaussianity in continuous-variable systems and non-stabilizerness in discrete-variable systems. Yet, mapping a Gaussian state into the Gottesman-Kitaev-Preskill logical subspace can yield a logical qubit with non-stabilizer resources. To understand how the continuous-variable structure determines logical resources, we characterize the image of single-mode Gaussian states under the corresponding extraction channel, known as the stabilizer subsystem decomposition. Specifically, we derive series expressions for the logical Bloch vector and characterize the resulting reachable set, enabling an analytical treatment of the robustness of magic of the logical states. We then turn this geometric framework into a certification tool: by mapping a discrete-variable qubit witness to a continuous-variable squeezing witness, we obtain lower bounds on the squeezing of prepared states. We also show that ensembles of Gaussian states can violate both stabilizer and classical bounds. Violation of the stabilizer bound certifies the relational resource known as "set-magic," while violation of the classical bound enables the certification of cryptographic randomness at moderate squeezing.

quant-ph↗

arXiv2026

Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario

We investigate the prepare-and-broadcast scenario, a multipartite extension of dimension-constrained prepare-and-measure experiments in which a quantum system is distributed to multiple receivers. We derive fundamental trade-offs between prepare-and-measure witnesses, Bell nonlocality, and quantum random access code performance. We further develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses, showing that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality while remaining robust to noise. Finally, we show that the prepare-and-broadcast scenario naturally accommodates stronger adversarial models in which the eavesdropper retains a quantum system correlated with the measurement device, providing a natural framework for semi-device-independent randomness certification against quantum side information.

quant-ph↗

arXiv2026

Quantum State Discrimination With Stabilizer Circuits

The task of quantum state discrimination provides an operational characterization of distinguishability and plays a central role in quantum information science. Since the achievable success probability in quantum state discrimination depends both on the states being discriminated and on the allowed measurements, it is natural to study discrimination under physically motivated measurement constraints. Here, we investigate minimum-error quantum state discrimination under measurements implementable by both fixed and adaptive stabilizer circuits. Given arbitrary stabilizer-state ancillas, we show that fixed stabilizer circuits provide no additional discrimination power, whereas adaptive circuits do. Then, focusing on single-qubit systems, we derive analytical expressions for the success probability across both circuit classes when supplied with arbitrary (non-stabilizer) ancillas, showing that the performance gap between fixed and adaptive circuits persists. We further consider discrimination with non-stabilizerness incorporated directly into the measurement operators. Here, the optimization is formulated as a semidefinite program, and analytical bounds interpolating between the stabilizer and Helstrom limits for qubits are derived. Finally, we illustrate applications in quantum random access codes and bounds on unitary synthesis fidelity with a finite number of magic states.

quant-ph↗

arXiv2026

The Prepare and Broadcast Scenario

We introduce the dimension-restricted prepare and broadcast (PAB) scenario, which generalizes standard prepare-and-measure frameworks. Here, the system prepared by a sender undergoes a broadcasting transformation before being locally measured by multiple receivers. We develop a hierarchy of classical, quantum, and nonsignalling models describing this scenario, characterize their corresponding correlation sets, and derive new families of Bell-like inequalities together with linear and semidefinite programming methods for their certification. First, assuming shared randomness, we prove that the hierarchy collapses into a single set whenever we consider only one measurement per party. Then, considering multiple possible measurements, we show that PAB scenarios allow the activation of nonclassicality, revealing genuinely nonclassical features in resources that admit classical descriptions in standard prepare-and-measure or Bell settings.

quant-ph↗

arXiv2026

A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems

Non-stabilizerness is a fundamental resource for quantum computational advantage, differentiating classically simulable circuits from those capable of universal quantum computation. Recently, non-stabilizerness has been shown to be relevant for a few qubit systems. In this work, we investigate the geometry of the stabilizer polytope in few-qubit quantum systems, using the trace distance to the stabilizer set to quantify non-stabilizerness. By randomly sampling quantum states, we analyze the distribution of non-stabilizerness for both pure and mixed states and compare the trace distance with other non-stabilizerness measures, as well as entanglement. Additionally, we give an analytical expression for the introduced quantifier, classify Bell-like inequalities corresponding to the facets of the stabilizer polytope, and establish a general concentration result connecting non-stabilizerness and entanglement via Fannes' inequality. Our findings provide new insights into the geometric structure of non-stabilizerness and its role in small-scale quantum systems, offering a deeper understanding of the interplay between quantum resources

quant-ph↗

arXiv2026

Semi-device-independent randomness certification on discretized continuous-variable platforms

Randomness is fundamental for secure communication and information processing. While continuous-variable optical systems offer an attractive platform for this task, certifying genuine quantum randomness in such setups remains challenging. We present a semi-device-independent scheme for randomness certification tailored to continuous-variable implementations, where the dimension assumption is operationally implemented by restricting state preparations to the two-level Fock subspace. Using standard homodyne and displacement-based measurements, we show that simple optical setups can achieve dimension-witness violations that certify positive min-entropy, even in the presence of realistic losses and misaligned reference frames. These results demonstrate that practical and scalable quantum randomness generation is achievable with minimal experimental complexity on continuous-variable platforms.

quant-ph↗

arXiv2026

Detection Efficiency Bounds in (Semi-)Device-Independent Scenarios

This article provides a comprehensive review of the critical role of detection efficiency in demonstrating non-classicality across various device-independent and semi-device-independent scenarios. The central focus is the detection loophole, a challenge in which imperfect detectors can allow classical hidden variable models to mimic quantum correlations, thus masking genuine non-classicality. As a review, the article revisits the paradigmatic Bell scenario, detailing the efficiency requirements for the CHSH inequality, such as the 2/3 threshold for symmetric efficiencies, and traces the historical trajectory toward the first loophole-free tests. The analysis extends to other causal structures to explore how efficiency requirements are affected in different contexts. These include the instrumental scenario, which for binary variables has recently been shown to follow the same inefficiency bounds as the bipartite dichotomic Bell scenario; the prepare-and-measure scenario, where inefficiencies impact the certification of a quantum system's dimension and create security breaches in protocols such as Quantum Key Distribution (QKD); and the bilocality scenario, which exemplifies how employing multiple independent sources can significantly relax the required efficiencies to certify non-classical correlations.

quant-ph↗

arXiv2026

Robust Bell Nonlocality from Gottesman-Kitaev-Preskill States

Bell tests based on homodyne detection are strongly constrained in continuous-variable systems. Can Gottesman-Kitaev-Preskill (GKP) encoding turn homodyne detection into a practical tool for revealing Bell nonlocality? We consider a physically motivated model in which each party performs homodyne detection and digitizes the continuous outcome via a fixed periodic binning, corresponding to logical Pauli measurements. Within this framework, we derive a bipartite no-go: CHSH cannot be violated for Bell-pair states. Moving beyond two parties, we show that finitely squeezed GKP-encoded GHZ and W states nevertheless exhibit strong multipartite nonlocality, violating multipartite Bell inequalities with homodyne-only readout. We quantify the required squeezing thresholds and robustness to loss, providing a route toward homodyne-based Bell tests in continuous-variable systems.

quant-ph↗

arXiv2026

Latent splitting as a causal probe

Generalizations of Bell's framework to causal networks have yielded new foundational insights and applications, including the use of interventions to enhance the detection of nonclassicality in scenarios with communication. Such interventions, however, become uninformative when all observable variables are space-like separated. To address this limitation, we introduce the latent splitting procedure, a generalization of interventions to quantum networks in which controlled manipulations are applied to latent quantum systems. We show that latent splitting enables the detection of nonclassicality by combining observational and interventional data even when conventional interventions fail. Focusing on the triangle network, we derive new analytical witnesses that robustly certify nonclassicality, including nonlinear inequalities for minimal binary-variable scenarios and extensions of the nonclassical region of previously proposed experiments.

quant-ph↗

arXiv2025

Prepare-and-Magic: Semi-Device Independent Magic Certification in the Prepare-and-Measure Scenario

Non-stabilizerness is an essential resource for quantum computational advantage, as stabilizer states admit efficient classical simulation. We develop a semi-device-independent framework for certifying non-stabilizer states in prepare-and-measure (PAM) scenarios, relying only on assumptions about the system's dimension. Within this framework, we introduce prepare-and-measure witnesses that can distinguish stabilizer from non-stabilizer states, and we provide analytical proofs that threshold violations of these witnesses certify non-stabilizerness. In the simplest setting: three preparations, two measurements, and qubit systems, surpassing a specific threshold guarantees that at least one prepared state lies outside the stabilizer polytope, while a stronger violation can certify at least two. We extend this approach by linking it to quantum random access codes, also generalizing our results to qutrit systems and introducing a necessary condition for certifying non-stabilizerness based on state overlaps (Gram matrices). These results offer a set of semi-device-independent tools for practically and systematically verifying non-stabilizer states using prepare-and-measure inequalities.

quant-ph↗

arXiv2025

Witnessing Magic with Bell inequalities

Non-stabilizerness, or magic, is a fundamental resource for quantum computation, enabling quantum algorithms to surpass classical capabilities. Despite its importance, characterizing magic remains challenging due to the intricate geometry of stabilizer polytopes and the difficulty of simulating non-stabilizer states. In this work, we reveal an unexpected connection between magic and Bell inequalities. Although maximally entangled stabilizer states can violate Bell inequalities and magic is deeply tied to the algebraic structure of observables, we show that tailored Bell inequalities can act as witnesses of magic. This result bridges two key quantum resources, uncovering a novel relationship between the device-independent framework and resource-theoretic properties of quantum computation.

quant-ph↗

arXiv2024

Boomerang effect in classical stochastic models

The phenomenon of Anderson localization, occurring in a disordered medium, significantly influences the dynamics of quantum particles. A fascinating manifestation of this is the "quantum boomerang effect" (QBE), observed when a quantum particle, propelled with a finite initial velocity, reverses its average trajectory, eventually halting at its starting point. This effect has recently been demonstrated in an experiment replicating the quantum kicked-rotor model. This research delves into the classical analog of QBE. We uncover evidence of a similar effect in classical systems, characterized by the absence of typical diffusion processes. Our investigation encompasses both simplified probabilistic models and more complex phenomenological models that link classical with quantum mechanics. The results indicate that the boomerang effect is not confined to the quantum realm and may also be present in diverse systems exhibiting subdiffusive behavior.

cond-mat.dis-nn↗

arXiv2024

Observational-Interventional Bell Inequalities

Generalizations of Bell's theorem, particularly within quantum networks, are now being analyzed through the causal inference lens. However, the exploration of interventions, a central concept in causality theory, remains significantly unexplored. In this work we give an initial step in this direction, by analyzing the instrumental scenario and proposing novel hybrid Bell inequalities integrating observational and interventional data. Focusing on binary outcomes with any number of inputs, we obtain the complete characterization of the observational-interventional polytope, equivalent to a Hardy-like Bell inequality albeit describing a distinct quantum experiment. To illustrate its applications, we show a significant enhancement regarding threshold detection efficiencies for quantum violations also showing the use of these hybrid approach in quantum steering scenarios.

quant-ph↗