iqm.benchmarks.compressive_gst.mgst.algorithm

The main algorithm and functions that perform iteration steps.

Functions

A_SFN_riem_Hess(K, A, B, y, J[, lam, mle])	Riemannian saddle free Newton step on the POVM parametrization.
B_SFN_riem_Hess(K, A, B, y, J[, lam, mle])	Riemannian saddle free Newton step on the initial state parametrization.
SFN_riem_Hess(K, E, rho, y, J[, lam, ls, ...])	Riemannian saddle free Newton step on each gate individually.
SFN_riem_Hess_full(K, E, rho, y, J[, lam, ...])	Riemannian saddle free Newton step on product manifold of all gates.
gd(K, E, rho, y, J[, fixed_gates, mle])	Do Riemannian gradient descent optimization step on gates.
optimize(y, J, method, K, rho, A, B, ...[, mle])	Full gate set optimization update alternating on E, K and rho.
run_mGST(args[, method, max_inits, ...])	Main mGST routine.