Related papers: On the quantum no-signalling assisted zero-error c…
We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be…
Non-signalling quantum channels -- relevant in, e.g., the study of Bell and Einstein-Podolsky-Rosen scenarios -- may be simulated via affine combinations of local operations in bipartite scenarios. Moreover, when these channels correspond…
We develop the theory of quantum (a.k.a. noncommutative) relations and quantum (a.k.a. noncommutative) graphs in the finite-dimensional covariant setting, where all systems (finite-dimensional $C^*$-algebras) carry an action of a compact…
Analyzing the geometry of correlation sets constrained by general causal structures is of paramount importance for foundational and quantum technology research. Addressing this task is generally challenging, prompting the development of…
The Schmidt number is an entanglement measure whose logarithm quantifies the zero-error entanglement cost of generating a given quantum state using local operations and classical communication (LOCC). %However, the Schmidt number is a…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
We initiate the study of zero-error communication via quantum channels when the receiver and sender have at their disposal a noiseless feedback channel of unlimited quantum capacity, generalizing Shannon's zero-error communication theory…
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…
For a classical channel, neither the Shannon capacity, nor the sum of conditional probabilities corresponding to the cases of successful transmission can be increased by the use of shared entanglement, or, more generally, a non-signaling…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
In this paper we study the problem of sorting under non-uniform comparison costs, where costs are either 1 or $\infty$. If comparing a pair has an associated cost of $\infty$ then we say that such a pair cannot be compared (forbidden…
We present a protocol to simulate the quantum correlations of an arbitrary bipartite state, when the parties perform a measurement according to two traceless binary observables. We show that $\log(d)$ bits of classical communication is…
We calculate full asymptotic expansions of prime-independent multiplicative functions on additive arithmetic semigroups that satisfy a strong form of Knopfmacher's axioms. When applied to the semigroup of unlabeled graphs, our method yields…
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic…
We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
We introduce classical and quantum no-signalling bicorrelations and characterise the different types thereof in terms of states on operator system tensor products, exhibiting connections with bistochastic operator matrices and with…
Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic…