Related papers: The Quantum Cocktail Party Problem
This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communication and computation are available. It is proved that the leader election problem can…
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of…
Probabilistic quantum filtering is proposed to properly adapt sequential independent quantum channels in order to stop sudden death of entanglement. In the adaptation, the quantum filtering does not distill or purify more entanglement, it…
Genuineness and distillability of entanglement play a key role in quantum information tasks, and they are easily disturbed by the noise. We construct a family of multipartite states without genuine entanglement and distillability sudden…
Quantum compilation is the problem of translating an input quantum circuit into the most efficient equivalent of itself, taking into account the characteristics of the device that will execute the computation. Compilation strategies are…
Power grid partitioning is an important requirement for resilient distribution grids. Since electricity production is progressively shifted to the distribution side, dynamic identification of self-reliant grid subsets becomes crucial for…
Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical…
A numerical method is developed for recovering both the source locations and the obstacle from the scattered Cauchy data of the time-harmonic acoustic field. First of all, the incident and scattered components are decomposed from the…
In this paper we are interested to model quantum signal by statistical signal processing methods. The Gaussian distribution has been considered for the input quantum signal as Gaussian state have been proven to a type of important robust…
Data-driven prediction in quantum mechanics consists in providing an approximative description of the motion of any particles at any given time, from data that have been previously collected for a certain number of particles under the…
We study the local indistinguishability problem of quantum states. By introducing an easily calculated quantity, non-commutativity, we present an criterion which is both necessary and sufficient for the local indistinguishability of a…
The Coupon Collector Problem (CCP) is a well-known combinatorial problem that seeks to estimate the number of random draws required to complete a collection of $n$ distinct coupon types. Various generalizations of this problem have been…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose…
The advantage that many quantum algorithms have over their classical counterparts may be lost when the results are extracted as classical data (output problem). One example are eigenpair solvers, which encode the eigenpairs in a quantum…
We consider a quantum version of a well-known statistical decision problem, whose solution is, at first sight, counter-intuitive to many. In the quantum version a continuum of possible choices (rather than a finite set) has to be…
We propose a quantum key distribution scheme which closely matches the performance of a perfect single photon source. It nearly attains the physical upper bound in terms of key generation rate and maximally achievable distance. Our scheme…
We present a model to detect a classical state mixed with an idler photon from a polarization-entangled pair. A weak coherent light with a well-defined polarization, matched in wavelength to the idler photon, is injected into the idler…
We consider the task of distilling local purity from a noisy quantum state $\rho^{ABC}$, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate $P$) from many independent copies of a…