t b a b a

LIST OF REFERENCES
[AAK01] D. Aharonov, A. Ambainis, J. Kempe, and U. V. Vazirani. “Quantum walks on
graphs.” In ACM Symposium on Theory of Computing, pp. 50–59, 2001.
[Aar05] S. Aaronson. “Quantum Computing, Postselection, and Probabilistic Polynomial-
Time.” Proceedings of the Royal Society A, 461(2063):3473–3482, December 2005.
[AB06] S. Anders and H. J. Briegel. “Fast Simulation of Stabilizer Circuits Using a Graphstate
Representation.” Phys. Rev. A, 73(2):022334–+, February 2006.
[AG04] S. Aaronson and D. Gottesman. “Improved Simulation of Stabilizer Circuits.”
Physical Review A (Atomic, Molecular, and Optical Physics), 70(5):052328, 2004.
[AHH02] R. Alicki, M. Horodecki, P. Horodecki, and R. Horodecki. “Dynamical Description
of Quantum Computing: Generic Nonlocality of Quantum Noise.” Phys. Rev. A,
65(6):062101–+, June 2002.
[Amb07] A. Ambainis. “Quantum Walk Algorithm for Element Distinctness.” SIAM Journal
on Computing, 37(1):210–239, 2007.
[BBB92] C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin. “Experimental
Quantum Cryptography.” J. Cryptol., 5(1):3–28, 1992.
[BBB97] C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. “Strengths and Weaknesses
of Quantum Computing.” SIAM J. Comput., 26(5):1510–1523, 1997.
[BBC93] C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters.
“Teleporting an Unknown Quantum State via Dual Classical and Einstein-
Podolsky-Rosen Channels.” Phys. Rev. Lett., 70(13):1895–1899, Mar 1993.
[BDE95] A. Barenco, D. Deutsch, A. Ekert, and R. Jozsa. “Conditional Quantum Dynamics
and Logic Gates.” Phys. Rev. Lett., 74(20):4083–4086, May 1995.
[BHM02] G. Brassard, P. Høyer, M. Mosca, and A. Tapp. “Quantum Amplitude Amplification
and Estimation.” AMS Contemporary Mathematics, 305:53–74, 2002.
[BHT98] G. Brassard, P. Høyer, and A. Tapp. “Quantum Counting.” Lecture Notes in
Computer Science, 1443:820+, 1998.
106