Gerhard W. Dueck D. Michael Miller (Eds.) 8 Reversible 4 9 7 S Computation C N L 5th International Conference, RC 2013 Victoria, BC, Canada, July 2013 Proceedings 123 Lecture Notes in Computer Science 7948 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany Gerhard W. Dueck D. Michael Miller (Eds.) Reversible Computation 5th International Conference, RC 2013 Victoria, BC, Canada, July 4-5, 2013 Proceedings 1 3 VolumeEditors GerhardW.Dueck UniversityofNewBrunswick FacultyofComputerScience 550WindsorStreet Fredericton,NBE3B5A3,Canada E-mail:[email protected] D.MichaelMiller UniversityofVictoria DepartmentofComputerScience Victoria,BCV8W2Y2,Canada E-mail:[email protected] ISSN0302-9743 e-ISSN1611-3349 ISBN978-3-642-38985-6 e-ISBN978-3-642-38986-3 DOI10.1007/978-3-642-38986-3 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2013940507 CRSubjectClassification(1998):B.6.1,F.3.1-2,F.1.1-2,J.2,F.2.2,D.2.11-13,D.4.7 LNCSSublibrary:SL2–ProgrammingandSoftwareEngineering ©Springer-VerlagBerlinHeidelberg2013 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation, broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection withreviewsorscholarlyanalysisormaterialsuppliedspecificallyforthepurposeofbeingenteredand executedonacomputersystem,forexclusiveusebythepurchaserofthework.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheCopyrightLawofthePublisher’slocation, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Permissionsforuse maybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violationsareliabletoprosecution undertherespectiveCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Whiletheadviceandinformationinthisbookarebelievedtobetrueandaccurateatthedateofpublication, neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityforanyerrorsor omissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,withrespecttothe materialcontainedherein. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface Reversiblecomputing is amodel ofcomputing wherethe computationalprocess isinsomemeasurereversible,eitherin alogicalorphysicalsense,andincertain areas, both. Reversible computation is of importance to a broad range of areas ofcomputerscience,engineering,mathematics,andphysicsincludinglow-power circuitdesign,coding/decoding,programdebugging,testing,databases,discrete event simulation, reversible algorithms, reversible specification formalisms, re- versibleprogramminglanguages,processalgebras,andthemodelingofbiochem- ical systems. Furthermore, reversible logic provides a basis for describing and workingwith quantumcomputationandits applicationsas wellas otheremerg- ing computational technologies. RC 2013 was the fifth in a series of annual meetings designed to gather researchersfor the disseminationanddiscussionof novelresults andconcepts in all aspects of reversible computation. The first four events were held in York, UK(2009),Bremen,Germany(2010),Ghent,Belgium(2011),andCopenhagen, Denmark (2012). RC 2013 was thus the first of the meetings to be held outside Europe. This volume comprises the proceedings for RC 2013. The RC 2013 program included two invited presentations. The first presen- tation, by Barry C. Sanders, Director, Institute for Quantum Science & Tech- nology, University of Calgary, Canada, addressed the challenges of “Efficiently Designing Quantum Circuits for Efficient Quantum Simulation.” The full paper appears in these proceedings. The invited presentation by Michele Mosca, Deputy Director Academic, In- stitute for Quantum Computing, University of Waterloo, Canada, addressed “Quantum Computing and the Synthesis and Optimization of Quantum Cir- cuits.” Mosca’s presentation considered recent tremendous experimental ad- vancesincontrollingquantumsystemsandtherelatedimpressiveprogressinthe theoryoffault-tolerantquantumerrorcorrection,whichhasgreatlyreducedthe experimental ‘thresholds’ that would enable efficiently scalable quantum com- putingsystems.Aslargerandlargerquantumcomputersarebuilt,therewillbea greaterneedforautomatedmethodsformappinghigh-levelquantumalgorithms into operations to be executed on physical devices. The efficient synthesis and optimization of quantum circuits is a critical step in this process. Mosca high- lighted some recent advances using a range of mathematical tools. Thecallforpapersattracted37submissionsby90authorsfrom14countries. All contributed papers were reviewedby at leastthree members of the RC 2013 Program Committee or their designated subreviewers. Based on those reviews andextensivediscussionbytheProgramCommittee,19paperswereselectedfor presentationatRC 2013to makeupsessionsonphysicalimplementation, arith- metic, programmingand data structures, modeling, synthesis andoptimization, as well as alternative technologies. VI Preface ThelistofProgramCommitteemembersisprovidedelsewhereinthisvolume. Wetakethisopportunitytothankthese15expertsfromacrosstheinternational reversible computation community for their hard work and dedication to the qualityofRC2013.Wealsothankthe20additionalreviewersfortheirimportant contributions. It has been our great pleasure to serve as Program Co-chairs for RC 2013 and as editors for these proceedings. Financial support for RC 2013 was provided by the Pacific Institute for the Mathematical Sciences and by the Department of Computer Science, Faculty of Engineering, and the Office of the Vice-President Research at the University of Victoria. We also acknowledge organizational support provided by Lisa Jung- mann and Robert Wille, University of Bremen, and by Derek Church, Michelle Fuller, and Marleen Willems, University of Victoria. To conclude, we offer our sincere appreciation to Anna Kramer and Elke Werner,Springer,Heidelberg,Germany,fortheirassistanceandguidanceinthe preparation of these proceedings. July 2013 Gerhard W. Dueck D. Michael Miller Organization Program Committee Chairs Gerhard W. Dueck University of New Brunswick, Canada D. Michael Miller University of Victoria, Canada Program Committee Holger Bock Axelsen University of Copenhagen, Denmark St´ephane Burignat University of Ghent, Belgium Alexis De Vos University of Ghent, Belgium Simon Gay University of Glasgow, UK Markus Grassl National University of Singapore Jarkko Kari University of Turku, Finland Martin Kutrib University of Giessen, Germany Kazutaka Matsuda University of Tokyo, Japan Shin-Ichi Minato Hokkaido University, Japan Jacqueline Rice University of Lethbridge, Canada Irek Ulidowski University of Leicester, UK Janis Voigtl¨ander University of Bonn, Germany Robert Wille University of Bremen, Germany TetsuoYokoyama Nanzan University, Japan Paolo Zuliani Newcastle University, UK Organizing Committee Gerhard W. Dueck University of New Brunswick, Canada Lisa Jungmann University of Bremen, Germany D. Michael Miller University of Victoria, Canada Robert Wille University of Bremen, Germany Additional Reviewers Nabila Abdessaied Andreas Malcher Mika Hirvensalo Katja Meckel Katsunobu Imai Torben Æ. Mogensen Sebastian Jakobi Kenichi Morita Oliver Kesz¨ocze Daniel Morrison VIII Organization Noor Nayeem Julia Seiter Beatrice Palano Mathias Soeken Tom Ridge Krysta M. Svore Zahra Sasanian Himanshu Thapliyal Eleonora Sch¨onborn Michael Kirkedal Thomsen Sponsors RC 2013 was sponsored by the Pacific Institute for the Mathematical Sciences and by the Department of Computer Science, Faculty of Engineering, and the Office of the Vice-President Research at the University of Victoria. Table of Contents Invited Address Efficient Algorithms for Universal Quantum Simulation ............... 1 Barry C. Sanders Physical Implementation Reversible Delay-Insensitive Distributed Memory Modules............. 11 Daniel Morrison and Irek Ulidowski Energy Recovery and Logical Reversibility in Adiabatic CMOS Multiplier....................................................... 25 Ismo Ha¨nninen, Hao Lu, Craig S. Lent, and Gregory L. Snider Comparing CMOS-Based and NEMS-Based Adiabatic Logic Circuits ... 36 Samer Houri, Alexandre Valentian, and Herv´e Fanet Arithmetic Strength of the Reversible, Garbage-Free 2k±1 Multiplier ............ 46 Eva Rotenberg, James Cranch, Michael Kirkedal Thomsen, and Holger Bock Axelsen Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures.................................................... 58 Mehdi Saeedi, Alireza Shafaei, and Massoud Pedram Garbage-Free Reversible Constant Multipliers for Arbitrary Integers.... 70 Torben Ægidius Mogensen Identities in Modular Arithmetic from Reversible Coherence Operations...................................................... 84 Peter M. Hines Programming and Data Structures Reversible Representation and Manipulation of Constructor Terms in the Heap ..................................................... 96 Holger Bock Axelsen and Robert Glu¨ck An Introduction to Quantum Programming in Quipper ............... 110 Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, and Benoˆıt Valiron X Table of Contents On the “Q” in QMDDs: Efficient Representation of Quantum Functionality in the QMDD Data-Structure ......................... 125 Philipp Niemann, Robert Wille, and Rolf Drechsler Modelling Modelling of Bonding with Processes and Events..................... 141 Iain Phillips, Irek Ulidowski, and Shoji Yuen Universal Gates in Other Universes................................. 155 Jonathan A. Poritz Time-Symmetric Machines ........................................ 168 Martin Kutrib and Thomas Worsch Synthesis and Optimization Reversible Circuit Synthesis of Symmetric Functions Using a Simple Regular Structure................................................ 182 Arighna Deb, Debesh K. Das, Hafizur Rahaman, Bhargab B. Bhattacharya, Robert Wille, and Rolf Drechsler White Dots do Matter: Rewriting Reversible Logic Circuits ........... 196 Mathias Soeken and Michael Kirkedal Thomsen Exploiting Negative Control Lines in the Optimization of Reversible Circuits......................................................... 209 Kamalika Datta, Gaurav Rathi, Robert Wille, Indranil Sengupta, Hafizur Rahaman, and Rolf Drechsler Reducing the Depth of Quantum Circuits Using Additional Circuit Lines ........................................................... 221 Nabila Abdessaied, Robert Wille, Mathias Soeken, and Rolf Drechsler Alternative Technologies Quantum Process Calculus for Linear Optical Quantum Computing .... 234 Sonja Franke-Arnold, Simon J. Gay, and Ittoop V. Puthoor Logically and Physically Reversible Natural Computing: A Tutorial .... 247 Chris Thachuk Author Index.................................................. 263