Related papers: The Quantum Cocktail Party Problem
We consider the problem of determining the weights of a quantum ensemble. That is to say, given a quantum system that is in a set of possible known states according to an unknown probability law, we give strategies to estimate the…
Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
Noisy linear problems have been studied in various science and engineering disciplines. A class of "hard" noisy linear problems can be formulated as follows: Given a matrix $\hat{A}$ and a vector $\mathbf{b}$ constructed using a finite set…
Quantum differential equation solvers aim to prepare solutions as $n$-qubit quantum states over a fine grid of $O(2^n)$ points, surpassing the linear scaling of classical solvers. However, unlike classically stored vectors of solutions, the…
The rapid advancement of quantum computing has led to an extensive demand for effective techniques to extract classical information from quantum systems, particularly in fields like quantum machine learning and quantum chemistry. However,…
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely,…
The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity…
We consider the quantum decoding problem. It consists in recovering a codeword given a superposition of noisy versions of this codeword. By measuring the superposition, we get back to the classical decoding problem. It appears for the first…
Quantum key distribution(QKD) might be the most famous application of quantum information theory. The idea of QKD is not difficult to understand but in practical implementations, many problems are needed to be solved, for example, the noise…
Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must…
Ever-increasing amount of data is produced by particle detectors in their quest to unveil the laws of Nature. The large data rate requires the use of specialized triggers that promptly reduce the data rate to a manageable level; however, in…
Quantum Monte Carlo (QMC) methods are one of the most important tools for studying interacting quantum many-body systems. The vast majority of QMC calculations in interacting fermion systems require a constraint to control the sign problem.…
The coupon collector is a prototypical model for evaluating the number of samples for identifying a set. By superposing all elements in the set as a pure quantum state, a quantum version of the coupon collector aims to learn the state,…
We introduce the task of Multi-Modal Context-Aware Recognition (MCoRec) in the ninth CHiME Challenge, which addresses the cocktail-party problem of overlapping conversations in a single-room setting using audio, visual, and contextual cues.…
Speech separation aims to separate individual voice from an audio mixture of multiple simultaneous talkers. Although audio-only approaches achieve satisfactory performance, they build on a strategy to handle the predefined conditions,…
The quantum measurement problem, understanding why a unique outcome is obtained in each individual experiment, is tackled by solving models. After an introduction we review the many dynamical models proposed over the years. A flexible and…
An important open problem in quantum information theory is the question of the existence of NPT bound entanglement. In the past years, little progress has been made, mainly because of the lack of mathematical tools to address the problem.…
Quantum discord as a measure of the quantum correlations cannot be easily computed for most of density operators. In this paper, we present a measure of the total quantum correlations that is operationally simple and can be computed…
When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can…