Anders and Briegel in Python
Du kannst nicht mehr als 25 Themen auswählen Themen müssen entweder mit einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.
Pete Shadbolt bd55821c11 Add an example of 2D grid generation (#12) vor 8 Jahren
abp Remove redundant debug option vor 8 Jahren
bin Update server, some small docs vor 8 Jahren
doc Cleaner docs: index.rst vor 8 Jahren
examples Add an example of 2D grid generation (#12) vor 8 Jahren
tests Fix #7 -- alias literal clifford.by_names vor 8 Jahren
.bumpversion.cfg Bump version: 0.4.15 → 0.4.16 vor 8 Jahren
.gitignore Update version to 0.4.3 vor 8 Jahren
MANIFEST.in Pratting with MANIFEST vor 8 Jahren
README.md Update README.md vor 8 Jahren
TODO.mkd Makefiles vor 8 Jahren
makefile Makefiles vor 8 Jahren
setup.py Bump version: 0.4.15 → 0.4.16 vor 8 Jahren

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.