12 citations · 37 across the 8 of their papers we have counts for
Showing 2001Show all
2 papers · 1 filter
cs.DM2001
Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
Pawel Wocjan, Dominik Janzing, Thomas Beth
A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacenc…
quant-ph2001
Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity
P. Wocjan, D. Janzing, Th. Beth
We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathemati…