Hi, so depending on which qubits you want the entanglement for from a general N-qubit wavefunction, it can range from being straightforward to very difficult and computationally expensive.
But a common type of entanglement which is very efficiently computable is the entanglement entropy of a left-right bipartition of a state represented by an MPS. So this means the entanglement between a region "A" which is sites 1,2,3,...,L and region B which is sites L+1,L+2,...,N for an MPS with N sites.
To obtain this entanglement entropy, please see the following sample code provided on the ITensor website (in the "code formulas" section):
As you may know, even if your system isn't strictly 1D, you can still often get away with representing its wavefunction by an MPS and by choosing the ordering of the MPS sites appropriately (or changing the ordering using swap gates) you can get the entanglement entropy of all sorts of bipartitions. I used this approach in the following paper:
(see Fig. 4)