# Entanglement entropy for stabilizer states

+ 1 like - 0 dislike
450 views

A stabilizer state for a stabilizer set S for a system of qubits can be written as $\rho=\frac{1}{2^{n}}\sum_{g\epsilon S}g$ . If we take a bipartition A-B of our system and partial trace over A, we get $\rho_{B}=\frac{1}{2^{n_{B}}}\sum_{g\epsilon S_{B}}g$ where $S_{B}$ is the subet of elements in S which are non-zero when traced over A . Entanglement Entropy of $\rho_{B}$ is proven as equal to $n_{B}-|{S_{B}}|$ where $|{S_{B}}|$ is the rank of $S_{B}$ or the size of its minimal generating set. Its trivial to see the first part of the result $n_{B}$ but the complete result $n_{B}-|{S_{B}}|$ requires to prove that ${Tr}[\frac{1}{2^{n_{B}}} {\sum}_{g\epsilon S_{B}}g (\log{\sum}_{g\epsilon S_{B}}g)]=|{S_{B}}|$ . Is there an easy way to prove this ? If it helps, I found this result here http://arxiv.org/abs/quant-ph/0406168

This post imported from StackExchange at 2015-10-14 16:58 (UTC), posted by SE-user user56199 asked Sep 5, 2015
edited Oct 14, 2015

 Please use answers only to (at least partly) answer questions. To comment, discuss, or ask for clarification, leave a comment instead. To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL. Please consult the FAQ for as to how to format your post. This is the answer box; if you want to write a comment instead, please use the 'add comment' button. Live preview (may slow down editor)   Preview Your name to display (optional): Email me at this address if my answer is selected or commented on: Privacy: Your email address will only be used for sending these notifications. Anti-spam verification: If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:p$\hbar$y$\varnothing$icsOverflowThen drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds). To avoid this verification in future, please log in or register.