Related papers: The Quantum Cocktail Party Problem
The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measuring complementary physical quantities by a single measurement,…
This short note describes a method to tackle the (bipartite) quantum separability problem. The method can be used for solving the separability problem in an experimental setting as well as in the purely mathematical setting. The idea is to…
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is,…
Understanding the emergence of quantum chaos in multipartite systems is challenging in the presence of interactions. We show that the contribution of the subsystems to the global behavior can be revealed by probing the full counting…
Quantum statistical queries provide a theoretical framework for investigating the computational power of a learner with limited quantum resources. This model is particularly relevant in the current context, where available quantum devices…
A central challenge in quantum error correction is identifying powerful quantum codes tailored to specific hardware and determining their error thresholds above which quantum information is unprotected. This problem is hard because we…
Solitude verification is arguably one of the simplest fundamental problems in distributed computing, where the goal is to verify that there is a unique contender in a network. This paper devises a quantum algorithm that exactly solves the…
Quantifying the complexity of quantum states is a longstanding key problem in various subfields of science, ranging from quantum computing to the black-hole theory. The lower bound on quantum pure state complexity has been shown to grow…
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…
Quantum information has been drawing a wealth of research in recent years, shedding light on questions at the heart of quantum mechanics, as well as advancing fields such as complexity theory, cryptography, key distribution, and chemistry.…
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods…
Accurately estimating high-order moments of quantum states is an elementary precondition for many crucial tasks in quantum computing, such as entanglement spectroscopy, entropy estimation, spectrum estimation, and predicting non-linear…
We establish a quantitative connection between the amount of lost classical information about a quantum state and the concomitant loss of entanglement. Using methods that have been developed for the optimal purification of mixed states we…
The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremacy"). In this work, we investigate whether quantum advantage…
We introduce the problem of stability verification of quantum sources which are non-i.i.d.. The problem consists in ascertaining whether a given quantum source is stable or not, in the sense that it produces always a desired quantum state…
Quantum entanglement is usually revealed via a well aligned, carefully chosen set of measurements. Yet, under a number of experimental conditions, for example in communication within multiparty quantum networks, noise along the channels or…
The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…
A continuous variable controlled quantum dialogue scheme is proposed. The scheme is further modified to obtain two other protocols of continuous variable secure multiparty computation. The first one of these protocols provides a solution of…
Full-counting statistics (FCS) provides a powerful framework to access the statistical information of a system from the characteristic function. However, applications of FCS for generic interacting quantum systems often be hindered by the…
The quest for improved sampling methods to solve statistical mechanics problems of physical and chemical interest proceeds with renewed efforts since the invention of the Metropolis algorithm, in 1953. In particular, the understanding of…