bachelor_thesis/thesis/main.bib

304 lines
8.8 KiB
BibTeX

@online{
numpy,
url={https://numpy.org/},
urldate={19.09.2019},
author={NumPy developers},
title={NumPy},
note={https://numpy.org/},
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,
note={https://docs.scipy.org/doc/numpy/reference/generated/numpy.array.html},
}
@online{
CHP,
url={https://www.scottaaronson.com/chp/},
urldate={09.03.2020},
author={Scott Aaronson and Daniel Gottesman},
title={CHP: CNOT-Hadamard-Phase},
year=2005,
note={https://www.scottaaronson.com/chp/}
}
@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},
note={http://arxiv.org/abs/quant-ph/0504117v2},
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 and 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 and 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 and 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 and Renato Portugal and 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}
}
@online{
pyqcs,
url={https://github.com/daknuett/pyqcs},
urldate={13.01.2020},
author={Daniel Knüttel},
title={PyQCS},
year=2020,
note={https://github.com/daknuett/pyqcs},
}
@article{
hein_eisert_briegel2008,
title={Multi-party entanglement in graph states},
year=2008,
author={M. Hein and J. Eisert and H.J. Briegel},
note={https://arxiv.org/abs/quant-ph/0307130v7}
}
@article{
lehner2019,
title={Lecture Notes on Quantum Computing SS 2019},
year=2019,
author={Christoph Lehner},
note={Unpublished Work}
}
@online{
timeit,
title={timeit — Measure execution time of small code snippets},
url={https://docs.python.org/3.5/library/timeit.html},
urldate={13.03.2020},
year=2020,
note={https://docs.python.org/3.5/library/timeit.html}
}
@online{
openqasm,
url={https://github.com/QISKit/openqasm},
urldate={19.09.2019},
title={GitHub - Quiskit/openqasm},
author={Jay Gambetta et al.},
note={https://github.com/QISKit/openqasm},
year=2019
}
@online{
ibmq,
url={https://www.ibm.com/quantum-computing/learn/what-is-quantum-computing/},
urldate={19.09.2019},
title={IBM Q - What is quantum computing?},
author={IBM},
note={https://www.ibm.com/quantum-computing/learn/what-is-quantum-computing/},
year=2019
}
@online{
intelqc,
url={https://newsroom.intel.com/press-kits/quantum-computing/\#gs.2s0dux},
note={https://newsroom.intel.com/press-kits/quantum-computing/\#gs.2s0dux},
urldate={19.09.2019},
title={Intel Press Kit: Quantum Computing},
author={Intel},
year=2019
}
@online{
microsoftqc,
url={https://www.microsoft.com/en-us/quantum/default.aspx},
note={https://www.microsoft.com/en-us/quantum/default.aspx},
urldate={19.09.2019},
title={Quantum Computing | Microsoft},
author={Microsoft},
year=2019
}
@online{
dwavesys,
url={https://www.dwavesys.com/quantum-computing},
note={https://www.dwavesys.com/quantum-computing},
urldate={19.09.2019},
title={Quantum Computing | D-Wave Systems},
author={D-Wave Systems Inc}
}
@online{
lrzqc,
url={https://www.lrz.de/wir/newsletter/2019-08/\#LRZ_bereit_fuer_bayerische_Quantechnologie},
note={https://www.lrz.de/wir/newsletter/2019-08/\#LRZ_bereit_fuer_bayerische_Quantechnologie},
urldate={19.09.2019},
title={LRZ-Newsletter Nr. 08/2019 vom 01.08.2019},
author={S. Vieser},
year=2019
}
@online{
heise25_18,
url={https://www.heise.de/select/ct/2018/25/1544250249368810},
note={https://www.heise.de/select/ct/2018/25/1544250249368810},
urldate={19.09.2019},
title={Europa entfesselt Quanten-Power},
author={Arne Grävemeyer},
year=2018
}
@article{
li_chen_fisher2019,
year=2019,
author={Yaodong Li and Xiao Chen and Matthew P. A. Fisher},
title={Measurement-driven entanglement transition in hybrid quantum circuits},
note={https://arxiv.org/abs/1901.08092}
}
@article{
bermejovega_lin_vdnest2015,
year=2015,
author={Juan Bermejo-Vega and Cedric Yen-Yu Lin and Maarten Van den Nest},
title={Normalizer circuits and a Gottesman-Knill theoremfor infinite-dimensional systems},
note={https://arxiv.org/pdf/1409.3208.pdf}
}
@article{
vandennest2019,
year=2019,
author={Maarten Van den Nest},
title={Classical simulation of quantum computation,the Gottesman-Knill theorem, and slightly beyond},
note={https://arxiv.org/pdf/0811.0898v1.pdf}
}
@article{
vandennest2018,
year=2018,
author={Maarten Van den Nest},
title={Efficient classical simulations of quantum Fourier transforms and normalizer circuits over Abelian groups},
note={https://arxiv.org/abs/1201.4867v1}
}
@article{
bermejovega_vdnest2018,
year=2018,
author={Juan Bermejo-Vega and Maarten Van den Nest},
title={Classical simulations of Abelian-group normalizer circuits with intermediate measurements},
note={https://arxiv.org/abs/1210.3637v2}
}
@MISC {21732,
TITLE = {Why and how is a quantum computer faster than a regular computer?},
AUTHOR = {babou (https://cs.stackexchange.com/users/8321/babou)},
HOWPUBLISHED = {Computer Science Stack Exchange},
NOTE = {URL:https://cs.stackexchange.com/q/21732 (version: 2014-02-17)},
EPRINT = {https://cs.stackexchange.com/q/21732},
URL = {https://cs.stackexchange.com/q/21732}
}
@MISC {uwaterloo,
TITLE = {Quantum computing 101},
AUTHOR = {University of Waterloo: Institute for Quantum Computing},
NOTE = {https://uwaterloo.ca/institute-for-quantum-computing/quantum-computing-101\#Quantum-effects-matter},
URL = {https://uwaterloo.ca/institute-for-quantum-computing/quantum-computing-101\#Quantum-effects-matter}
}
@MISC{
benchmarkgame,
author={The Computer Language Benchmarks Game Contributors},
title={The Computer Language Benchmarks Game},
note={https://benchmarksgame-team.pages.debian.net/benchmarksgame/}
}
@article{
bouchet1991,
author={Andrk Bouchet},
title={Recognizing locally equivalent graphs},
year=1991,
note={https://pdf.sciencedirectassets.com/271536/1-s2.0-S0012365X00X02166/1-s2.0-0012365X9390357Y/main.pdf}
}