Intuitively, if objects are indistinguishable then we cannot determine their personal properties which vary among the population. Indeed, if we could reliably determine wheter an object is green or not then we could easily distinguish green objects from yellow ones. Hence, indistinguishability indirectly implies that one can reliably detect only trivial properties that either hold or do not hol...

We establish a relation between entanglement in simple quantum mechanical qubit systems and wormhole physics as considered the context of AdS/CFT correspondence. show that both cases, states with same structure, indistinguishable by any local measurement, nevertheless are characterized different Berry phase. This feature is experimentally accessible coupled where phase related unitary transform...

A long and intense debate in philosophy is concerned with the question whether there can be haecceistic differences between possible worlds, that is, nonqualitative only arise from different de re representations. According to haecceitism, it give rise a situation if positions of two qualitatively identical particles are exchanged, while according anti-haecceitism, this not case. It has been su...

We suggest a definition for a type of chimera state that appears in networks of indistinguishable phase oscillators. Defining a "weak chimera" as a type of invariant set showing partial frequency synchronization, we show that this means they cannot appear in phase oscillator networks that are either globally coupled or too small. We exhibit various networks of four, six, and ten indistinguishab...

We discuss quantum correlations in systems of indistinguishable particles in relation to entanglement in composite quantum systems consisting of well separated subsystems. Our studies are motivated by recent experiments and theoretical investigations on quantum dots and neutral atoms in microtraps as tools for quantum information processing. We present analogies between distinguishable particle...

Graph searching is one of the simplest and most widely used tools in graph algorithms. Every search method defined using some particular selection rule, analysis corresponding vertex orderings can aid greatly devising algorithms, writing proofs correctness, or recognition various families.