4 papers
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…
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…
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 …