name: str
selection_rules_mapping: dict
p: _lru_cache_wrapper
x: _lru_cache_wrapper

__init__(self, n_quanta, m=None, re=None, dimensionless=True): 

__eq__(self, other): 

@staticmethod
pmatrix_ho(n): 

There’s one big subtlety to what we’re doing here, which is that for efficiency reasons we return an entirely real matrix The reason for that is we assumed people would mostly use it in the context of stuff like pp, pQp, or pQQp, in which case the imaginary part pulls out and becomes a negative sign We actually use this assumption across all of our representations

• n: Any

• :returns: sp.csr_matrix

@staticmethod
qmatrix_ho(n): 

• n: Any

• :returns: sp.csr_matrix

operator(self, *terms, logger=None, parallelizer=None, chunk_size=None, **operator_settings): 

Builds an operator based on supplied terms, remapping names where possible. If coeffs or axes are supplied, a ContractedOperator is built.

• terms: Any

• coeffs: Any

• axes: Any

• :returns: _

__repr__(self):