Related papers: Tolerant Testing of Stabilizer States with Mixed S…
Weak measurements with mixed probe states were investigated in the presence of noise in the probe system. We show that the completely mixed state can be used as a probe state for weak measurements of imaginary weak values. The completely…
We give the first super-polynomial (in fact, mildly exponential) lower bounds for tolerant testing (equivalently, distance estimation) of monotonicity, unateness, and juntas with a constant separation between the "yes" and "no" cases.…
State space models contain time-indexed parameters, termed states, as well as static parameters, simply termed parameters. The problem of inferring both static parameters as well as states simultaneously, based on time-indexed observations,…
We provide a partially affirmative answer to the following question on robustness of polynomial stability with respect to sampling: ``Suppose that a continuous-time state-feedback controller achieves the polynomial stability of the…
It is well known that different preparations of a mixed state cannot be distinguished by a measurement of that state. Yet we show that some other experiments let us make this distinction despite a very general belief that this would not be…
In this paper, we treat an asymptotic hypothesis testing (or state discrimination with asymmetric treatment of errors) between an arbitrary fixed bipartite pure state and the completely mixed state by one-way LOCC, two-way LOCC, and…
Assessing the quality of an ensemble of noisy entangled states is a central task in quantum information processing. Usually this is done by measuring and hence destroying multiple copies, from which state tomography or fidelity estimation…
Recently the problem of Unambiguous State Discrimination (USD) of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [1]. For two mixed states they are given in terms of…
We consider the possibility of using stabilizer states to perform deterministic dense coding among multiple senders and a single receiver. In the model we studied, the utilized stabilizer state is partitioned into several subsystems and…
In this paper, we present an optimal filter for linear time-varying continuous-time stochastic systems that simultaneously estimates the states and unknown inputs in an unbiased minimum-variance sense. We first show that the unknown inputs…
We employ the variational formulation and the Euler-Lagrange equations to study the steady-state error in linear non-causal estimators (smoothers). We give a complete description of the steady-state error for inputs that are polynomial in…
Physiological networks are usually made of a large number of biological oscillators evolving on a multitude of different timescales. Phase oscillators are particularly useful in the modelling of the synchronization dynamics of such systems.…
We investigate 1D and 2D cluster states under local decoherence to assess the robustness of their mixed-state subsystem symmetry-protected topological (SSPT) order. By exactly computing fidelity correlators via dimensional reduction of…
Entanglement plays an indispensable role in numerous quantum information and quantum computation tasks, underscoring the need for efficiently verifying entangled states. In recent years, quantum state verification has received increasing…
We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$-qubit pure state $|\psi\rangle$, we give an efficient algorithm that distinguishes whether…
We show how to generalize the concepts of identifying and classifying symmetry protected topological phases in 1D to the case of an arbitrary mixed state. The pure state concepts are reviewed using a concrete spin-1 model. For the mixed…
We present a loosely-stabilizing phase clock for population protocols. In the population model we are given a system of $n$ identical agents which interact in a sequence of randomly chosen pairs. Our phase clock is leaderless and it…
We make two contributions to the study of polite combination in satisfiability modulo theories. The first contribution is a separation between politeness and strong politeness, by presenting a polite theory that is not strongly polite. This…
We study stable matching problems where agents have multilayer preferences: There are $\ell$ layers each consisting of one preference relation for each agent. Recently, Chen et al. [EC '18] studied such problems with strict preferences,…
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…