相关论文: How many copies are needed for state discriminatio…

Suppose we have an n-qubit system, and we are given a collection of local density matrices rho_1,...,rho_m, where each rho_i describes some subset of the qubits. We say that rho_1,...,rho_m are "consistent" if there exists a global state…

We formulate an algorithm to lower bound the fidelity between quantum many-body states only from partial information, such as the one accessible by few-body observables. Our method is especially tailored to permutationally invariant states,…

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…

A necessary condition is given for a sequence of identically distributed and pairwise positively quadrant dependent random variables obeying the strong laws of large numbers with respect to the normalising constants $n^{1/p}$ $(1 \leqslant…

Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…

A central task in quantum information science is state certification: testing whether an unknown state is $\epsilon_1$-close to a fixed target state, or $\epsilon_2$-far. Recent work has shown that surprisingly simple measurement…

We study the single-choice Prophet Inequality problem when the gambler is given access to samples. We show that the optimal competitive ratio of $1/2$ can be achieved with a single sample from each distribution. When the distributions are…

We discuss an expansion of the detection probabilities of biphoton states in terms of increasing orders of the joint spectral amplitude. The expansion enables efficient time- or frequency-resolved numerical simulations involving quantum…

Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…

Gaussian states are ubiquitous in quantum optics and information processing, and it is essential to have effective tools for their characterization. One such tool is a photon-number-resolving detector, and the simplest configuration…

A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $\epsilon,n,\eta$ be the energy gap, the system size, and the desired precision, respectively.…

We consider the problem of discrimination between two pure quantum states. It is well known that the optimal measurement under both the error-probability and log-loss criteria is a projection, while under an ``erasure-distortion'' criterion…

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

We present a criterion of separability for arbitrary s partitions of N-particle fermionic pure states. We show that, despite the superficial non-factorizability due to the antisymmetry required by the indistinguishability of the particles,…

In this article, we revisit the century-old question of the minimal set of observables needed to identify a quantum state: here, we replace the natural coincidences in their spectra by effective ones, induced by an imperfect measurement. We…

As quantum devices scale, quantifying how close an experimental state aligns with a target becomes both vital and challenging. Fidelity is the standard metric, but existing estimators either require full tomography or apply only to…

We calculate the 1/N corrections to the probability distributions of quadratic discrepancies for sets of N random points. This is achieved by the introduction of fermionic variables. We give the diagrammatic expansion up to and including…

In this paper, we propose a probabilistic algorithm suitable for any linear code $C$ to determine whether a given vector $\mathbf{x}$ belongs to $ C$. The algorithm achieves $O(n\log n)$ time complexity, $ O(n^2)$ space complexity and with…

A deterministic sequence of real numbers in the unit interval is called \emph{equidistributed} if its empirical distribution converges to the uniform distribution. Furthermore, the limit distribution of the pair correlation statistics of a…

An adaptive method for quantum state fidelity estimation in bipartite higher dimensional systems is established. This method employs state verifier operators which are constructed by local POVM operators and adapted to the measurement…