241 citations · 498 across the 19 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
math.CO2005
First Order Definability of Trees and Sparse Random Graphs
Tom Bohman, Alan Frieze, Tomasz Luczak +4
Let D(G) be the smallest quantifier depth of a first order formula which is true for a graph G but false for any other non-isomorphic graph. This can be viewed as a measure for the…
quant-ph2005★ 241 cited
Unmodulated spin chains as universal quantum wires
Antoni Wojcik, Tomasz Luczak, Pawel Kurzynski +3
We study a quantum state transfer between two qubits interacting with the ends of a quantum wire consisting of linearly arranged spins coupled by an excitation conserving, time-ind…