20 citations · 36 across the 11 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
quant-ph2012★ 3 cited
Adiabatic Quantum Programming: Minor Embedding With Hard Faults
Christine Klymko, Blair D. Sullivan, Travis S. Humble
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specif…
math.CO2012★ 5 cited
On a Conjecture of Andrica and Tomescu
Blair D. Sullivan
Let S(n) be the integer sequence which is the coefficient of x^{n(n+1)/4} in the expansion of (1+x)(1+x^2), ..., (1+x^n) for positive integers n congruent to 0 or 3 mod 4. We prove…
math.CO2012★ 3 cited
Counting paths in digraphs
Paul Seymour, Blair D. Sullivan
Say a digraph is k-free if it has no directed cycles of length at most k, for positive integers k. Thomasse conjectured that the number of induced 3-vertex directed paths in a simp…