arXiv subjects

Bar Y. Peled

Publications and source records attributed to Bar Y. Peled.

8 recordsLinked to original sources

arXiv2023

Multipartite Entanglement Detection via Correlation Minor Norm

Entanglement is a uniquely quantum resource giving rise to many quantum technologies. It is therefore important to detect and characterize entangled states, but this is known to be a challenging task, especially for multipartite mixed states. The correlation minor norm (CMN) was recently suggested as a bipartite entanglement detector employing bounds on the quantum correlation matrix. In this paper we explore generalizations of the CMN to multipartite systems based on matricizations of the correlation tensor. It is shown that the CMN is able to detect and differentiate classes of multipartite entangled states. We further analyze the correlations within the reduced density matrices and show their significance for entanglement detection. Finally, we employ matricizations of the correlation tensor for introducing a measure of global quantum discord.

quant-ph↗

arXiv2022

Non-inertial quantum clock frames lead to non-Hermitian dynamics

The operational approach to time is a cornerstone of relativistic theories, as evidenced by the notion of proper time. In standard quantum mechanics, however, time is an external parameter. Recently, many attempts have been made to extend the notion of proper time to quantum mechanics within a relational framework. Here, we use similar ideas combined with the relativistic mass-energy equivalence to study an accelerating massive quantum particle with an internal clock system. We show that the ensuing evolution from the perspective of the particle's internal clock is non-Hermitian. This result does not rely on specific implementations of the clock. As a particular consequence, we prove that the effective Hamiltonian of two gravitationally interacting particles is non-Hermitian from the perspective of the clock of either particle.

quant-ph↗

arXiv2022

Study of entanglement via a multi-agent dynamical quantum game

At both conceptual and applied levels, quantum physics provides new opportunities as well as fundamental limitations. We hypothetically ask whether quantum games inspired by population dynamics can benefit from unique features of quantum mechanics such as entanglement and nonlocality. For doing so we extend quantum game theory and demonstrate that in certain models mimicking ecological systems where several predators feed on the same prey, the strength of quantum entanglement between the various species has a profound effect on the asymptotic behavior of the system. For example, if there are sufficiently many predator species who are all equally correlated with their prey, they are all driven to extinction. Our results are derived in two ways: by analyzing the asymptotic dynamics of the system, and also by modeling the system as a quantum correlation network. The latter approach enables us to apply various tools from classical network theory in the above quantum scenarios. Several generalizations and applications are discussed.

quant-ph↗

arXiv2020

Correlation Minor Norms, Entanglement Detection and Discord

In this paper we develop an approach for detecting entanglement, which is based on measuring quantum correlations and constructing a correlation matrix. The correlation matrix is then used for defining a family of parameters, named Correlation Minor Norms, which allow one to detect entanglement. This approach generalizes the computable cross-norm or realignment (CCNR) criterion, and moreover requires measuring a state-independent set of operators. Furthermore, we illustrate a scheme which yields for each Correlation Minor Norm a separable state that maximizes it. The proposed entanglement detection scheme is believed to be advantageous in comparison to other methods because correlations have a simple, intuitive meaning and in addition they can be directly measured in experiment. Moreover, it is demonstrated to be stronger than the CCNR criterion. We also illustrate the relation between the Correlation Minor Norm and entanglement entropy for pure states. Finally, we discuss the relation between the Correlation Minor Norm and quantum discord. We demonstrate that the CMN may be used to define a new measure for quantum discord.

quant-ph↗

arXiv2020

Experimental tests of Multiplicative Bell Inequalities

Bell inequalities are mathematical constructs that demarcate the boundary between quantum and classical physics. A new class of multiplicative Bell inequalities originating from a volume maximization game (based on products of correlators within bipartite systems) has been recently proposed. For these new Bell parameters, it is relatively easy to find the classical and quantum, i.e. Tsirelson, limits. Here, we experimentally test the Tsirelson bounds of these inequalities using polarisation-entangled photons for different number of measurements ($n$), each party can perform. For $n=2, 3, 4$, we report the experimental violation of local hidden variable theories. In addition, we experimentally compare the results with the parameters obtained from a fully deterministic strategy, and observe the conjectured nature of the ratio. Finally, utilizing the principle of "relativistic independence" encapsulating the locality of uncertainty relations, we theoretically derive and experimentally test new richer bounds for both the multiplicative and the additive Bell parameters for $n=2$. Our findings strengthen the correspondence between local and nonlocal correlations, and may pave the way for empirical tests of quantum mechanical bounds with inefficient detection systems.

quant-ph↗

arXiv2020

Double Slit with an Einstein-Podolsky-Rosen Pair

In this somewhat pedagogical paper we revisit complementarity relations in bipartite quantum systems. Focusing on continuous variable systems, we examine the influential class of EPR-like states through a generalization to Gaussian states and present some new quantitative relations between entanglement and local interference within symmetric and asymmetric double-double-slit scenarios. This approach is then related to ancilla-based quantum measurements, and weak measurements in particular. Finally, we tie up the notions of distinguishability, predictability, coherence and visibility while drawing some specific connections between them.

quant-ph↗

arXiv2019

Multiplicative Bell Inequalities

Bell inequalities are important tools in contrasting classical and quantum behaviors. To date, most Bell inequalities are linear combinations of statistical correlations between remote parties. Nevertheless, finding the classical and quantum mechanical (Tsirelson) bounds for a given Bell inequality in a general scenario is a difficult task which rarely leads to closed-form solutions. Here we introduce a new class of Bell inequalities based on products of correlators that alleviate these issues. Each such Bell inequality is associated with a unique coordination game. In the simplest case, Alice and Bob, each having two random variables, attempt to maximize the area of a rectangle and the rectangle's area is represented by a certain parameter. This parameter, which is a function of the correlations between their random variables, is shown to be a Bell parameter, i.e. the achievable bound using only classical correlations is strictly smaller than the achievable bound using non-local quantum correlations We continue by generalizing to the case in which Alice and Bob, each having now n random variables, wish to maximize a certain volume in n-dimensional space. We term this parameter a multiplicative Bell parameter and prove its Tsirelson bound. Finally, we investigate the case of local hidden variables and show that for any deterministic strategy of one of the players the Bell parameter is a harmonic function whose maximum approaches the Tsirelson bound as the number of measurement devices increases. Some theoretical and experimental implications of these results are discussed.

quant-ph↗

arXiv2017

Computing by nowhere increasing complexity

A cellular automaton is presented whose governing rule is that the Kolmogorov complexity of a cell's neighborhood may not increase when the cell's present value is substituted for its future value. Using an approximation of this two-dimensional Kolmogorov complexity the underlying automaton is shown to be capable of simulating logic circuits. It is also shown to capture trianry logic described by a quandle, a non-associative algebraic structure. A similar automaton whose rule permits at times the increase of a cell's neighborhood complexity is shown to produce animated entities which can be used as information carriers akin to gliders in Conway's game of life.

cs.IT↗