#include <PyNet.h>
Inheritance diagram for PyNet:

Public Types | |
| typedef complex< double > | cdouble |
Public Member Functions | |
| PyNet (double d) | |
| Usual constructor via a desired tile 'width'. | |
| PyNet (string s) | |
| Accepts a filename and loads a pre-saved Net from it. | |
| ~PyNet () | |
| DESTROY THEM ALL. | |
| void | save (std::string file) |
| Save a generated Net into a file. | |
| void | generate (dict &d, int max_depth) |
| Accepts a python dictionary mapping gate labels => matrices. | |
| std::string | approximate (boost::python::list &m) |
| Return the closest approximating sequence to a matrix. | |
| boost::python::list | evaluate (std::string s) |
| Evaluate a string and return the resulting matrix as a flat list. | |
| boost::python::list | solovay_kitaev (boost::python::list &m, int d) |
| Wrap the Solovay-Kitaev function. | |
|
|
Reimplemented from Net. |
|
|
Usual constructor via a desired tile 'width'.
|
|
|
Accepts a filename and loads a pre-saved Net from it.
|
|
|
DESTROY THEM ALL.
|
|
|
Return the closest approximating sequence to a matrix. The matrix needs to be passed as a flat list of length 4 |
|
|
Evaluate a string and return the resulting matrix as a flat list.
|
|
||||||||||||
|
Accepts a python dictionary mapping gate labels => matrices. Matrices should be passed as a flat list |
|
|
Save a generated Net into a file.
|
|
||||||||||||
|
Wrap the Solovay-Kitaev function. Python has no concept of the Net::knot, or of the Matrix<cdouble>, so we'll return everything as a flat list and deal with it in the sk module |
1.4.1