arXiv subjects

Miguel Navascués

Publications and source records attributed to Miguel Navascués.

At least 19 recordsLinked to original sources

arXiv2026

Tight and self-testing multipartite quantum Bell inequalities from the renormalization group

In past work, the concept of connectors was introduced: directed tensors with the property that any contraction thereof defines a multipartite quantum Bell inequality, i.e., a linear restriction on measurement probabilities that holds in any multipartite quantum experiment. In this paper we propose the notion of ''tight connectors'', which, if contracted according to some simple rules, result in tight quantum Bell inequalities. By construction, the new inequalities are saturated by tensor network states, whose structure mimics the corresponding network of connectors. Some tight connectors are furthermore ''fully self-testing'', which implies that the quantum Bell inequalities they generate can only be maximized with such a tensor network state and specific measurement operators (modulo local isometries). We provide large analytic families of tight, fully self-testing connectors that generate $N$-partite quantum Bell inequalities of correlator form for which the ratio between the maximum quantum and classical values increases exponentially with $N$.

quant-ph↗

arXiv2026

A semi-definite programming formulation of the device-dependent guessing probability

In quantum mechanics, a measurement applied to a state in general produces some amount of intrinsic randomness. This is not only a fundamental feature of the theory, but is also at the basis of any quantum process to generate random numbers. The simplest of such processes consists of a single, fully charaterized, measurement acting on a single, fully characterized, state. Unfortunately, no general method to estimate the intrinsic randomness produced in such setups is known. In this work, we address this issue by presenting a semidefinite programming formulation of the maximum probability with which an adversary, Eve, can guess the outcomes of characterized but untrusted prepare-and-measure setups. We then present several applications of this construction. First, we apply our method to a variety of specific setups, allowing us both to benchmark the approach and, more importantly, to determine the exact amount of certifiable randomness in scenarios where only upper bounds were previously available. Then, we show that the presence of entanglement between the device preparing the state and the measurement strictly increases Eve's predictive power, already in the most elementary setup of a binary measurement acting on a qubit state.

quant-ph↗

arXiv2026

First-order optimality conditions for non-commutative optimization problems

We consider the problem of optimizing the state average of a polynomial of non-commuting variables, over all states and operators satisfying a number of polynomial constraints, and over all Hilbert spaces where such states and operators are defined. Such non-commutative polynomial optimization (NPO) problems are routinely solved through hierarchies of semidefinite programming (SDP) relaxations. By formulating the general NPO problem in Lagrangian terms, we heuristically derive first-order optimality conditions via small variations in the problem variables. Although the derivation is not rigorous, it gives rise to two types of optimality conditions -- state and operator -- which are rigorously analyzed in the paper. Both types of conditions can be enforced through additional positive semidefinite constraints in the SDP hierarchies. State optimality conditions are shown to be satisfied by all NPO problems. For NPO problems with optimal solutions (such as, e.g., Archimedean ones) they allow enforcing a new type of constraints: namely, restricting the optimization over states to the set of common ground states of an arbitrary number of operators. Operator optimality conditions are the non-commutative analogs of the Karush--Kuhn--Tucker (KKT) conditions, which are known to hold in many classical optimization problems. In this regard, we prove that a weak form of operator optimality holds for all NPO problems; stronger versions require the problem constraints to satisfy some qualification criterion, just like in the classical case (e.g.: Mangasarian--Fromovitz constraint qualification). We test the power of the new optimality conditions by computing local properties of ground states of many-body spin systems and the maximum quantum violation of Bell inequalities.

quant-ph↗

arXiv2025

Quantum Field Measurements in the Fewster-Verch Framework

The Fewster-Verch (FV) framework provides a local and covariant approach for defining measurements in quantum field theory (QFT). Within this framework, a probe QFT represents the measurement device, which, after interacting with the target QFT, undergoes an arbitrary local measurement. Remarkably, the FV framework is free from Sorkin-like causal paradoxes and robust enough to enable quantum state tomography. However, two open issues remain. First, it is unclear if the FV framework allows conducting arbitrary local measurements. Second, if the probe field is interpreted as physical and the FV framework as fundamental, then one must demand the probe measurement to be itself implementable within the framework. That would involve a new probe, which should also be subject to an FV measurement, and so on. It is unknown if there exist non-trivial FV measurements for which such an ``FV-Heisenberg cut" can be moved arbitrarily far away. In this work, we advance the first problem by proving that Gaussian-modulated measurements of locally smeared fields fit within the FV framework. We solve the second problem by showing that any such measurement admits a movable FV-Heisenberg cut. As a technical byproduct, we establish that state transformations induced by finite-rank perturbations of the classical phase space underlying a linear scalar field preserve the Hadamard property.

hep-th↗

arXiv2025

The Diósi-Penrose model of classical gravity predicts gravitationally induced entanglement

We show that the dynamics of the Diósi-Penrose (DP) model of classical gravity can entangle the mechanical degrees of freedom of two separate particles. For standard experiments of gravitationally induced entanglement (GIE), we find that entanglement can be generated if and only if the particles are separated by a distance smaller than some limiting value $d_c$, proportional to the only free parameter of the DP model. Greater distances can be achieved through new experimental configurations, where the initial wave functions of the particles are allowed to spread perpendicularly to the separation axis. Although the DP dynamics asymptotically drives the system to a separable state, we observe that, for reasonable experimental parameters, GIE can survive for more than a day. Our results therefore imply that GIE detection is not enough to validate quantum gravity. Experimental tests of GIE dynamics have nonetheless the potential to falsify the DP model.

quant-ph↗

arXiv2025

Practical Advantage of Classical Communication in Entanglement Detection

Entanglement is the cornerstone of quantum communication, yet conventional detection relies solely on local measurements. In this work, we present a unified theoretical and experimental framework demonstrating that one-way local operations and classical communication (1-LOCC) can significantly outperform purely local measurements in detecting high-dimensional quantum entanglement. By casting the entanglement detection problem as a semidefinite program (SDP), we derive protocols that minimize false negatives at fixed false-positive rates. A variational generative machine-learning algorithm efficiently searches over high-dimensional parameter spaces, identifying states and measurement strategies that exhibit a clear 1-LOCC advantage. Experimentally, we realize a genuine event-ready protocol on a three-dimensional photonic entanglement source, employing fiber delays as short-lived quantum memories. We implement rapid, FPGA-based sampling of the optimized probabilistic instructions, allowing Bob's measurement settings to adapt to Alice's outcomes in real time. Our results validate the predicted 1-LOCC advantage in a realistic noisy setting and reduce the experimental trials needed to certify entanglement. These findings mark a step toward scalable, adaptive entanglement detection methods crucial for quantum networks and computing, paving the way for more efficient generation and verification of high-dimensional entangled states.

quant-ph↗

arXiv2024

Lower Bounding Ground-State Energies of Local Hamiltonians Through the Renormalization Group

Given a renormalization scheme, we show how to formulate a tractable convex relaxation of the set of feasible local density matrices of a many-body quantum system. The relaxation is obtained by introducing a hierarchy of constraints between the reduced states of ever-growing sets of lattice sites. The coarse-graining maps of the underlying renormalization procedure serve to eliminate a vast number of those constraints, such that the remaining ones can be enforced with reasonable computational means. This can be used to obtain rigorous lower bounds on the ground state energy of arbitrary local Hamiltonians, by performing a linear optimization over the resulting convex relaxation of reduced quantum states. The quality of the bounds crucially depends on the particular renormalization scheme, which must be tailored to the target Hamiltonian. We apply our method to 1D translation-invariant spin models, obtaining energy bounds comparable to those attained by optimizing over locally translation-invariant states of $n\gtrsim 100$ spins. Beyond this demonstration, the general method can be applied to a wide range of other problems, such as spin systems in higher spatial dimensions, electronic structure problems, and various other many-body optimization problems, such as entanglement and nonlocality detection.

quant-ph↗

arXiv2023

Quantum key distribution rates from semidefinite programming

Computing the key rate in quantum key distribution (QKD) protocols is a long standing challenge. Analytical methods are limited to a handful of protocols with highly symmetric measurement bases. Numerical methods can handle arbitrary measurement bases, but either use the min-entropy, which gives a loose lower bound to the von Neumann entropy, or rely on cumbersome dedicated algorithms. Based on a recently discovered semidefinite programming (SDP) hierarchy converging to the conditional von Neumann entropy, used for computing the asymptotic key rates in the device independent case, we introduce an SDP hierarchy that converges to the asymptotic secret key rate in the case of characterised devices. The resulting algorithm is efficient, easy to implement and easy to use. We illustrate its performance by recovering known bounds on the key rate and extending high-dimensional QKD protocols to previously intractable cases. We also use it to reanalyse experimental data to demonstrate how higher key rates can be achieved when the full statistics are taken into account.

