arXiv subjects

Rafael Chaves

Publications and source records attributed to Rafael Chaves.

At least 37 records · Page 2Linked to original sources

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

A variational quantum algorithm for entanglement quantification

Quantum entanglement is a foundational resource in quantum information science, underpinning applications across physics. However, detecting and quantifying entanglement remains a significant challenge. In this article, we introduce a variational quantum algorithm inspired by Uhlmann's theorem to quantify the Bures entanglement of general quantum states, a method that naturally extends to other quantum resources, including genuine multipartite entanglement, quantum discord, quantum coherence, and total correlations, while also enabling reconstruction of the closest free states. The algorithm requires a polynomial number of ancillary qubits and circuit depth relative to the system size, dimensionality, and free state cardinality, making it scalable for practical implementations. Thus, it provides a versatile framework for quantifying quantum resources, demonstrated here through several applications.

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

Efficient and operational quantifier of non-divisibility in terms of channel discrimination

The understanding of open quantum systems is crucial for the development of quantum technologies. Of particular relevance is the characterisation of divisible quantum dynamics, seen as a generalisation of Markovian processes to the quantum setting. Here, we propose a way to detect divisibility and quantify how non-divisible a quantum channel is through the concept of channel discrimination. We ask how well we can distinguish generic dynamics from divisible dynamics. We show that this question can be answered efficiently through semidefinite programming, which provides us with an operational and efficient way to quantify divisibility.

quant-ph↗

arXiv2025

A friendly guide to exorcising Maxwell's demon

The birth, life, and death of Maxwell's demon provoked a profound discussion about the interplay between thermodynamics, computation, and information. Even after its exorcism, the demon continues to inspire a multidisciplinary field. This tutorial offers a comprehensive overview of Maxwell's demon and its enduring influence, bridging classical concepts with modern insights in thermodynamics, information theory, and quantum mechanics.

quant-ph↗

arXiv2025

Efficient detection of localization transitions using predictability

Identifying phase transition points is a fundamental challenge in condensed matter physics, particularly for transitions driven by quantum interference effects, such as Anderson and many-body localization. Recent studies have demonstrated that quantum coherence provides an effective means of detecting localization transitions, offering a practical alternative to full quantum state tomography and related approaches. Building on this idea, we investigate localization transitions through complementarity relations that connect local predictability, local coherence, and entanglement in bipartite pure states. Our results show that predictability serves as a robust and efficient marker for localization transitions. Crucially, its experimental determination requires exponentially fewer measurements than coherence or entanglement, making it a powerful tool for probing quantum phase transitions.

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↗

arXiv2025

Experimental randomness certification in a quantum network with independent sources

Randomness certification is a foundational and practical aspect of quantum information science, essential for securing quantum communication protocols. Traditionally, these protocols have been implemented and validated with a single entanglement source, as in the paradigmatic Bell scenario. However, advancing these protocols to support more complex configurations involving multiple entanglement sources is key to building robust architectures and realizing large-scale quantum networks. In this work, we show how to certify randomness in an entanglement-teleportation experiment, the building block of a quantum repeater displaying two independent sources of entanglement. Utilizing the scalar extension method, we address the challenge posed by the non-convexity of the correlation set, providing effective bounds on an eavesdropper's knowledge of the shared secret bits. Our theoretical model characterizes the certifiable randomness within the network and is validated through the analysis of experimental data from a photonic quantum network.

quant-ph↗

arXiv2025

Predicting topological invariants and unconventional superconducting pairing from density of states and machine learning

Competition between magnetism and superconductivity can lead to unconventional and topological superconductivity. However, the experimental confirmation of the presence of Majorana edge states and unconventional pairing currently poses a major challenge. Here we consider a two-dimensional lattice model for a superconductor with spin-orbit coupling and exchange coupling to randomly distributed magnetic impurities. Depending on parameters of the model, this system may display topologically trivial or nontrivial edge states. We map out the phase diagram by computing the Bott index, a topological invariant defined in real space. We then use machine learning (ML) algorithms to predict the Bott index from the local density of states (LDOS) at zero energy, obtaining high-accuracy results. We also train ML models to predict the amplitude of odd-frequency pairing in the anomalous Green's function at zero energy. Once the ML models are trained using the LDOS, which is experimentally accessible via scanning tunneling spectroscopy, our method could be applied to predict the number of Majorana edge states and to estimate the magnitude of odd-frequency pairing in real materials.

cond-mat.supr-con↗

arXiv2024

Experimental quantum randomness enhanced by a quantum network

The certification of randomness is essential for both fundamental science and information technologies. Unlike traditional random number generators, randomness obtained from nonlocal correlations is fundamentally guaranteed to be unpredictable. However, it is also highly susceptible to noise. Here, we show that extending the conventional bipartite Bell scenario to hybrid quantum networks -- which incorporate both quantum channels and entanglement sources -- enhances the robustness of certifiable randomness. Our protocol even enables randomness to be certified from Bell-local states, broadening the range of quantum states useful for this task. Through both theoretical analysis and experimental validation in a photonic network, we demonstrate enhanced performance and improved noise resilience.

quant-ph↗

arXiv2024

Error-Correcting Codes in TQFT on Multispheres

Topological quantum field theories (TQFT) encode quantum correlations in topological features of spaces. In this work, we leverage this feature to explore how information encoded in TQFTs can be stored and retrieved in the presence of local decoherence affecting its physical carriers. TQFT states' inherent nonlocality, redundancy, and entanglement position them as natural error-correcting codes. We demonstrate that information recovery protocols can be derived from the principle that protected information must be uniformly distributed across the system and from interpreting correlations in terms of space connectivity. Specifically, we employ a topological framework to devise erasure error correction protocols, showing that information can be successfully recovered even when parts of the system are corrupted.

quant-ph↗

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↗

arXiv2023

Characterizing Hybrid Causal Structures with the Exclusivity Graph Approach

Analyzing the geometry of correlation sets constrained by general causal structures is of paramount importance for foundational and quantum technology research. Addressing this task is generally challenging, prompting the development of diverse theoretical techniques for distinct scenarios. Recently, novel hybrid scenarios combining different causal assumptions within different parts of the causal structure have emerged. In this work, we extend a graph theoretical technique to explore classical, quantum, and no-signaling distributions in hybrid scenarios, where classical causal constraints and weaker no-signaling ones are used for different nodes of the causal structure. By mapping such causal relationships into an undirected graph we are able to characterize the associated sets of compatible distributions and analyze their relationships. In particular we show how with our method we can construct minimal Bell-like inequalities capable of simultaneously distinguishing classical, quantum, and no-signaling behaviors, and efficiently estimate the corresponding bounds. The demonstrated method will represent a powerful tool to study quantum networks and for applications in quantum information tasks.

quant-ph↗

arXiv2023

Statistical properties and repetition rates for a quantum network with geographical distribution of nodes

Steady technological advances and recent milestones such as intercontinental quantum communication and the first implementation of medium-scale quantum networks are paving the way for the establishment of the quantum internet, a network of nodes interconnected by quantum channels. Here we build upon recent models for quantum networks based on optical fibers by considering the effect of a non-uniform distribution of nodes, more specifically based on the demographic data of the federal states in Brazil. We not only compute the statistical properties of this more realistic network, comparing its features with previous models but also employ it to compute the repetition rates for entanglement swapping, an essential protocol for quantum communication based on quantum repeaters.

quant-ph↗

arXiv2023

Estimating the volumes of correlations sets in causal networks

Causal networks beyond that in the paradigmatic Bell's theorem can lead to new kinds and applications of non-classical behavior. Their study, however, has been hindered by the fact that they define a non-convex set of correlations and only very incomplete or approximated descriptions have been obtained so far, even for the simplest scenarios. Here, we take a different stance on the problem and consider the relative volume of classical or non-classical correlations a given network gives rise to. Among many other results, we show instances where the inflation technique, arguably the most disseminated tool in the community, is unable to detect a significant portion of the non-classical behaviors. Interestingly, we also show that the use of interventions, a central tool in causal inference, can enhance substantially our ability to witness non-classicality.

quant-ph↗

arXiv2023

Detecting quantum phase transitions in a frustrated spin chain via transfer learning of a quantum classifier algorithm

The classification of phases and the detection of phase transitions are central and challenging tasks in diverse fields. Within physics, it relies on the identification of order parameters and the analysis of singularities in the free energy and its derivatives. Here, we propose an alternative framework to identify quantum phase transitions. Using the axial next-nearest neighbor Ising (ANNNI) model as a benchmark, we show how machine learning can detect three phases (ferromagnetic, paramagnetic, and a cluster of the antiphase with the floating phase). Employing supervised learning, we demonstrate the feasibility of transfer learning. Specifically, a machine trained only with nearest-neighbor interactions can learn to identify a new type of phase occurring when next-nearest-neighbor interactions are introduced. We also compare the performance of common classical machine learning methods with a version of the quantum nearest neighbors (QNN) algorithm.

quant-ph↗