Related papers: Quantum Perfect Matchings
Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of…
We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bipartiteness) using a reduction to st-connectivity.…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
Measurement scenarios containing events with relations of exclusivity represented by pentagons, heptagons, nonagons, etc., or their complements are the only ones in which quantum probabilities cannot be described classically. Interestingly,…
We introduce a category $\mathsf{qGph}$ of quantum graphs, whose definition is motivated entirely from noncommutative geometry. For all quantum graphs $G$ and $H$ in $\mathsf{qGph}$, we then construct a quantum graph $[G,H]$ of…
In the nonsignaling framework, nonclassicality in correlation arising from two spatially separated input-output devices gets manifested, solely, through its \emph{nonlocal} behavior. Study of correlations based on this said feature is…
Partial graph matching extends traditional graph matching by allowing some nodes to remain unmatched, enabling applications in more complex scenarios. However, this flexibility introduces additional complexity, as both the subset of nodes…
In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such…
Bell nonlocality is a cornerstone of quantum theory with applications in information processing ranging from cryptography to distributed computing and game theory. Indeed, it is known that Bell's theorem can be formally linked to Bayesian…
Genuine multipartite nonlocality is a salient feature of quantum systems, empowering the security of multi-party device independent cryptographic protocols. Given a correlation, characterizing and detecting genuineness have been subjected…
We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the…
We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, yielding an outcome of either 'win' or 'lose'. Molina and…
Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated…
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
A graph $H$ is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph $H$, we give an $O(n^4)$ time algorithm for counting perfect matchings in graphs excluding $H$ as a minor. The runtime…
An important topic in quantum information is the theory of error correction codes. Practical situations often involve quantum systems with states in an infinite dimensional Hilbert space, for example coherent states. Motivated by these…
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…
We study separating matchings in graphs, that is, matchings whose removal increases the number of connected components, and focus on determining the maximum size of such a matching in a graph $G$, denoted by $\mathrm{mms}(G)$. We show that…
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. We consider three query models. In the first model ("OR queries"), the oracle returns whether a given subset of the vertices contains any…
In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…