quant-ph↗

arXiv2022

Contextuality in infinite one-dimensional translation-invariant local Hamiltonians: strengths and limits

In recent years there has been a growing interest in treating many-body systems as Bell scenarios, where lattice sites play the role of distant parties and only near-neighbor statistics are accessible. We investigate contextuality arising from three Bell scenarios in infinite, translation-invariant 1D models: nearest-neighbor with two dichotomic observables per site; nearest- and next-to-nearest neighbor with two dichotomic observables per site and nearest-neighbor with three dichotomic observables per site. For the first scenario, we give strong evidence that it cannot exhibit contextuality, not even in non-signaling physical theories beyond quantum mechanics. For the second one, we identify several low-dimensional models that reach the ultimate quantum limits, paving the way for self-testing ground states of quantum many-body systems. For the last scenario, which generalizes the Heisenberg model, we give strong evidence that, in order to exhibit contextuality, the dimension of the local quantum system must be at least 3.

quant-ph↗

arXiv2022

A universal quantum rewinding protocol with an arbitrarily high probability of success

We present a universal mechanism that, acting on any target qubit, propagates it to the state it had T time units before the experiment started. This protocol works by setting the target on a superposition of flight paths, where it is acted on by uncharacterized, but repeatable, quantum operations. Independently of the effect of each of these individual operations on the target, the successful interference of the paths causes it to leap to its past state. We prove that, for generic interaction effects, the system will reach the desired state with probability 1 after some finite number of steps.

quant-ph↗

arXiv2022

Demonstration of universal time-reversal for quantum processes

Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however the question of how to revert an unknown time evolution nevertheless remains. Remarkably, there have been several recent demonstrations of protocols for reverting unknown unitaries in scenarios where even the interactions with the target system are unknown. The practical use of these universal rewinding protocols is limited by their probabilistic nature, raising the fundamental question of whether time-reversal could be performed deterministically. Here we show that quantum physics indeed allows for deterministic universal time-reversal by exploiting the non-commuting nature of quantum operators, and demonstrate a recursive protocol for two-level quantum systems with an arbitrarily high probability of success. Using a photonic platform we demonstrate our protocol, reverting the discrete time evolution of a polarization state with an average state fidelity of over 95%. Our protocol, requiring no knowledge of the quantum process to be rewound, is optimal in its running time, and brings quantum rewinding into a regime of practical relevance.

quant-ph↗

arXiv2021

Testing real quantum theory in an optical quantum network

Quantum theory is commonly formulated in complex Hilbert spaces. However, the question of whether complex numbers need to be given a fundamental role in the theory has been debated since its pioneering days. Recently it has been shown that tests in the spirit of a Bell inequality can reveal quantum predictions in entanglement swapping scenarios that cannot be modelled by the natural real-number analog of standard quantum theory. Here, we tailor such tests for implementation in state-of-the-art photonic systems. We experimentally demonstrate quantum correlations in a network of three parties and two independent EPR sources that violate the constraints of real quantum theory by over $4.5$ standard deviations, hence disproving real quantum theory as a universal physical theory.

quant-ph↗

arXiv2021

Optimized detection of high-dimensional entanglement

Entanglement detection is one of the most conventional tasks in quantum information processing. While most experimental demonstrations of high-dimensional entanglement rely on fidelity-based witnesses, these are powerless to detect entanglement within a large class of entangled quantum states, the so-called unfaithful states. In this paper, we introduce a highly flexible automated method to construct optimal tests for entanglement detection given a bipartite target state of arbitrary dimension, faithful or unfaithful, and a set of local measurement operators. By restricting the number or complexity of the considered measurement settings, our method outputs the most convenient protocol which can be implemented using a wide range of experimental techniques such as photons, superconducting qudits, cold atoms or trapped ions. With an experimental quantum optics setup that can prepare and measure arbitrary high-dimensional mixed states, we implement some $3$-setting protocols generated by our method. These protocols allow us to experimentally certify 2- and 3-unfaithful entanglement in 4-dimensional photonic states, some of which contain well above 50% of noise.

quant-ph↗

arXiv2020

Entanglement Detection Beyond Measuring Fidelities

