Related papers: The Quantum Cocktail Party Problem
The learning parity with noise (LPN) problem is a well-established computational challenge whose difficulty is critical to the security of several post-quantum cryptographic primitives such as HQC and Classic McEliece. Classically, the…
Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted…
We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob knows the source statistics, and that Alice and Bob have identical…
No quantum measurement can give full information on the state of a quantum system; hence any quantum feedback control problem is neccessarily one with partial observations, and can generally be converted into a completely observed control…
We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…
We provide a unified picture for the master equation approach and the quantum trajectory approach to a measurement problem of a two-state quantum system (a qubit), an electron coherently tunneling between two coupled quantum dots (CQD's)…
Multiple-user multiple-input multiple-output applications have recently gained a lot of attention. Here, we show an efficient optimization formulation for the design of all the temporal and spatial degrees of freedom of an acoustic…
With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources…
Quantum state discrimination is one of the most fundamental problems studied in quantum information theory. Applications range from channel coding to metrology and cryptography. In this work, we introduce a new variant of this task: Local…
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
We propose an energy-driven stochastic master equation for the density matrix as a dynamical model for quantum state reduction. In contrast, most previous studies of state reduction have considered stochastic extensions of the Schr\"odinger…
It is known that quantum correlations exhibited by a maximally entangled qubit pair can be simulated with the help of shared randomness, supplemented with additional resources, such as communication, post-selection or non-local boxes. For…
In this paper, we address the problem how to represent a classical data distribution in a quantum system. The proposed method is to learn quantum Hamiltonian that is such that its ground state approximates the given classical distribution.…
We study the problem of distributed information bottleneck, in which multiple encoders separately compress their observations in a manner such that, collectively, the compressed signals preserve as much information as possible about another…
We introduce a device-independent quantum key distribution protocol for N parties, using the multipartite Hardy paradox to certify genuine multipartite nonlocality. Unlike traditional multipartite protocols that extract the key from…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
The goal of randomness extraction is to distill (almost) perfect randomness from a weak source of randomness. When the source yields a classical string X, many extractor constructions are known. Yet, when considering a physical randomness…