netket.graph

This module provides graphs on which local Hamiltonians can be defined.

Abstract Classes

Below you find a list of all public classes defined in this module.

AbstractGraph

Abstract class for NetKet graph objects.

Concrete Classes

Below you find a list of all concrete classes that you can use.

Graph	A simple implementation of Graph based on an external graph library.
Lattice	A lattice built by periodic arrangement of a given unit cell.
Edgeless	Construct a set graph (collection of unconnected vertices).
lattice.LatticeSite	Contains information about a single Lattice site.

Pre-built Lattices

Simple hypercubic lattices

Grid	Constructs a hypercubic lattice given its extent in all dimensions.
Hypercube	Constructs a hypercubic lattice with equal side length in all dimensions.
Square	Constructs a square lattice of side length Periodic boundary conditions can also be imposed
Cube	Constructs a cubic lattice of side length Periodic boundary conditions can also be imposed

Other lattices

Chain	Constructs a chain of length sites.
Triangular	Constructs a triangular lattice of a given spatial extent.
Honeycomb	Constructs a honeycomb lattice of a given spatial extent.
KitaevHoneycomb	Constructs a honeycomb lattice of a given spatial extent.
Kagome	Constructs a kagome lattice of a given spatial extent.
BCC	Constructs a BCC lattice of a given spatial extent.
FCC	Constructs an FCC lattice of a given spatial extent.
Diamond	Constructs a diamond lattice of a given spatial extent.
Pyrochlore	Constructs a pyrochlore lattice of a given spatial extent.

Handling lattice symmetries

space_group.SpaceGroup	Class to handle the space group symmetries of a Lattice.
space_group.TranslationGroup	Class to handle translation symmetries of a Lattice.

Additional functions

DoubledGraph(graph)	Constructs a DoubledGraph representing the doubled hilbert space of a density operator.
disjoint_union(*graphs)	Returns the ordered disjoint union of the input graphs.