Arthur Braida

4056

Université Paris Cité

75013 Paris

Hey I’m Arthur. Currently I’m involved in a joint postdoc between CNRS Paris with the team of Simon Apers at IRIF and ULB in Brussels with the team of Jérémie Roland at QuIC.

At the moment my research lies at the intersection of theoretical computer science and physics. You can access to my publication at publications page. In my thesis manuscript, I tried my best to give a pedagogical historical introduction of analog quantum computing, slowly narrowing the subject toward my PhD.

I’m driven by curiosity: I explore unknown areas and aim to uncover the basic, low-level mechanisms that explain them.

selected publications

Unstructured Adiabatic Quantum Optimization: Optimality with Limitations

Arthur Braida, Shantanav Chakraborty, Alapan Chaudhuri, and 4 more authors

Quantum, Jul 2025

DOI Bib

@article{Braida2025unstructured,
  doi = {10.22331/q-2025-07-11-1790},
  url = {https://doi.org/10.22331/q-2025-07-11-1790},
  title = {Unstructured {A}diabatic {Q}uantum {O}ptimization: {O}ptimality with {L}imitations},
  author = {Braida, Arthur and Chakraborty, Shantanav and Chaudhuri, Alapan and Cunningham, Joseph and Menavlikar, Rutvij and Novo, Leonardo and Roland, J{\'{e}}r{\'{e}}mie},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {9},
  pages = {1790},
  month = jul,
  year = {2025}
}

Analog Quantum Computing for NP-Hard Combinatorial Graph Problems

Arthur Braida

Jun 2024

Bib PDF

@phdthesis{arthurthesis,
  title = {Analog Quantum Computing for NP-Hard Combinatorial Graph Problems},
  author = {Braida, Arthur},
  url = {https://theses.hal.science/tel-04706199},
  number = {2024ORLE1017},
  school = {Universit{\'e} d'Orl{\'e}ans},
  year = {2024},
  month = jun,
  keywords = {Quantum Annealing ; Adiabatic Quantum Computing ; Approximation Ratio ; MaxCut ; Combinatorial problems ; Lieb-Robinson bound ; Perturbative theory ; Spectral graph theory ; Recuit quantique ; Calcul quantique adiabatique ; Ratio d'approximation ; MaxCut ; Probl{\`e}mes combinatoires ; Borne de Lieb-Robinson ; Th{\'e}orie perturbative ; Th{\'e}orie spectrale des graphes},
  type = {Theses},
  hal_id = {tel-04706199},
  hal_version = {v1}
}

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

Arthur Braida, Simon Martiel, and Ioan Todinca

npj Quantum Information, Jun 2024

DOI Bib

@article{braida2024tight,
  title = {Tight Lieb--Robinson Bound for approximation ratio in quantum annealing},
  author = {Braida, Arthur and Martiel, Simon and Todinca, Ioan},
  journal = {npj Quantum Information},
  volume = {10},
  number = {1},
  pages = {40},
  year = {2024},
  url = {https://www.nature.com/articles/s41534-024-00832-x},
  doi = {s41534-024-00832-x},
  publisher = {Nature Publishing Group UK London}
}