C. H. Bennett & G. Brassard (1984):
Quantum Cryptography: Public-key Distribution and Coin Tossing.
In: IEEE Conf. on Comp., Sys. and Sig. Proc..
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres & W. K. Wootters (1993):
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.
Phys. Rev. Lett. 70,
pp. 1895–1899,
doi:10.1103/PhysRevLett.70.1895.
R. Canetti (2001):
Universally Composable Security: A New Paradigm for Cryptographic Protocols.
In: 42nd IEEE Symp. Found. Comp. Sci.,
doi:10.1109/SFCS.2001.959888.
T. Davidson, S. J. Gay, H. Mlnař\'ık, R. Nagarajan & N. Papanikolaou (2011):
Model Checking for Communicating Quantum Processes.
International Journal of Unconventional Computing.
(to appear).
T. A. S. Davidson (2011):
Formal Verification Techniques using Quantum Process Calculus.
University of Warwick.
D. Deutsch & R. Jozsa (1992):
Rapid solutions of problems by quantum computation.
Proceedings of the Royal Society of London A 439(1907),
pp. 553–558,
doi:10.1098/rspa.1992.0167.
Y. Feng, R. Duan & M. Ying (2011):
Bisimulation for quantum processes.
In: 38th ACM Symp. on Principles of Prog. Langs.,
doi:10.1145/1926385.1926446.
S. J. Gay & R. Nagarajan (2005):
Communicating Quantum Processes.
In: 32nd ACM Symp. on Principles of Prog. Langs.,
doi:10.1145/1040305.1040318.
Also arXiv:quant-ph/0409052.
S. J. Gay & R. Nagarajan (2006):
Types and typechecking for Communicating Quantum Processes.
Mathematical Structures in Computer Science 16(3),
pp. 375–406,
doi:10.1017/S0960129506005263.
S. J. Gay, N. Papanikolaou & R. Nagarajan (2008):
QMC: a model-checker for quantum systems.
In: Proceedings of the 20th International Conference on Computer Aided Verification (CAV),
Springer LNCS 5123,
pp. 543–547,
doi:10.1007/978-3-540-70545-1_51.
S. J. Gay, N. Papanikolaou & R. Nagarajan (2010):
Specification and verification of quantum protocols.
In: Semantic Techniques in Quantum Computation.
Cambridge University Press.
L. Grover (1996):
A Fast Quantum Mechanical Algorithm for Database Search.
In: Proc. 28th Annual ACM Symposium on the Theory of Computation.
ACM Press,
pp. 212–219,
doi:10.1145/237814.237866.
P. Jorrand & M. Lalire (2004):
Toward a Quantum Process Algebra.
In: 1st ACM Conf. on Computing Frontiers,
doi:10.1145/977091.977108.
M. Lalire (2006):
Relations among quantum processes: bisimilarity and congruence.
Math. Struct. Comp. Sci. 16(3),
pp. 407–428,
doi:10.1017/S096012950600524X.
D. Mayers (2001):
Unconditional Security in Quantum Cryptography.
J. ACM 48(3),
pp. 351–406,
doi:10.1145/382780.382781.
R. Nagarajan & S. J. Gay (2002):
Formal Verification of Quantum Protocols.
arXiv:quant-ph/0203086.
N. K. Papanikolaou (2009):
Model Checking Quantum Protocols.
University of Warwick.
P. W. Shor (1994):
Algorithms for quantum computation: discrete logarithms and factoring.
In: 35th IEEE Symp. Found. Comp. Sci.,
doi:10.1109/SFCS.1994.365700.
N. Trčka & S. Georgievska (2008):
Branching bisimulation congruence for probabilistic systems.
Electronic Notes in Theoretical Computer Science 220(3),
pp. 129–143,
doi:10.1016/j.entcs.2008.11.023.
M. Ying, Y. Feng, R. Duan & Z. Ji (2009):
An algebra of quantum processes.
ACM Trans. Comp. Logic 10(3),
pp. 19,
doi:10.1145/1507244.1507249.
eptcs@eptcs.org