Explore the vast range of titles available.

Twenty-five years after the invention of quantum teleportation, the concept of entanglement gained enormous popularity. This is especially nice to those who remember that entanglement was not even taught at universities until the 1990s. Today, entanglement is often presented as a resource, the resource of quantum information science and technology. However, entanglement is exploited twice in quantum teleportation. Firstly, entanglement is the “quantum teleportation channel”, i.e., entanglement between distant systems. Second, entanglement appears in the eigenvectors of the joint measurement that Alice, the sender, has to perform jointly on the quantum state to be teleported and her half of the “quantum teleportation channel”, i.e., entanglement enabling entirely new kinds of quantum measurements. I emphasize how poorly this second kind of entanglement is understood. In particular, I use quantum networks in which each party connected to several nodes performs a joint measurement to illustrate that the quantumness of such joint measurements remains elusive, escaping today’s available tools to detect and quantify it.

Physics is formulated in terms of timeless, axiomatic mathematics. A formulation on the basis of intuitionist mathematics, built on time-evolving processes, would offer a perspective that is closer to our experience of physical reality.

It is usual to identify initial conditions of classical dynamical systems with mathematical real numbers. However, almost all real numbers contain an infinite amount of information. I argue that a finite volume of space can’t contain more than a finite amount of information, hence that the mathematical real numbers are not physically relevant. Moreover, a better terminology for the so-called real numbers is “random numbers”, as their series of bits are truly random. I propose an alternative classical mechanics, which is empirically equivalent to classical mechanics, but uses only finite-information numbers. This alternative classical mechanics is non-deterministic, despite the use of deterministic equations, in a way similar to quantum theory. Interestingly, both alternative classical mechanics and quantum theories can be supplemented by additional variables in such a way that the supplemented theory is deterministic. Most physicists straightforwardly supplement classical theory with real numbers to which they attribute physical existence, while most physicists reject Bohmian mechanics as supplemented quantum theory, arguing that Bohmian positions have no physical reality.

Most physics theories are deterministic, with the notable exception of quantum mechanics which, however, comes plagued by the so-called measurement problem. This state of affairs might well be due to the inability of standard mathematics to “speak” of indeterminism, its inability to present us a worldview in which new information is created as time passes. In such a case, scientific determinism would only be an illusion due to the timeless mathematical language scientists use. To investigate this possibility it is necessary to develop an alternative mathematical language that is both powerful enough to allow scientists to compute predictions and compatible with indeterminism and the passage of time. We suggest that intuitionistic mathematics provides such a language and we illustrate it in simple terms.

An amendment to this paper has been published and can be accessed via a link at the top of the paper.

The possibility of Bell inequality violations in quantum theory had a profound impact on our understanding of the correlations that can be shared by distant parties. Generalizing the concept of Bell nonlocality to networks leads to novel forms of correlations, the characterization of which is, however, challenging. Here, we investigate constraints on correlations in networks under the natural assumptions of no-signaling and independence of the sources. We consider the triangle network with binary outputs, and derive strong constraints on correlations even though the parties receive no input, i.e., each party performs a fixed measurement. We show that some of these constraints are tight, by constructing explicit local models (i.e. where sources distribute classical variables) that can saturate them. However, we also observe that other constraints can apparently not be saturated by local models, which opens the possibility of having nonlocal (but non-signaling) correlations in the triangle network with binary outputs. The no-signaling principle constrains which multipartite correlations are allowed, but network scenarios considered so far were limited to specific cases. Here, the authors apply inflation technique to the no-input/binary-output triangle network, and show that it admits non-trilocal distributions.

In Bohmian mechanics, particles follow continuous trajectories, so two-time position correlations have been well defined. However, Bohmian mechanics predicts the violation of Bell inequalities. Motivated by this fact, we investigate position measurements in Bohmian mechanics by coupling the particles to macroscopic pointers. This explains the violation of Bell inequalities despite two-time position correlations. We relate this fact to so-called surrealistic trajectories that, in our model, correspond to slowly moving pointers. Next, we emphasize that Bohmian mechanics, which does not distinguish between microscopic and macroscopic systems, implies that the quantum weirdness of quantum physics also shows up at the macro-scale. Finally, we discuss the fact that Bohmian mechanics is attractive to philosophers but not so much to physicists and argue that the Bohmian community is responsible for the latter.

Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M , of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asymptotically, for unrealistically large values of M . Another challenge is that most security proofs are very sensitive to small differences between the physical devices used by the protocol and the theoretical model used to describe them. Here we show that these gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies. Although they offer significant promise, practical implementations of quantum key distribution are often not as rigorous as theory predicts. This study demonstrates how two instances of such discrepancies can be resolved by taking advantage of an enotropic formulation of the uncertainty principle.

Increasingly sophisticated quantum computers motivate the exploration of their abilities in certifying genuine quantum phenomena. Here, we demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired by quantum networks. Our experiments feature up to 12 qubits and require the implementation of paradigmatic Bell-State Measurements for scalable entanglement-swapping. First, we demonstrate quantum correlations that defy classical models in up to nine-qubit systems while only assuming that the quantum computer operates on qubits. Harvesting these quantum advantages, we are able to certify 82 basis elements as entangled in a 512-outcome measurement. Then, we relax the qubit assumption and consider quantum nonlocality in a scenario with multiple independent entangled states arranged in a star configuration. We report quantum violations of source-independent Bell inequalities for up to ten qubits. Our results demonstrate the ability of quantum computers to outperform classical limitations and certify scalable entangled measurements.

Characterizing quantum nonlocality in networks is a challenging, but important problem. Using quantum sources one can achieve distributions which are unattainable classically. A key point in investigations is to decide whether an observed probability distribution can be reproduced using only classical resources. This causal inference task is challenging even for simple networks, both analytically and using standard numerical techniques. We propose to use neural networks as numerical tools to overcome these challenges, by learning the classical strategies required to reproduce a distribution. As such, a neural network acts as an oracle for an observed behavior, demonstrating that it is classical if it can be learned. We apply our method to several examples in the triangle configuration. After demonstrating that the method is consistent with previously known results, we give solid evidence that a quantum distribution recently proposed by Gisin is indeed nonlocal as conjectured. Finally we examine the genuinely nonlocal distribution recently presented by Renou et al., and, guided by the findings of the neural network, conjecture nonlocality in a new range of parameters in these distributions. The method allows us to get an estimate on the noise robustness of all examined distributions.