English
Related papers

Related papers: How many copies are needed for state discriminatio…

200 papers

In applied settings, tests of hypothesis where a nuisance parameter is only identifiable under the alternative often reduces into one of Testing One Hypothesis Multiple times (TOHM). Specifically, a fine discretization of the space of the…

Methodology · Statistics 2022-04-06 Sara Algeri , David A. van Dyk

Let $(f_n)_{n=1}^{\infty}$ be a sequence of polynomials and $\alpha>1$. In this paper we study the distribution of the sequence $(f_n(\alpha))_{n=1}^{\infty}$ modulo one. We give sufficient conditions for a sequence $(f_n)_{n=1}^{\infty}$…

Number Theory · Mathematics 2020-03-05 Simon Baker

Determining an unknown quantum state from an ensemble of identical systems is a fundamental, yet experimentally demanding, task in quantum science. Here we study the number of measurement bases needed to fully characterize an arbitrary…

Quantum Physics · Physics 2019-02-11 Leonardo Banchi , W. Steven Kolthammer , M. S. Kim

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

Combinatorics · Mathematics 2022-11-23 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

Quantum state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs.The simplest case, when the N given states are…

Quantum Physics · Physics 2009-11-11 Janos A. Bergou , Mark Hillery

We consider asymptotic hypothesis testing (or state discrimination with asymmetric treatment of errors) between an arbitrary fixed bipartite pure state $\ket{\Psi}$ and the completely mixed state under one-way LOCC (local operations and…

Quantum Physics · Physics 2024-09-10 Masahito Hayashi , Masaki Owari

We analyze the possible results of the most general measurement on two copies of a quantum state. We show that $\mu$ can label a set of outcomes of such measurement if and only if there is a family of completely co--positive (ccP) maps…

Quantum Physics · Physics 2009-04-24 Ariel Bendersky , Juan Pablo Paz , Marcelo Terra Cunha

Consider an ensemble of pure quantum states |\psi_j>, j=1,...,n taken with prior probabilities p_j respectively. We show that it is possible to increase all of the pairwise overlaps |<\psi_i|\psi_j>| i.e. make each constituent pair of the…

Quantum Physics · Physics 2009-10-31 Richard Jozsa , Juergen Schlienz

A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently…

Computational Geometry · Computer Science 2020-06-05 Olivier Devillers , Philippe Duchon , Marc Glisse , Xavier Goaoc

We consider measurements, described by a positive-operator-valued measure (POVM), whose outcome probabilities determine an arbitrary pure state of a D-dimensional quantum system. We call such a measurement a pure-state informationally…

Quantum Physics · Physics 2009-11-10 Steven T. Flammia , Andrew Silberfarb , Carlton M. Caves

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T} \cong [0,1]$ is said to exhibit Poissonian pair correlation if the local gaps behave like the gaps of a Poisson random variable, i.e. $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \#…

Number Theory · Mathematics 2017-11-08 Stefan Steinerberger

We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…

Quantum Physics · Physics 2025-07-25 Marcel Hinsche , Jonas Helsen

The steady state of the Fokker-Planck equation corresponding to a density dependent one-step process is approximated by a suitable normal distribution. Starting from the master equations of the process, written in terms of the time…

Dynamical Systems · Mathematics 2016-09-16 Peter L. Simon , Eszter Sikolya

This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same…

Probability · Mathematics 2010-07-27 Anna Pósfai

We consider the problem of testing distribution identity. Given a sequence of independent samples from an unknown distribution on a domain of size n, the goal is to check if the unknown distribution approximately equals a known distribution…

Data Structures and Algorithms · Computer Science 2009-10-20 Krzysztof Onak

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

Computational Geometry · Computer Science 2025-09-05 Mikkel Abrahamsen , Jack Stade , Shuyi Yan , Hanwen Zhang

Using operator semigroup methods, we show that Fokker-Planck type second-order PDE-s can be used to approximate the evolution of the distribution of a one-step process on $N$ particles governed by a large system of ODEs. The error bound is…

Functional Analysis · Mathematics 2016-12-30 Dávid Kunszenti-Kovács

I construct a POVM which has 2d rank-one elements and which is informationally complete for generic pure states in d dimensions, thus confirming a conjecture made by Flammia, Silberfarb, and Caves (quant-ph/0404137). I show that if a…

Quantum Physics · Physics 2009-11-10 J. Finkelstein

We show that in the case of unknown {\em harmonic oscillator coherent states} it is possible to achieve what we call {\it perfect information cloning}. By this we mean that it is still possible to make arbitrary number of copies of a state…

Quantum Physics · Physics 2007-05-23 N. D. Hari Dass , Pradeep Ganesh

Several Artificial Intelligence schemes for reasoning under uncertainty explore either explicitly or implicitly asymmetries among probabilities of various states of their uncertain domain models. Even though the correct working of these…

Artificial Intelligence · Computer Science 2013-02-28 Marek J. Druzdzel