Korbinian Kottmann
Korbinian Kottmann
Extending `PauliWord` and `PauliSentence` to handle relevant dynamical lie algebra airthmetic, i.e. computing the lie closure* of a list of operators. At the core, the problem this is trying to...
A demo and discussion of Lie algebraic simulation techniques, i.e. papers https://arxiv.org/abs/1012.2873 and https://arxiv.org/abs/2308.01432
In situations where one wants to iteratively build up a `PaulIVSpace` it is handy to be able to initialize an empty `PauliVSpace`. This is currently not possible and fixed with...
Tools for khk decomposition described in https://arxiv.org/abs/2104.00728 Currently only for internal usage and sharing Usage: ```python import pennylane as qml from pennylane import X, Y, Z, I from pennylane.pauli.dla.khk import...
Running into this problem a lot when using sums of paulis, wonder how we can make this more reliable and stable (ideally with no significant performance regression). In instances where...
I noticed that the following code snippet takes ages when activating qubit-wise-commuting groupings in the expectation value computation in the Hamiltonian. I aborted the execution after 10 minutes. The problem...
MPS simulation demo [sc-66753]
Function to compute the Cartan subalgebra from both PaulISentence or dense matrices, in particular leveraging the adjoint representation as best as possible WIP [sc-74996]
Providing dense implementations for all Cartan involutions listed in appendix C of https://arxiv.org/abs/2406.04418 Not sure if we should make this `pennylane.labs` functionality yet, but required for research purposes atm Iterative...
We identified that there are instances where computing commutators is significantly more efficient using their dense matrix representation. We thus provide a function to perform the lie closure using the...