Search arXivSearch

arXiv · 1611.06781

Relativistic Causality vs. No-Signaling as the limiting paradigm for correlations in physical theories

Abstract

The no-signaling constraints state that the probability distribution of the outputs of any subset of parties is independent of the inputs of the complementary set; here we re-examine these to see how they arise from relativistic causality. We show that while the usual no-signaling constraints are sufficient, in general they are not necessary to ensure that a theory does not violate causality. Depending on the exact space-time coordinates of the measurement events in a multi-party Bell experiment, causality only imposes a subset of the usual no-signaling conditions. After revisiting the derivation of the two-party no-signaling constraints, we consider the three-party Bell scenario and characterise a space-time region in which a subset of the no-signaling conditions is sufficient to preserve causality. Secondly, we examine the implications for device-independent cryptography against an eavesdropper constrained only by the laws of relativity. We show an explicit attack in certain measurement configurations on a family of protocols based on the n-party Mermin inequalities that were previously proven secure under the old no-signaling conditions. We then show that security of two-party protocols can also be compromised when the eavesdropper's measurement configuration is not constrained. The monogamy of non-local correlations that underpin their use in secrecy can also be broken in certain space-time configurations. Thirdly, we inspect the notion of free-choice and propose a definition of free-choice in the multi-party Bell experiment. We then re-examine the question whether quantum correlations may admit explanations by finite speed superluminal influences. Finally, we study genuine multiparty non-locality and present a new class of causal bilocal models. We propose a new Svetlichny-type inequality that is satisfied by the causal bilocal model and show its violation within quantum theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paweł Horodecki, Ravishankar Ramanathan. 2016-11-21. Relativistic Causality vs. No-Signaling as the limiting paradigm for correlations in physical theories. https://arxiv.org/abs/1611.06781

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph