activity
20072026
most citedSharp transition for single polarons in the one-dimensional Su-Schrieffer-Heeger model

141 citations · 450 across the 10 of their papers we have counts for

collaborators

11 papers

hep-ph2026

2025 EIC-France Workshop: Physics Highlights and Perspectives

F. Arleo, V. Bertone, J. Bettane +75

This document presents a synthesis of the theory contributions and discussions from the 2nd EIC-France Workshop, held at IJCLab (Orsay) on 1-3 December 2025. The workshop brought t…

cond-mat.quant-gas2025★ 1 cited

Vacuum tunneling of vortices in two-dimensional He superfluid films

Michael J. Desrochers, Dominic Marchand, P. C. E. Stamp

At low temperature T we expect vacuum tunneling processes to occur in superfluid He films. We distinguish between extrinsic processes, in which single vortices nucleate by t…

quant-ph2018★ 1 cited

A Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer

D. J. J. Marchand, M. Noori, A. Roberts +6

Discovering the low-energy conformations of a molecule is of great interest to computational chemists, with applications in {\em in silico} materials design and drug discovery. In…

cond-mat.str-el2016★ 34 cited

The polaron paradigm: a dual coupling effective band model

Dominic J. J. Marchand, Philip C. E. Stamp, Mona Berciu

Non-diagonal couplings to a bosonic bath completely change polaronic dynamics, from the usual diagonally-coupled paradigm of smoothly-varying properties. We study, using analytic a…

cs.DM2016

Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs

Arman Zaribafiyan, Dominic J. J. Marchand, Seyed Saeed Changiz Rezaei

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to…

quant-ph2015★ 129 cited

Quantum Annealing Implementation of Job-Shop Scheduling

Davide Venturelli, Dominic J. J. Marchand, Galo Rojo

A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail. After formulating the problem as a time-indexed quadratic unconstrained binary…