@online{
    numpy,
    url={https://numpy.org/},
    urldate={19.09.2019},
    author={NumPy developers},
    title={NumPy},
    year=2019
}

@online{
    numpy_array,
    url={https://docs.scipy.org/doc/numpy/reference/generated/numpy.array.html},
    urldate={19.09.2019},
    author={NumPy developers},
    title={numpy.array -- NumPy v1.17 Manual},
    year=2019
}

@online{
    numpy_ufunc,
    url={https://docs.scipy.org/doc/numpy/reference/ufuncs.html},
    urldate={19.09.2019},
    author={NumPy developers},
    title={Universal functions (ufunc) -- NumPy v1.17 Manual},
    year=2019
}
@article{
    andersbriegel2005,
    title={Fast simulation of stabilizer circuits using a graph state representation},
    author={Simon Anders and Hans J. Briegel},
    year=2005
}
@book{
    wuest1995,
    title={Höhere Mathematik Für Physiker Teil 1},
    author={Rainer Wüst},
    year=1995,
    publisher={de Gruyter}
}
@book{
    kaye_ea2007,
    title={An Introduction to Quantum Computing},
    author={Phillip Kaye, Raymond Laflamme and Michelle Mosca},
    year=2007,
    publisher={Oxford University Press}
}
@article{
    gottesman2009,
    title={An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation},
    year=2009,
    author={Daniel Gottesman},
    note={https://arxiv.org/abs/0904.2557v1}
}

@article{
    gottesman1997,
    title={Stabilizer Codes and Quantum Error Correction},
    year=1997,
    author={Daniel Gottesman},
    note={https://arxiv.org/abs/quant-ph/9705052}
}

@article{
    gottesman_aaronson2008,
    title={Improved Simulation of Stabilizer Circuits},
    year=2008,
    author={Daniel Gottesman, Scott Aaronson},
    note={https://arxiv.org/abs/quant-ph/0406196v5}
}

@article{
    schlingenmann2001,
    title={Stabilizer codes can be realized as graph codes},
    year=2001,
    author={D. Schlingemann},
    note={https://arxiv.org/abs/quant-ph/0111080v1}
}

@article{
    vandennest_ea2004,
    title={Graphical description of the action of local Clifford transformations on graph states},
    year=2004,
    author={Maarten Van den Nest et al.},
    note={PhysRevA.69.022316}
}

@article{
    dahlberg_ea2019,
    title={Counting single-qubit Clifford equivalent graph states is \#P-Complete},
    year=2019,
    author={Axel Dahlberg et al.},
    note={https://arxiv.org/abs/1907.08024v1}
}
@book{
    nielsen_chuang_2010,
    title={Quantum Computation and Quantum Information},
    year=2010,
    author={Michael A. Nielsen, Isaac L. Chuang},
    publisher={CAMBRIDGE UNIVERSITY PRESS},
    note={www.cambridge.org/9781107002173}
}

@article{
    gottesman2008,
    title={The Heisenberg Representation of Quantum Computers},
    year=2008,
    author={Daniel Gottesman},
    note={https://arxiv.org/abs/quant-ph/9807006}
}

@book{
    marquezino_ea_2019,
    title={A Primer on Quantum Computing},
    year=2019,
    author={Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor},
    publisher={Springer}
}
@article{
    barenco_ea_1995,
    title={Elementary gates for quantum computation},
    year=1995,
    author={Adriano Barenco et al.},
    note={https://journals.aps.org/pra/pdf/10.1103/PhysRevA.52.3457}
}
@article{
    shor1995,
    title={Scheme for reducing decoherence in quantum computer memory},
    year=1995,
    author={Peter Shor},
    note={https://journals.aps.org/pra/pdf/10.1103/PhysRevA.52.R2493}
}