One of the most widespread methods to determine if a quantum state is entangled, or to quantify its entanglement dimensionality, is by measuring its fidelity with respect to a pure state. In this Letter we find a large class of states whose entanglement cannot be detected in this manner; we call them unfaithful. We find that unfaithful states are ubiquitous in information theory. For small dimensions, we check numerically that most bipartite states are both entangled and unfaithful. Similarly, numerical searches in low dimensions show that most pure entangled states remain entangled but become unfaithful when a certain amount of white noise is added. We also find that faithfulness can be self-activated, i.e., there exist instances of unfaithful states whose tensor powers are faithful. To explore how the fidelity approach limits the quantification of entanglement dimensionality, we generalize the notion of an unfaithful state to that of a D-unfaithful state, one that cannot be certified as D-dimensionally entangled by measuring its fidelity with respect to a pure state. For describing such states, we additionally introduce a hierarchy of semidefinite programming relaxations that fully characterizes the set of states of Schmidt rank at most D.

quant-ph↗

arXiv2020

A purification postulate for quantum mechanics with indefinite causal order

To study which are the most general causal structures which are compatible with local quantum mechanics, Oreshkov et al. introduced the notion of a process: a resource shared between some parties that allows for quantum communication between them without a predetermined causal order. These processes can be used to perform several tasks that are impossible in standard quantum mechanics: they allow for the violation of causal inequalities, and provide an advantage for computational and communication complexity. Nonetheless, no process that can be used to violate a causal inequality is known to be physically implementable. There is therefore considerable interest in determining which processes are physical and which are just mathematical artefacts of the framework. Here we make the first step in this direction, by proposing a purification postulate: processes are physical only if they are purifiable. We derive necessary conditions for a process to be purifiable, and show that several known processes do not satisfy them.

quant-ph↗

arXiv2018

Two Dimensional Translation-Invariant Probability Distributions: Approximations, Characterizations and No-Go Theorems

We study the properties of the set of marginal distributions of infinite translation-invariant systems in the 2D square lattice. In cases where the local variables can only take a small number $d$ of possible values, we completely solve the marginal or membership problem for nearest-neighbors distributions ($d=2,3$) and nearest and next-to-nearest neighbors distributions ($d=2$). Remarkably, all these sets form convex polytopes in probability space. This allows us to devise an algorithm to compute the minimum energy per site of any TI Hamiltonian in these scenarios exactly. We also devise a simple algorithm to approximate the minimum energy per site up to arbitrary accuracy for the cases not covered above. For variables of a higher (but finite) dimensionality, we prove two no-go results. To begin, the exact computation of the energy per site of arbitrary TI Hamiltonians with only nearest-neighbor interactions is an undecidable problem. In addition, in scenarios with $d\geq 2947$, the boundary of the set of nearest-neighbor marginal distributions contains both flat and smoothly curved surfaces and the set itself is not semi-algebraic. This implies, in particular, that it cannot be characterized via semidefinite programming, even if we allow the input of the program to include polynomials of nearest-neighbor probabilities.

math-ph↗

arXiv2018

Almost quantum correlations violate the no-restriction hypothesis

To identify which principles characterize quantum correlations, it is essential to understand in which sense this set of correlations differs from that of almost quantum correlations. We solve this problem by invoking the so-called no-restriction hypothesis, an explicit and natural axiom in many reconstructions of quantum theory stating that the set of possible measurements is the dual of the set of states. We prove that, contrary to quantum correlations, no generalised probabilistic theory satisfying the no-restriction hypothesis is able to reproduce the set of almost quantum correlations. Therefore, any theory whose correlations are exactly, or very close to, the almost quantum correlations necessarily requires a rule limiting the possible measurements. Our results suggest that the no-restriction hypothesis may play a fundamental role in singling out the set of quantum correlations among other non-signalling ones.

quant-ph↗

arXiv2017

Entanglement and Nonlocality in Infinite 1D Systems

We consider the problem of detecting entanglement and nonlocality in one-dimensional (1D) infinite, translation-invariant (TI) systems when just near-neighbor information is available. This issue is deeper than one might think a priori, since, as we show, there exist instances of local separable states (classical boxes) which admit only entangled (nonclassical) TI extensions. We provide a simple characterization of the set of local states of multiseparable TI spin chains and construct a family of linear witnesses which can detect entanglement in infinite TI states from the nearest-neighbor reduced density matrix. Similarly, we prove that the set of classical TI boxes forms a polytope and devise a general procedure to generate all Bell inequalities which characterize it. Using an algorithm based on matrix product states, we show how some of them can be violated by distant parties conducting identical measurements on an infinite TI quantum state. All our results can be easily adapted to detect entanglement and nonlocality in large (finite, not TI) 1D condensed matter systems.

quant-ph↗