Anders and Briegel in Python
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.
Pete Shadbolt 6c42ca2b3c Remove useless functions from anders_briegel.js pirms 8 gadiem
abp Remove useless functions from anders_briegel.js pirms 8 gadiem
bin More robust reconnect on server restart. pirms 8 gadiem
doc Cleaner docs: index.rst pirms 8 gadiem
examples Starting to work on stripping out abp.js pirms 8 gadiem
tests Can now sketchily delete nodes. Needs work. pirms 8 gadiem
.bumpversion.cfg Bump version: 0.4.15 → 0.4.16 pirms 8 gadiem
.gitignore Update version to 0.4.3 pirms 8 gadiem
MANIFEST.in Pratting with MANIFEST pirms 8 gadiem
README.md Update README.md pirms 8 gadiem
TODO.mkd Makefiles pirms 8 gadiem
makefile Makefiles pirms 8 gadiem
setup.py Bump version: 0.4.15 → 0.4.16 pirms 8 gadiem

README.md

abp

Python port of Anders and Briegel’ s method for fast simulation of Clifford circuits. You can read the full documentation here.

demo

Installation

It's easiest to install with pip:

$ pip install --user abp

Or clone and install in develop mode:

$ git clone https://github.com/peteshadbolt/abp.git
$ cd abp
$ python setup.py develop --user
$ python setup.py develop --user --prefix=  # Might be required on OSX

Visualization

abp comes with a tool to visualize graph states in a web browser. It uses a client-server architecture.

First, run abpserver in a terminal:

$ abpserver
Listening on port 5000 for clients..

Then browse to http://localhost:5001/. Alternatively, abpserver -v will automatically pop a browser window.

Now, in another terminal, use abp.fancy.GraphState to run a Clifford circuit:

>>> from abp.fancy import GraphState
>>> g = GraphState(range(10))
>>> for i in range(10):
...     g.act_hadamard(i)
... 
>>> g.update()
>>> for i in range(9):
...     g.act_cz(i, i+1)
... 
>>> g.update()

And you should see a visualization of the state:

demo

Testing

abp has a bunch of tests. You can run them all with nose:

$ nosetests
53 tests run in 39.5 seconds (53 tests passed)

Currently I use some reference implementations of chp and graphsim which you won't have installed, so some tests will be skipped. That's expected.