%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/


%% Created for Ali JavadiAbhari at 2016-07-08 16:32:31 -0500 


%% Saved with string encoding Unicode (UTF-8) 



@inproceedings{scaffcc,
	Acmid = {2597939},
	Address = {New York, NY, USA},
	Articleno = {1},
	Author = {JavadiAbhari, Ali and Patil, Shruti and Kudrow, Daniel and Heckey, Jeff and Lvov, Alexey and Chong, Frederic T. and Martonosi, Margaret},
	Booktitle = {Proceedings of the 11th ACM Conference on Computing Frontiers},
	Date-Modified = {2016-07-08 21:32:31 +0000},
	Doi = {10.1145/2597917.2597939},
	Isbn = {978-1-4503-2870-8},
	Keywords = {compilers, quantum computation, reversible logic},
	Location = {Cagliari, Italy},
	Numpages = {10},
	Pages = {1:1--1:10},
	Publisher = {ACM},
	Series = {CF '14},
	Title = {{S}caff{CC}: A Framework for Compilation and Analysis of Quantum Computing Programs},
	Url = {http://doi.acm.org/10.1145/2597917.2597939},
	Year = {2014},
	Bdsk-Url-1 = {http://doi.acm.org/10.1145/2597917.2597939},
	Bdsk-Url-2 = {http://dx.doi.org/10.1145/2597917.2597939}}

@inproceedings{rev,
	Author = {Mathias Soeken and Stefan Frehse and Robert Wille and Rolf Drechsler},
	Booktitle = {Reversible Computation 2011},
	Note = {{RevKit is available at www.revkit.org}},
	Pages = {64--76},
	Series = {Lecture Notes in Computer Science},
	Title = {{RevKit}: An Open Source Toolkit for the Design of Reversible Circuits},
	Volume = 7165,
	Year = 2012}

@article{adder,
	Abstract = {A serious obstacle to large-scale quantum algorithms is the large number of elementary gates, such as the controlled-NOT gate or Toffoli gate. Herein, we present an improved linear-depth ripple-carry quantum addition circuit, which is an elementary circuit used for quantum computations. Compared with previous addition circuits costing at least two Toffoli gates for each bit of output, the proposed adder uses only a single Toffoli gate. Moreover, our circuit may be used to construct reversible circuits for modular multiplication, C                            x mod M with x < M, arising as components of Shor's algorithm. Our modular-multiplication circuits are simpler than previous constructions, and may be used as primitive circuits for quantum computations.},
	Author = {Wang, Feng and Luo, Mingxing and Li, Huiran and Qu, Zhiguo and Wang, Xiaojun},
	Doi = {10.1007/s11432-015-5411-x},
	Issn = {1869-1919},
	Journal = {Science China Information Sciences},
	Pages = {1--8},
	Title = {Improved quantum ripple-carry addition circuit},
	Url = {http://dx.doi.org/10.1007/s11432-015-5411-x},
	Year = {2016},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/s11432-015-5411-x}}

@misc{Cuccaro,
	Author = {Cuccaro, Steven A. and Draper, Thomas G. and Kutin, Samuel A. and Moulton, David Petrie},
	Month = {Sep},
	Title = {A new quantum ripple-carry addition circuit},
	Year = {2004}}

@inproceedings{LLVM, 
    Author = {Chris Lattner and Vikram Adve},
    Title = {{LLVM}: A Compilation Framework for Lifelong Program Analysis and Transformation},
    BookTitle = {Proceedings of the 2004 International Symposium on Code Generation and Optimization},
    Address = {Palo Alto, California},
    Month = {Mar},
    Year = {2004},
    Pages = {75--88}}