3 citations · 5 across the 8 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity
Romain Bourneuf, Nathan Claudet, Sang Yoon Kim +3
We introduce a new notion of distance between two graph states and on the same set of qubits. This distance is the minimum number of ancilla qubits in a gr…
quant-ph2026
The Structure of Circle Graph States
Frederik Hahn, Rose McCarty, Hendrik Poulsen Nautrup +1
Circle graph states are a structurally important family of graph states. The family's entanglement is a priori high enough to allow for universal measurement-based quantum computat…
quant-ph2026
The 27-qubit Counterexample to the LU-LC Conjecture is Minimal
Nathan Claudet
It was once conjectured that two graph states are local unitary (LU) equivalent if and only if they are local Clifford (LC) equivalent. This so-called LU-LC conjecture was disprove…