Related papers: Correlation/Communication complexity of generating…
The concepts of quantum correlation complexity and quantum communication complexity were recently proposed to quantify the minimum amount of resources needed in generating bipartite classical or quantum states in the single-shot setting.…
We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family of complexity measures that interpolates between the two…
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum…
We consider a realistic setting of quantum tasks that generate shared bipartite quantum states. Suppose \alice and \bob are located at different places and need to produce a target shared quantum state $\rho$. In order to save quantum…
In this review, we discuss a relation between quantum communication complexity and a long-standing debate in quantum foundation concerning the interpretation of the quantum state. Is the quantum state a physical element of reality as…
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating a process of state preparation, transmission through the channel and subsequent measurement. It…
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…
We derive a classification and a measure of classical- and quantum-correlation of multipartite qubit, qutrit, and in general, $n$-level systems, in terms of SU$(n)$ representations of density matrices. We compare the measure for the case of…
We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical…
There are at least a number of ways to formally define complexity. Most of them relate to some kind of minimal description of the studied object. Being this one in form of minimal resources of minimal effort needed to generate the object…
A natural operational paradigm for distributed quantum and classical information processing involves local operations coordinated by multiple rounds of public communication. In this paper we consider the minimum number of communication…
Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computational learning theory. In this work, we study the…
In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As…
The distillable randomness of a bipartite quantum state is an information-theoretic quantity equal to the largest net rate at which shared randomness can be distilled from the state by means of local operations and classical communication.…
We study the behaviour of two different measures of the complexity of multipartite correlation patterns, weaving and neural complexity, for symmetric quantum states. Weaving is the weighted sum of genuine multipartite correlations of any…
We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully…
In this paper, two conjectures which were proposed in [Phys. Rev. A \textbf{82}, 052122(2010)] on the correlations in a bipartite state $\rho^{AB}$ are studied. If the mutual information $I\Pa{\rho^{AB}}$ between two quantum systems $A$ and…
Traditionally, quantum state correlation can be obtained with calculations on a state density matrix already known. Here, we propose a model with which correlations of unknown quantum states can be obtained. There are no needs of classical…
Network coordination is considered in three basic settings, characterizing the generation of separable and classical-quantum correlations among multiple parties. First, we consider the simulation of a classical-quantum state between two…
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon…