In general, for a bipartite quantum system Cd&amp;#x2297;d</mml:mat...

In this paper we give a counter example to a conjecture mentioned in Benjamini and Kesten (1996) about distinguishing sceneries by observing them along a simple random walk, giving an explicit construction of 2 @0 sceneries that are all pairwise indistinguishable.

This paper presents a new algorithm for efficiently calculating pairs of indistinguishable states in finite-state automata with partially observable transitions. The need to obtain pairs of indistinguishable states occurs in several classes of problems related to control under partial observation, diagnosis, or distributed control with communication for discrete event systems. The algorithm obt...

We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of k ≤ d orthogonal maximally entangled states in Cd ⊗ Cd that are not perfectly distinguishable by LOCC. A recent result by Yu, Duan, and Ying [Phys. Rev. Lett. 109 020506 (2012)] gives an affirmative answer for the case...

It has been shown by Judd and Smith that it is impossible to determine the state of a nonlinear dynamical system from noisy observations of the system, even with perfect knowledge of the system dynamics and unlimited prior observation. There is always a set of states indistinguishable from the true state. However, a new, simple method to assimilate data into a model and estimate the state is su...

We propose an efficient blind certification protocol with interesting properties. It falls in the Groth-Sahai framework for witness-indistinguishable proofs, thus extended to a certified signature it immediately yields non-frameable group signatures. We use blind certification to build an efficient (offline) e-cash system that guarantees user anonymity and transferability of coins without incre...