539 citations · 706 across the 16 of their papers we have counts for
17 papers
Efficiency of Feynman's quantum computer
Ralph Jason Costales, Alex Gunning, Tony Dorlas
Feynman's circuit-to-Hamiltonian construction enables the mapping of a quantum circuit to a time-independent Hamiltonian. This model introduces a Hilbert space made from an ancilla…
On the Wasserstein distance and the Dobrushin uniqueness theorem
Tony C. Dorlas, Baptiste Savoie
In this paper, we revisit the Dobrushin uniqueness theorem for Gibbs measures of lattice systems of interacting particles at thermal equilibrium. In a nutshell, Dobrushin's uniquen…
Simulating quantum circuits by adiabatic computation: improved spectral gap bounds
Shane Dooley, Graham Kells, Hosho Katsura +1
Adiabatic quantum computing is a framework for quantum computing that is superficially very different to the standard circuit model. However, it can be shown that the two models ar…
A combinatorial identity with applications to forest graphs
Tony C. Dorlas, Alexei L. Rebenko, Baptiste Savoie
We give an elementary proof of an interesting combinatorial identity which is of particular interest in graph theory and its applications. Two applications to enumeration of forest…
Correlation of clusters: Partially truncated correlation functions and their decay
Tony C. Dorlas, Alexei L. Rebenko, Baptiste Savoie
In this article, we investigate partially truncated correlation functions (PTCF) of infinite continuous systems of classical point particles with pair interaction. We derive Kirkwo…
The strong converse theorem for the product-state capacity of quantum channels with ergodic Markovian memory
Tony Dorlas, Ciara Morgan
Establishing the strong converse theorem for a communication channel confirms that the capacity of that channel, that is, the maximum achievable rate of reliable information commun…