3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DM2026
Entanglement from Expansion: High Rank-Width in Deterministic Graphs
Tristan Cam, Cyril Gavoille, Yvan Le Borgne +1
Entanglement in quantum graph states is intrinsically linked to rank-width, a graph complexity measure introduced by Oum and Seymour. In this work, we enable the preparation of max…
quant-ph2023★ 3 cited
Speeding up quantum circuits simulation using ZX-Calculus
Tristan Cam, Simon Martiel
We present a simple and efficient way to reduce the contraction cost of a tensor network to simulate a quantum circuit. We start by interpreting the circuit as a ZX-diagram. We the…