English
Related papers

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

200 papers

We describe a simple method for certifying that an experimental device prepares a desired quantum state rho. Our method is applicable to any pure state rho, and it provides an estimate of the fidelity between rho and the actual (arbitrary)…

Quantum Physics · Physics 2011-06-09 Steven T. Flammia , Yi-Kai Liu

We consider the statistical properties of photon detection with imperfect detectors that exhibit dark counts and less than unit efficiency, in the context of tomographic reconstruction. In this context, the detectors are used to implement…

Quantum Physics · Physics 2015-05-13 K. M. R. Audenaert , S. Scheel

We study the problem of tolerant testing of stabilizer states. In particular, we give the first such algorithm that accepts mixed state inputs. Formally, given a mixed state $\rho$ that either has fidelity at least $\varepsilon_1$ with some…

Quantum Physics · Physics 2025-05-13 Vishnu Iyer , Daniel Liang

In the changepoint problem, we determine when the distribution observed has changed to another one. We expand this problem to the quantum case where copies of an unknown pure state are being distributed. We study the fundamental case, which…

Quantum Physics · Physics 2011-06-24 Daiki Akimoto , Masahito Hayashi

When estimating the phase of a single mode, the quantum Fisher information for a pure probe state is proportional to the photon number variance of the probe state. In this work, we point out particular states that offer photon number…

Quantum Physics · Physics 2019-12-20 Changhyoup Lee , Changhun Oh , Hyunseok Jeong , Carsten Rockstuhl , Su-Yong Lee

State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…

Quantum Physics · Physics 2009-10-31 Anthony Chefles , Stephen M. Barnett

For two unknown mixed quantum states $\rho$ and $\sigma$ in an $N$-dimensional Hilbert space, computing their fidelity $F(\rho,\sigma)$ is a basic problem with many important applications in quantum computing and quantum information, for…

Quantum Physics · Physics 2023-01-04 Qisheng Wang , Zhicheng Zhang , Kean Chen , Ji Guan , Wang Fang , Junyi Liu , Mingsheng Ying

We show that $\Omega(rd/\epsilon)$ copies of an unknown rank-$r$, dimension-$d$ quantum mixed state are necessary in order to learn a classical description with $1 - \epsilon$ fidelity. This improves upon the tomography lower bounds…

Quantum Physics · Physics 2023-01-04 Henry Yuen

We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the state space dimension is large or both. When the OL is…

Information Theory · Computer Science 2011-04-13 Namrata Vaswani

We describe a technique for self consistently characterizing both the quantum state of a single qubit system, and the positive-operator-valued measure (POVM) that describes measurements on the system. The method works with only ten…

Quantum Physics · Physics 2021-07-28 A. Stephens , J. M. Cutshall , T. McPhee , M. Beck

The fidelity estimation between two quantum states is crucial for quantum computation and information science. However, an efficacious method for this, especially for mixed states and higher-dimensional density matrices, remains elusive.…

Quantum Physics · Physics 2026-05-11 Anumita Mukhopadhyay , Shibdas Roy , Arun Kumar Pati

We investigate a symmetric set of three quantum states in three dimensions having interesting properties, which we call the lifted trine states. We show that for the ensemble consisting of the three lifted trine states taken with equal…

Quantum Physics · Physics 2007-05-23 Peter W. Shor

It is impossible to discriminate four Bell states through local operations and classical communication (LOCC), if only one copy is provided. To complete this task, two copies will suffice and be necessary. When $n$ copies are provided, we…

Quantum Physics · Physics 2009-11-07 Yi-Xin Chen , Dong Yang

The discrimination of non-orthogonal quantum states with reduced or without errors is a fundamental task in quantum measurement theory. In this work, we investigate a quantum measurement strategy capable of discriminating two coherent…

Quantum Physics · Physics 2010-10-12 Christoffer Wittmann , Ulrik L. Andersen , Gerd Leuchs

An iterative algorithm for state determination is presented that uses as physical input the probability distributions for the eigenvalues of two or more observables in an unknown state $\Phi$. Starting form an arbitrary state $\Psi_{0}$, a…

Quantum Physics · Physics 2008-04-28 Dardo M. Goyeneche , Alberto C. de la Torre

For an $n\times n$ random image with independent pixels, black with probability $p(n)$ and white with probability $1-p(n)$, the probability of satisfying any given first-order sentence tends to 0 or 1, provided both $p(n)n^{\frac{2}{k}}$…

Probability · Mathematics 2016-08-16 David Coupier , Agnès Desolneux , Bernard Ycart

Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability…

Quantum Physics · Physics 2019-10-02 Kieran Flatt , Stephen M. Barnett , Sarah Croke

We consider the problems of testing and learning an $n$-qubit $k$-local Hamiltonian from queries to its evolution operator with respect the 2-norm of the Pauli spectrum, or equivalently, the normalized Frobenius norm. For testing whether a…

Quantum Physics · Physics 2024-04-10 Francisco Escudero Gutiérrez

We consider a protocol to perform the optimal quantum state discrimination of $N$ linearly independent non-orthogonal pure quantum states and present a computational code. Through the extension of the original Hilbert space, it is possible…

Quantum Physics · Physics 2016-09-08 Wilson R. M. Rabelo , Alexandre G. Rodrigues , Reinaldo O. Vianna

We provide an algorithm for properly learning mixtures of two single-dimensional Gaussians without any separability assumptions. Given $\tilde{O}(1/\varepsilon^2)$ samples from an unknown mixture, our algorithm outputs a mixture that is…

Data Structures and Algorithms · Computer Science 2014-05-20 Constantinos Daskalakis , Gautam Kamath