Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Romain Bourneuf

Romain Bourneuf

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1Discrete Math×1Quantum Physics×1

Frequent co-authors

Nathan Claudet1×
Sang Yoon Kim1×
Rose McCarty1×
Blair D. Sullivan1×
Stéphan Thomassé1×

Research Timeline

2026
A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity

This paper introduces a new distance measure between graph states and shows its applications to graph edit-distance problems, including the ancilla integrity problem.

Highlighted terms show continued research focus across papers

Papers

cs.DScs.DMquant-phTheoreticalRecentJul 10, 2026

A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity

Romain Bourneuf, Nathan Claudet, Sang Yoon Kim, Rose McCarty +2 more

This paper introduces a new distance measure between graph states and shows its applications to graph edit-distance problems, including the ancilla integrity problem.

View →