6 citations · 9 across the 6 of their papers we have counts for
8 papers
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…
Log-concavity and tunneling: adiabatic quantum optimization for convex functions (with a spike)
Arthur Braida, Elie Bermot, Simon Apers
Quantum tunneling is expected to provide a computational speedup in quantum computing, a phenomenon that Adiabatic Quantum Optimization (AQO) aims to leverage. While some academic…
Scaling QAOA: transferring optimal adiabatic schedules from small-scale to large-scale variational circuits
Ugo Nzongani, Dylan Laplace Mermoud, Arthur Braida
The Quantum Approximate Optimization Algorithm (QAOA) is a leading approach for combinatorial optimization on near-term quantum devices, yet its scalability is limited by the diffi…
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 …
Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
Arthur Braida, Simon Martiel, Ioan Todinca
Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its pot…
Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
Arthur Braida, Simon Martiel, Ioan Todinca
This paper explores the phenomenon of avoided level crossings in quantum annealing, a promising framework for quantum computing that may provide a quantum advantage for certain tas…
On constant-time quantum annealing and guaranteed approximations for graph optimization problems
Arthur Braida, Simon Martiel, Ioan Todinca
Quantum Annealing (QA) is a computational framework where a quantum system's continuous evolution is used to find the global minimum of an objective function over an unstructured s…
Anti-crossings and spectral gap during quantum adiabatic evolution
Arthur Braida, Simon Martiel
We aim to give more insights on adiabatic evolution concerning the occurrence of anti-crossings and their link to the spectral minimum gap . We study in detail adiabatic q…