Hi, sorry but I don't. We don't have a sample code for anything like this as far as I'm aware. The closest thing is Matt Fishman's Gaussian Matrix Product States package: https://github.com/mtfishman/GaussianMatrixProductStates.jl
If you dig into the details, the MPS it constructs can be related to a unitary circuit that defines a change of basis from real space (lattice basis) to a basis optimized to represent a certain Slater determinant or set of them. (I'd have to think about this a bit to see if it's really one or many.)
There was also a work about changing basis throughout a DMRG calculation for which there is an abstract here (https://ui.adsabs.harvard.edu/abs/2017APS..MARY20006C/abstract
) but I'm not sure if that work ever got published.
Finally, I know Xiadong Cao has done some work on a similar idea for optimizing DMFT solvers, but again I don't know if that work is published or where. To find it I'd be doing the same as you, just looking in Google Scholar. You may also want to look at the "DMRG Homepage":
(The list of yearly arxiv references there which are quite comprehensive of everything related to tensor networks and DMRG.)