File mparray.py has 1490 lines of code (exceeds 250 allowed). Consider refactoring.

Open

# encoding: utf-8
""" Core MPArray data structure & general purpose functions

  .. todo:: single site MPAs -- what is left?
  .. todo:: Local tensor ownership -- see MPArray class comment

File mppovm.py has 1229 lines of code (exceeds 250 allowed). Consider refactoring.

Open

# encoding: utf-8


r'''Matrix-product representation of POVMs

MPArray has 53 functions (exceeds 20 allowed). Consider refactoring.

Open

class MPArray(object):
    r"""Efficient representation of a general N-partite array :math:`A` in
    matrix product form with open boundary conditions:

    .. math::

File linalg.py has 454 lines of code (exceeds 250 allowed). Consider refactoring.

Open

# encoding: utf-8

"""Linear algebra with matrix product arrays

Currently, we support computing extremal eigenvalues and eigenvectors

MPPovm has 34 functions (exceeds 20 allowed). Consider refactoring.

Open

class MPPovm(mp.MPArray):
    """MPArray representation of multipartite POVM

    There are two different ways to write down a POVM in matrix product form

File factory.py has 322 lines of code (exceeds 250 allowed). Consider refactoring.

Open

# encoding: utf-8
"""Module to create random test instances of matrix product arrays"""

from __future__ import division, print_function

Function eig_sum has a Cognitive Complexity of 23 (exceeds 5 allowed). Consider refactoring.

Open

def eig_sum(mpas, num_sweeps, var_sites=2,
            startvec=None, startvec_rank=None, randstate=None, eigs=None):
    r"""Iterative search for eigenvalues of a sum of MPOs/MPSs

    Try to compute the ground state of the sum of the objects in

• Read up
  Read up

Function eig has a Cognitive Complexity of 23 (exceeds 5 allowed). Consider refactoring.

Open

def eig(mpo, num_sweeps, var_sites=2,
        startvec=None, startvec_rank=None, randstate=None, eigs=None):
    r"""Iterative search for MPO eigenvalues

    .. note::

• Read up
  Read up

File mpsmpo.py has 279 lines of code (exceeds 250 allowed). Consider refactoring.

Open

# encoding: utf-8


r"""Matrix Product State (MPS) and Operator (MPO) functions

Function _adapt_to has a Cognitive Complexity of 16 (exceeds 5 allowed). Consider refactoring.

Open

    def _adapt_to(self, target, num_sweeps, var_sites):
        """Iteratively minimize the l2 distance between `self` and `target`.
        This is especially important for variational compression, where `self`
        is the initial guess and target the MPA to be compressed.

• Read up
  Read up

Function expectations has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    def expectations(self, mpa, mode='auto'):
        """Computes the exp. values of the POVM elements with given state

        :param mpa: State given as MPDO, MPS, or PMPS
        :param mode: In which form `mpa` is given. Possible values: 'mpdo',

• Read up
  Read up

Function _compress_svd has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    def _compress_svd(self, rank=None, relerr=None, direction=None,
                      canonicalize=True, svdfunc=truncated_svd):
        """Compress `self` using SVD [:ref:`Sch11 <Sch11>`, Sec. 4.5.1]

        Parameters: See :func:`~compress()`.

• Read up
  Read up

Function sum has a Cognitive Complexity of 13 (exceeds 5 allowed). Consider refactoring.

Open

    def sum(self, axes=None):
        """Element-wise sum over physical legs

        :param axes: Physical legs to sum over

• Read up
  Read up

Function canonicalize has a Cognitive Complexity of 12 (exceeds 5 allowed). Consider refactoring.

Open

    def canonicalize(self, left=None, right=None):
        """Brings the MPA to canonical form in place
        [:ref:`Sch11 <Sch11>`, Sec. 4.4]

        Note that we do not support full left- or right-canonicalization. In

• Read up
  Read up

Function partialdot has a Cognitive Complexity of 12 (exceeds 5 allowed). Consider refactoring.

Open

def partialdot(mpa1, mpa2, start_at, axes=(-1, 0)):
    """Partial dot product of two MPAs of inequal length.

    The shorter MPA will start on site ``start_at``. Local dot products
    will be carried out on all sites of the shorter MPA. Other sites

• Read up
  Read up

Function inject has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

def inject(mpa, pos, num=None, inject_ten=None):
    """Interleaved chain product of an MPA and a rank 1 MPA

    Return the chain product between mpa and ``num`` copies of the local
    tensor ``inject_ten``, but place the copies of ``inject_ten`` before

• Read up
  Read up

Function _eig_minimize_locally2 has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

def _eig_minimize_locally2(local_op, eigvec_ltens, eigs):
    """Implement the main part of :func:`_eig_minimize_locally`

    See :func:`_eig_minimize_locally` for a description.

• Read up
  Read up

Function pmf_as_array has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def pmf_as_array(self, state, mode='auto', eps=1e-10, impl='auto'):
        """Compute the POVM's PMF for `state` as full array

        Parameters: See :func:`MPPovm.pmf`.

• Read up
  Read up

Function lfun has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def lfun(self, coeff, funs, state, mode='auto', eps=1e-10):
        """Evaluate a linear combination of functions of POVM outcomes

        :param np.ndarray coeff: A length `n_funs` array with the
            coefficients of the linear combination. If `None`, return

• Read up
  Read up

Function match_elems has 29 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    def match_elems(self, other, exclude_dup=(), eps=1e-10):
        """Find POVM elements in `other` which have information on `self`

        We find all POVM sites in `self` which have only one possible
        outcome. We discard these outputs in `other` and afterwards