Anders and Briegel in Python
No puede seleccionar más de 25 temas Los temas deben comenzar con una letra o número, pueden incluir guiones ('-') y pueden tener hasta 35 caracteres de largo.
Pete Shadbolt 51a6b8972d Update stress test hace 8 años
abp Remove legacy HTML/JS, deterministic server hace 8 años
bin Remove extraneous print statements from abpserver hace 8 años
doc Bump version: 0.4.20 → 0.4.21 hace 8 años
examples Update stress test hace 8 años
tests Move DETERMINISTIC to a library setting hace 8 años
.bumpversion.cfg Bump version: 0.4.20 → 0.4.21 hace 8 años
.gitignore Update version to 0.4.3 hace 8 años
MANIFEST.in Pratting with MANIFEST hace 8 años
README.md Bump version: 0.4.20 → 0.4.21 hace 8 años
TODO.mkd Makefiles hace 8 años
makefile I think you no longer have to register with pypi hace 8 años
setup.py Bump version: 0.4.20 → 0.4.21 hace 8 años

README.md

abp 0.4.21

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

Installation

It's easiest to install with pip:

$ pip install --user abp==0.4.21

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(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.

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.