Searcharxiv⌕ Search

arXiv subjects

Aleksandra Dimić

Publications and source records attributed to Aleksandra Dimić.

5 recordsLinked to original sources

Simulating indefinite causal order with Rindler observers

Realization of indefinite causal order (ICO), a theoretical possibility that even causal relations between physical events can be subjected to quantum superposition, apart from its general significance for the fundamental physics research, would also enable quantum information processing that outperforms protocols in which the underlying causal structure is definite. In this paper, we start with a proposition that an observer in a state of quantum superposition of being at two different relative distances from the event horizon of a black hole, effectively resides in ICO space-time generated by the black hole. By invoking the fact that the near-horizon geometry of a Schwarzschild black hole is that of a Rindler space-time, we propose a way to simulate an observer in ICO space-time by a Rindler observer in a state of superposition of having two different proper accelerations. By extension, a pair of Rindler observers with entangled proper accelerations simulates a pair of entangled ICO observers. Moreover, these Rindler-systems might have a plausible experimental realization by means of optomechanical resonators.

quant-ph↗

On the central limit theorem for unsharp quantum random variables

In this letter we study the weak-convergence properties of random variables generated by unsharp quantum measurements. More precisely, for a sequence of random variables generated by repeated unsharp quantum measurements, we study the limit distribution of relative frequency. We provide the de Finetti-type representation theorem for all separable states, showing that the distribution can be well approximated by mixture of normal distributions. No symmetry restrictions, such as the permutational invariance were needed. Furthermore, we investigate the convergence rates and show that the relative frequency can stabilize to some constant at best at the rate of order $1/\sqrt{N}$ for all separable inputs. On the other hand, we provide an example of a strictly unsharp quantum measurement where the better rates are achieved by using entangled inputs. This means that in certain cases the noise generated by the measurement process can be suppressed by using entanglement. We deliver our result in the form of quantum information task where the player achieves the goal with certainty in the limiting case by using entangled inputs or fails with certainty by using separable inputs.

quant-ph↗

Bell's theorem for trajectories

In classical theory, the trajectory of a particle is entirely predetermined by the complete set of initial conditions via dynamical laws. Based on this, we formulate a no-go theorem for the dynamics of classical particles, i.e., a Bell's inequality for trajectories, and discuss its possible violation in a quantum scenario. A trajectory, however, is not an outcome of a quantum measurement, in the sense that there is no observable associated with it, and thus there is no "direct" experimental test of the Bell's inequality for trajectories. Nevertheless, we show how to overcome this problem by considering a special case of our generic inequality that can be experimentally tested point-by-point in time. Such inequality is indeed violated by quantum mechanics, and the violation persists during an entire interval of time and not just at a particular singular instant. We interpret the violation to imply that trajectories (or at least pieces thereof) cannot exist predetermined, within a local-realistic theory.

quant-ph↗

Experimental few-copy multi-particle entanglement detection

Quantum technologies lead to a variety of applications that outperform their classical counterparts. In order to build a quantum device it must be verified that it operates below some error threshold. Recently, because of technological developments which allow for the experimental realization of quantum states with increasing complexity, these tasks must be applied to large multi-qubit states. However, due to the exponentially-increasing system size, tasks like quantum entanglement verification become hard to carry out in such cases. Here we develop a generic framework to translate any entanglement witness into a resource-efficient probabilistic scheme. We show that the confidence to detect entanglement grows exponentially with the number of individual detection events. To benchmark our findings, we experimentally verify the presence of entanglement in a photonic six-qubit cluster state generated using three single-photon sources operating at telecommunication wavelengths. We find that its presence can be certified with at least 99.74% confidence by detecting 20 copies of the quantum state. Additionally, we show that genuine six-qubit entanglement is verified with at least 99% confidence by using 112 copies of the state. Our protocol can be carried out with a remarkably low number of copies, making it a practical and applicable method to verify large-scale quantum devices.

quant-ph↗

Single-copy entanglement detection

One of the main challenges of quantum information is the reliable verification of quantum entanglement. The conventional detection schemes require repeated measurement on a large number of identically prepared systems. This is hard to achieve in practice when dealing with large-scale entangled quantum systems. In this letter we develop a novel method by formulating verification as a decision procedure, i.e. entanglement is seen as the ability of quantum system to answer certain "yes-no questions". We show that for a variety of large quantum states even a single copy suffices to detect entanglement with a high probability by using local measurements. For example, a single copy of a $16$-qubit $k$-producible state or one copy of $24$-qubit linear cluster state suffices to verify entanglement with more than $95\%$ confidence. Our method is applicable to many important classes of states, such as cluster states or ground states of local Hamiltonians in general.

quant-ph↗