Related papers: Analysis of ground state in random bipartite match…
While the ground-state problem for the random-field Ising model is polynomial, and can be solved using a number of well-known algorithms for maximum flow or graph cut, the analogue random-field Potts model corresponds to a multi-terminal…
Bipartite and global entanglement are analyzed for the ground state of a system of $N$ spin 1/2 particles interacting via a collective spin-spin coupling described by the Lipkin-Meshkov-Glick (LMG) Hamiltonian. Under certain conditions…
We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An $(a,b)$-supermatch is a stable matching in which if $a$ pairs break up it is possible to find another stable…
We demonstrate the existence of general constraints on distributed quantum correlations, which impose a trade-off on bipartite and multipartite entanglement at once. For all N-mode Gaussian states under permutation invariance, we establish…
We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement…
We consider stable and popular matching problems in arbitrary graphs, which are referred to as stable roommates instances. We extend the 3/2-approximation algorithm for the maximum size weakly stable matching problem to the roommates case,…
Computing many-body ground state energies and resolving electronic structure calculations are fundamental problems for fields such as quantum chemistry or condensed matter. Several quantum computing algorithms that address these problems…
The pairwise entanglement and local polarization of the ground state are discussed by studying the Heisenberg XX model in finite qubit case. The results show that: the ground state is composed by the micro state with the minimal total spin…
We derive a monogamy inequality for entanglement and local contextuality, for any finite bipartite system. It essentially results from the relations between the purity of a local state and the entanglement of the global state, and between…
We explore the consequences of incomplete information in the stable marriage problem. When information capacity of the participants is increased, more favorable games are created and the quality of the matches are also better. The simple…
We present a statistical mechanics description to study the ground state of quantum systems. In this approach, averages for the complete system are calculated over the non-interacting energy levels. Taking different interaction parameter,…
In many matching markets--such as athlete recruitment or academic admissions--participants on one side are evaluated by attribute vectors known to the other side, which in turn applies individual \emph{salience vectors} to assign relative…
We study the stable marriage problem in the partial information setting where the agents, although they have an underlying true strict linear order, are allowed to specify partial orders. Specifically, we focus on the case where the agents…
In this paper we study the generalized version of weighted matching in bipartite networks. Consider a weighted matching in a bipartite network in which the nodes derive value from the split of the matching edge assigned to them if they are…
Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach…
Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We…
Given a set $A$ of $n$ people, with each person having a preference list that ranks a subset of $A$ as his/her acceptable partners in order of preference, we consider the Roommates Problem (RP) and the Marriage Problem (MP) of matching…
A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…
In this paper, we study the bipartite entanglement of spin coherent states in the case of pure and mixed states. By a proper choice of the subsystem spins, the entanglement for large class of quantum systems is investigated. We generalize…
The matching hypothesis in social psychology claims that people are more likely to form a committed relationship with someone equally attractive. Previous works on stochastic models of human mate choice process indicate that patterns…