Johnnie Gray

Hi @yuxuanzhang1995, currently it likely will not work. This is because whilst most of the array operations `quimb` performs are backend agnostic, the DMRG routine specifically uses a [`TNLinearOperator`](https://quimb.readthedocs.io/en/latest/autoapi/quimb/tensor/tensor_core/index.html#quimb.tensor.tensor_core.TNLinearOperator) to...

Yes I do think that makes sense. I might open another issue about a more major refactor of the optimal and greedy pathfinders that might be worth doing at the...

Yes the blocker on changing the default optimal implementation (other than time) is what to do with the `memory_limit` kwarg. Probably the easiest thing to do is to maintain this...

Hi @PietropaoloFrisoni, thanks for the issue, will look into shortly. For info, what is the error that is raised?

Ah yes, probably the circuit simplifies to a scalar, with contraction cost 0, which causes the domain error. Probably a simple `max(1, tree.contraction_cost())` guard would suffice here.

Thanks for the issue! Yes the problem is that the index name is mapped from the coordinate pair it links, and for L=2 PBC the coordinate pair is the same...

Hi @sajjan02purdue. 1. For general multi term MPOs you can look at `quimb.experimental.operatorbuilder`. Unfortunately it currently only supports $d=2$ i.e. spin-1/2 or qubits, but it would be very easy to...

Hi @marcomaronese, I would recommend checking the docs for the answers to most of these if you haven't seen them already. In particular you can search for functions and their...

> Specifically, the method build_sparse_matrix throws the following errors: Ah yes those options are not released yet. You will need to install the development version directly from github, or just...

Hi @abhinavd yes would be great support as many formats as possible and happy to accept PRs along these lines! Though I'd note I am probably unlikely to implement this...