Multi-partite entanglement in cluster Ising Hamiltonians in d- dimensions.
ORAL
Abstract
Cluster Ising Hamiltonian is a frustration-free system consisting of qubits arranged on the vertices of a square grid graph with nearest neighbour, "cluster-like" interactions. There has been extensive earlier study (by other papers/authors) of the one dimensional case, demonstrating the existence of symmetry protected topological order and the two dimensional case has been shown to be useful in measurement based quantum computation. We use methods from quantum error correction and graph theory to calculate the exact amount of multi-partite entanglement in the non degenerate ground state of the d-dimensional cluster Ising Hamiltonian.
*MATRICS grant (Grant No. MTR/ 2019/001 043) from the Science and Engineering Research Board (SERB), European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme under grant agreement No. 951541, ARO (W911NF-20-1-0013) (ES), US-Israel Binational Science Foundation, grant number 2016255 (ES); Israel Science Foundation, grant numbers 154/19 (ES)
–
Publication: 1. N-qubit states with maximum entanglement across all bipartitions: A graph state approach,
https://arxiv.org/abs/2201.05622 , Sowrabh Sudevan, Sourin Das
2. Multi-partite Entanglement in d dimensional cluster Ising Hamiltonians, "Manuscript under preparation",
Presenters
-
Sowrabh Sudevan
- indian institute of science education and research, Kolkata