Related papers: How many copies are needed for state discriminatio…
The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to…
A measurement strategy is developed for a new kind of hypothesis testing. It assigns, with minimum probability of error, the state of a quantum system to one or the other of two complementary subsets of a set of N given non-orthogonal…
A direct derivation is given for the optimal mean fidelity of quantum state estimation of a d-dimensional unknown pure state with its N copies given as input, which was first obtained by M. Hayashi in terms of an infinite set of covariant…
We present a language $L_n$ which is recognizable by a probabilistic finite automaton (PFA) with probability $1 - \epsilon$ for all $\epsilon > 0$ with $O(log^2n)$ states, with a deterministic finite automaton (DFA) with O(n) states, but a…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…
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…
We analyze the restrictions on the distinguishability of quantum states imposed by special relativity. An explicit expression relating the error probability for distinguishing between two orthogonal single-photon states with the time $T$…
Given a single copy of an n qubit quantum state |psi>, the no-cloning theorem greatly limits the amount of information which can be extracted from it. Moreover, given only a procedure which verifies the state, for example a procedure which…
The study of the entanglement properties of systems of N fermions has attracted considerable interest during the last few years. Various separability criteria for pure states of N identical fermions have been recently discussed but,…
We say that a sequence $\{x_n\}_{n \geq 1}$ in $[0,1)$ has Poissonian pair correlations if \begin{equation*} \lim_{N \rightarrow \infty} \frac{1}{N} \# \left\{ 1 \leq l \neq m \leq N \, : \, \left\lVert x_l-x_m \right\rVert < \frac{s}{N}…
In this paper I show that any $m$th-degree polynomial function of the elements of the density matrix $\rho$ can be determined by finding the expectation value of an observable on $m$ copies of $\rho$, without performing state tomography.…
By utilizing single particle interferometry, the fidelity or coherence of a pair of quantum states is identified with their capacity for interference. We consider processes acting on the internal degree of freedom (e.g., spin or…
We address the problem of estimating the phase phi given N copies of the phase rotation u(phi) within an array of quantum operations in finite dimensions. We first consider the special case where the array consists of an arbitrary input…
We study the decay of unstable states by formulating quantum tunneling as a time-of-arrival problem: we determine the detection probability for particles at a detector located a distance L from the tunneling region. For this purpose, we use…
We show that $n = \Omega(rd/\varepsilon^2)$ copies are necessary to learn a rank $r$ mixed state $\rho \in \mathbb{C}^{d \times d}$ up to error $\varepsilon$ in trace distance. This matches the upper bound of $n = O(rd/\varepsilon^2)$ from…
In this paper, we present new progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order O(1/N) is sufficient and, in general, necessary to destroy the entanglement of any state…
Two measures of fidelity are proposed for postselecting devices, the retrodictive conditional probability that the state in the measurement arm is the one indicated by the detectors, and the probability that the device produces the state…
Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task…
It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. This property ensures the security of quantum key distribution. It is therefore an important task in quantum communication to design and…
A discrimination problem consists of $N$ linearly independent pure quantum states $\Phi=\{\ket{\phi_i}\}$ and the corresponding occurrence probabilities $\eta=\{\eta_i\}$. To any such problem we associate, up to a permutation over the…