15 citations · 45 across the 6 of their papers we have counts for
6 papers
Monochromatic spanning trees and matchings in ordered complete graphs
János Barát, András Gyárfás, Géza Tóth
Two independent edges in ordered graphs can be nested, crossing or separated. These relations define six types of subgraphs, depending on which relations are forbidden. We refine a…
Helly-type theorems for the ordering of the vertices of a hypergraph
Csaba Biró, Jenő Lehel, Géza Tóth
Let be a complete -uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of is called an {\em…
Quantum Wasserstein distance based on an optimization over separable states
Géza Tóth, József Pitrik
We define the quantum Wasserstein distance such that the optimization of the coupling is carried out over bipartite separable states rather than bipartite quantum states in general…
Entanglement witnesses in the XY chain: Thermal equilibrium and postquench nonequilibrium states
Ferenc Iglói, Géza Tóth
We use entanglement witnesses to detect entanglement in the XY chain in thermal equilibrium and determine the temperature bound below which the state is detected as entangled. We c…
Iterative optimization in quantum metrology and entanglement theory using semidefinite programming
Árpád Lukács, Róbert Trényi, Tamás Vértesi +1
We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best lo…
Number-phase uncertainty relations and bipartite entanglement detection in spin ensembles
Giuseppe Vitagliano, Matteo Fadel, Iagoba Apellaniz +4
We present a method to detect bipartite entanglement based on number-phase-like uncertainty relations in split spin ensembles. First, we derive an uncertainty relation that plays t…