Agustin Borgna
Senior R&D Scientist at Quantinuum
Cambridge, England, United Kingdom
Summary
🤩
Rockstar🎓
Top SchoolAgustin Borgna is a Senior R&D Scientist at Quantinuum with 12 years of experience blending quantum research and systems engineering, currently contributing to TKET and Hugr. He holds a PhD in Quantum Computing and a computer science licentiate, and brings practical software craftsmanship from roles ranging from consultancy to research at CNRS. A prolific Rust open-source maintainer and co-organizer of the Cambridge Rust Meetups, he has made substantive backend contributions to high-profile crates like petgraph (adding robust free-node management and algorithm benchmarks). Comfortable moving between low-level engineering and research, he uniquely combines quantum algorithm development with production-grade systems thinking. Colleagues know him for quietly improving performance and stability in core libraries while mentoring the Rust quantum community.
12 years of coding experience
5 years of employment as a software developer
Doctor of Philosophy - PhD, Quantum Computing, Doctor of Philosophy - PhD, Quantum Computing at Universite de LorraineTechnician, Industrial Electronics Technology/Technician, Technician, Industrial Electronics Technology/Technician at Pio IXLicentiate degree (BS+MS), Computer Science, Licentiate degree (BS+MS), Computer Science at University of Buenos Aires
Spanish, English, French
Stackoverflow
163reputation
14kreached
0answers
1question
Github Skills (10)
data-structures10
algorithms10
graph-algorithms10
rust10
data-structure10
benchmarking9
benchmark9
testing8
python6
bluetooth6
Programming languages (13)
Github contributions (5)
petgraph/petgraph
Apr 2021 - May 2022
Graph data structure library for Rust.
Role in this project:
Back-end Developer
Back-end DeveloperContributions:81 reviews, 23 commits, 109 PRs in 1 year 1 month
Contributions summary:Agustin primarily contributed to the back-end of the `petgraph` library. They implemented a double linked list for managing free nodes within the `stable_graph` data structure, addressing a crash in the `extend_with_edges` function. Additionally, the user added benchmarks for Tarjan's SCC algorithm, improving performance testing. They also added new methods for accessing node and edge weights, using iterators.
data-structure-librarygraph-datarustgraphdata-structure
ABorgna/site
Sep 2015 - Jan 2023
Contributions:24 pushes, 1 branch in 7 years 5 months
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.