<bibliography>
 <citation type="inproceedings" key="Maple-PVS:TPHOLS01">
  <author>Andrew <surname>Adams</surname></author>
  <author>Martin <surname>Dunstan</surname></author>
  <author>Hanne <surname>Gottliebsen</surname></author>
  <author>Tom <surname>Kelsey</surname></author>
  <author>Ursula <surname>Martin</surname></author>
  <author>Sam <surname>Owre</surname></author>
  <year>2001</year>
  <title>Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS</title>
  <editor>Richard J. <surname>Boulton</surname></editor>
  <editor>Paul B. <surname>Jackson</surname></editor>
  <booktitle>Theorem Proving in Higher Order Logics, TPHOLs 2001</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>2152</volume>
  <publisher>Springer-Verlag</publisher>
  <address>Edinburgh, Scotland</address>
  <pages>27&#8211;42</pages>
  <doi>10.1007/3-540-44755-5_4</doi>
 </citation>
 <citation type="article" key="AkPa:metitarski">
  <author>Behzad <surname>Akbarpour</surname></author>
  <author>Lawrence Charles <surname>Paulson</surname></author>
  <year>2010</year>
  <title>MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>44</volume>
  <pages>175&#8211;205</pages>
  <doi>10.1007/s10817-009-9149-2</doi>
 </citation>
 <citation type="article" key="GaKa:acl2r">
  <author>R. <surname>Gamboa</surname></author>
  <author>M. <surname>Kaufmann</surname></author>
  <year>2001</year>
  <title>Nonstandard analysis in ACL2</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>27</volume>
  <number>4</number>
  <pages>323&#8211;351</pages>
  <doi>10.1023/A:1011908113514</doi>
 </citation>
 <citation type="phdthesis" key="Har:phd">
  <author>J. <surname>Harrison</surname></author>
  <year>1996</year>
  <title>Theorem Proving with the Real Numbers</title>
  <school>University of Cambridge</school>
 </citation>
 <citation type="inproceedings" key="KaFr:cas-hol">
  <author>Cezary <surname>Kaliszyk</surname></author>
  <author>Freek <surname>Wiedijk</surname></author>
  <year>2007</year>
  <title>Certified Computer Algebra on Top of an Interactive Theorem Prover</title>
  <booktitle>Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference</booktitle>
  <series>Calculemus '07 / MKM '07</series>
  <publisher>Springer-Verlag</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>94&#8211;105</pages>
  <doi>10.1007/978-3-540-73086-6_8</doi>
 </citation>
 <citation type="article" key="KM:ACL2-industrial">
  <author>M. <surname>Kaufmann</surname></author>
  <author>J S. <surname>Moore</surname></author>
  <year>1997</year>
  <title>An Industrial Strength Theorem Prover for a Logic Based on Common Lisp</title>
  <journal>IEEE Transactions on Software Engineering</journal>
  <volume>23</volume>
  <number>4</number>
  <pages>203&#8211;213</pages>
  <doi>10.1109/32.588534</doi>
 </citation>
 <citation type="book" key="McMahon:quantum-computing">
  <author>David <surname>McMahon</surname></author>
  <year>2008</year>
  <title>Quantum Computing Explained</title>
  <publisher>Wiley &#38; Sons</publisher>
 </citation>
 <citation type="misc" key="Vazirani:quantum-notes">
  <author>Umesh V. <surname>Vazirani</surname></author>
  <year>2012</year>
  <title>Course Notes for Quantum Mechanics and Quantum Computation</title>
  <howpublished>https://www.edx.org/courses/BerkeleyX/CS191x/2013_Spring/about, previously on www.coursera.org</howpublished>
 </citation>
 <citation type="book" key="YaMa:quantum-computing">
  <author>Noson S. <surname>Yanofsky</surname></author>
  <author>Mirco A. <surname>Mannucci</surname></author>
  <year>2008</year>
  <title>Quantum Computing for Computer Scientists</title>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/CBO9780511813887</doi>
 </citation>
</bibliography>
