It is found that identical bosons (fermions) show a generalized bunching (antibunching) property in linear networks: the absolute maximum (minimum) of the probability that all N input particles are detected in a subset of K output modes of any nontrivial linear M-mode network is attained only by completely indistinguishable bosons (fermions). For fermions K is arbitrary; for bosons it is either...

In a series of recent papers, Simon Saunders, Fred Muller and Michael Seevinck have collectively argued, against the folklore, that some non-trivial version of Leibniz’s principle of the identity of indiscernibles is upheld in quantum mechanics. They argue that all particles—fermions, paraparticles, anyons, even bosons—may be weakly discerned by some physical relation. Here I show that their ar...

A garbling scheme is used to garble a circuit C and an input x in a way that reveals the output C(x) but hides everything else. An adaptively secure scheme allows the adversary to specify the input x after seeing the garbled circuit. Applebaum et al. (CRYPTO ’13) showed that in any garbling scheme with adaptive simulation-based security, the size of the garbled input must exceed the output size...

We show that a number of graph invariants are, even combined, insufficient to distinguish between nonisomorphic trees or general graphs. Among these are: the spectrum of eigenvalues (equivalently, the characteristic polynomial), the number of independent sets of all sizes or the number of connected subgraphs of all sizes. We therefore extend the classical theorem of Schwenk that almost every tr...

The main aim of this paper is to characterize the set of states indistinguishable from a given state of a general nonlinear input-affine control system with complete and smooth vector fields and smooth output functions. For this purpose, we introduce the extended observation space, and show that the set of states indistinguishable from a given state is the intersection of level sets containing ...