3 citations · 5 across the 4 of their papers we have counts for
5 papers · 1 filter
Hamiltonian Eigenvalue Transformation by Tridiagonal Gadgets
Arthur Braida, Joseph Cunningham, Jérémie Roland
An analog device implements a local Hamiltonian H, but a polynomial P (H) is in general not local, so the device cannot implement it. We carry P (H), to any prescribed accuracy, as…
Alternative adiabatic quantum dynamics with algorithmic applications
Joseph Cunningham, Jérémie Roland
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolut…
New random compiler for Hamiltonians via Markov Chains
Benoît Dubus, Joseph Cunningham, Jérémie Roland
Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems…
Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
Arthur Braida, Shantanav Chakraborty, Alapan Chaudhuri +4
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on -bits in time …
Eigenpath traversal by Poisson-distributed phase randomisation
Joseph Cunningham, Jérémie Roland
We present a framework for quantum computation, similar to Adiabatic Quantum Computation (AQC), that is based on the quantum Zeno effect. By performing randomised dephasing operati…