Is single-particle interference spooky?

It is said about quantum interference that "In reality, it contains the only mystery". Indeed, together with non-locality it is often considered as the characteristic feature of quantum theory which can not be explained in any classical way. In this work we are concerned with a restricted setting of a single particle propagating in multi-path interferometric circuits, that is physical realisation of a qudit. It is shown that this framework, including collapse of the wave function, can be simulated with classical resources without violating the locality principle. We present a local ontological model whose predictions are indistinguishable from the quantum case. 'Non-locality' in the model appears merely as an epistemic effect arising on the level of description by agents whose knowledge is incomplete. This result suggests that the real quantum mystery should be sought in the multi-particle behaviour, since single-particle interferometric phenomena are explicable in a classical manner.

Comments: 14 pages, 2 figures

Similar Publications

Resonant activation in temporally driven spin-boson systems subjected to strong dissipation is researched by means of both, analytical and extensive numerical investigations. The phenomenon of resonant activation emerges in the presence of either fluctuating or periodically varying driving fields. Addressing the incoherent regime, a characteristic minimum emerges in the mean first passage time (MFPT) to reach an absorbing neighboring state whenever the intrinsic time scale of the modulation matches the characteristic time scale of the system dynamics. Read More

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of $n$ nodes constituted by a time-ordered sequence of Erd\"os-R\'enyi random graphs $G(n,p)$, where $p$ is the probability that any two given nodes are connected: after every time interval $\tau$, a new graph $G(n,p)$ replaces the previous one. We prove analytically that for any given $p$, there is always a range of values of $\tau$ for which the running time of the algorithm is optimal, i. Read More

A general quantum thermodynamics network is composed of thermal devices connected to the environments through quantum wires. The coupling between the devices and the wires may introduce additional decay channels which modify the system performance with respect to the directly-coupled device. We analyze this effect in a quantum three-level device connected to a heat bath or to a work source through a two-level wire. Read More

Genuine multpartite quantum nonlocality can be quantified by the communication cost needed to reproduce the nonlocal correlation by classical communication models. This prompts the question as to how one may provide such an operational characterization for the nonclassicality of local multipartite correlations arising from genuinely quantum states possessing quantum discord. To answer this question, we consider a classical simulation protocol where one of the parties pre-share a random variable with the other parties who may also share arbitrary randomness. Read More

In this paper we study the behavior of the Casimir energy of a "multi-cavity" across the transition from the metallic to the superconducting phase of the constituting plates. Our analysis is carried out in the framework of the ARCHIMEDES experiment, aiming at measuring the interaction of the electromagnetic vacuum energy with a gravitational field. For this purpose it is foreseen to modulate the Casimir energy of a layered structure composing a multy-cavity coupled system by inducing a transition from the metallic to the superconducting phase. Read More

Bri\"et et al. showed that an efficient communication protocol implies a reliable XOR game protocol. In this work, we improve this relationship, and obtain a nontrivial lower bound $2\log3\approx 3. Read More

In exactly solvable quantum mechanical systems, ladder and intertwining operators play a central role because, if they are found, the energy spectrums can be obtained algebraically. In this paper, we study such features of ladder and intertwining operators in a unified way, in which we make the operators to depend on parameters. It is shown that, when ladder operators depend on a parameter, the ordinary commutation relation for ladder operators is modified in a natural way. Read More

We consider two (natural) families of observables $O_k$ for systems with dimension $d=3,4,5$: the spin observables $S_x$, $S_y$ and $S_z$, and the observables that have mutually unbiased bases as eigenstates. We derive tight entropic uncertainty relations for these families, in the form $\sum_kH(O_k)\geqslant\alpha_d$, where $H(O_k)$ is the Shannon entropy of the measurement outcomes of $O_k$ and $\alpha_d$ is a constant. We show that most of our bounds are stronger than previously known ones. Read More

Randomized benchmarking (RB) is an efficient and robust method to characterize gate errors in quantum circuits. Averaging over random sequences of gates leads to estimates of gate errors in terms of the average fidelity that are isolated from the state preparation and measurement errors that plague other methods like channel tomography and direct fidelity estimation. A decisive factor in the feasibility of randomized benchmarking is the number of samples required to obtain rigorous confidence intervals. Read More