IEEE/ICACT20250011 Slide.05        [Big Slide]       [YouTube] Oral Presentation
Perform CZ gate on edge (𝑢,𝑣). If it exists, this operation will delete it, or this operation will add an edge at this position. perform an operator 𝑈_𝑎^𝐿𝐶=¡î(−𝑖𝑋_𝑎 )⨂¡î(𝑖𝑍_𝑁𝑎 ) to a vertex 𝑎¡ô𝑉, we can get the structure of graph states 𝐺^¡Ç=𝐺¡ú𝐺_𝑁𝑎 𝑚𝑜𝑑 2. 𝐺_𝑁𝑎, the complete graph of the neighbouring vertices of vertex 𝑎. Above means original graph 𝐺 is superimposed with 𝐺_𝑁𝑎, if there are overlapping edges, they are deleted; if not overlapping, they are retained.

[Go to Next Slide]
Select Voice: