marekyggdrasil

import numpy as np


# ECC addition in R
def eccContAddition(Px, Py, Qx, Qy, a, b):
    if np.isclose([Px], [Qx])[0]:
        m = (3.*Px**2.+a)/(2.*Py)
    else:
        m = (Py-Qy)/(Px-Qx)
    Rx = m**2 - Px - Qx

marekyggdrasil

p cnf 3 3
1 -2 3 0
1 2 -3 0
-1 -2 3 0

marekyggdrasil

from constraint import Problem

problem = Problem()

problem.addVariable('x', range(1, 10))
problem.addVariable('y', range(1, 10))
problem.addVariable('z', range(1, 10))


def constraintCheck(x, y, z):

marekyggdrasil

marekyggdrasil

#!/usr/bin/env python
# -*- coding:utf-8 vi:ts=4:noexpandtab
# Simple RTSP server. Run as-is or with a command-line to replace the default pipeline

import time
import sys
import abc
import numpy as np
import typing as typ
from fractions import Fraction

marekyggdrasil

This is code repository for Quantum Adiabatic Optimization article.

Start by running instance.py that will build list-based definiton of the graph from its set-based definition, this will let you keep consistent indices between all the runs.

The run.py is the adiabatic optimization code.

Energy spectrum can be examined by running eigenenergies.py with single command line argument being one of HMVC, HMVC_, HMIS or HMIS_. I don't suggest running all the diagonalizations in single run, graphs are big and you are likely to get a segmentation fault error. This is why it is good to keep consistent indices and store your graph using lists and not sets.

You can plot figures using plot.py.

marekyggdrasil

Keybase proof

I hereby claim:

• I am marekyggdrasil on github.
• I am renzokuken (https://keybase.io/renzokuken) on keybase.
• I have a public key ASBlmYD61f2p1NbjpbpO7pCJH_4zOEmIbMry26gc4P7lIAo

To claim this, I am signing this object:

marekyggdrasil

marekyggdrasil

import numpy as np

import itertools

from qutip import basis, tensor, rand_ket, snot, cnot, rx, rz, qeye

# create random state
psi = rand_ket(2)

# initial state

marekyggdrasil