DOCSLIB.ORG

State-Of-The-Art Survey Reversible Computation: Extending Horizons

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
State-Of-The-Art Survey Reversible Computation: Extending Horizons Irek Ulidowski Ivan Lanese Ulrik Pagh Schultz Carla Ferreira (Eds.) State-of-the-Art Survey Reversible Computation: Extending Horizons LNCS 12070 of Computing Selected Results of the COST Action IC1405 a A a B B A a B b b c b D c C E b D c C c H H O + O H H H H O H + O H Lecture Notes in Computer Science 12070 Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA More information about this series at http://www.springer.com/series/7407 Irek Ulidowski • Ivan Lanese • Ulrik Pagh Schultz • Carla Ferreira (Eds.) Reversible Computation: Extending Horizons of Computing Selected Results of the COST Action IC1405 Editors Irek Ulidowski Ivan Lanese University of Leicester University of Bologna Leicester, UK Bologna, Italy Ulrik Pagh Schultz Carla Ferreira University of Southern Denmark NOVA University Lisbon Odense, Denmark Caparica, Portugal ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-47360-0 ISBN 978-3-030-47361-7 (eBook) https://doi.org/10.1007/978-3-030-47361-7 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues Acknowledgement and Disclaimer This publication is based upon work from COST Action IC1405 Reversible Computation: Extending Horizons of Computing, supported by COST (European Cooperation in Science and Technology). The book reflects only the authors’ views. Neither the COST Association nor any person acting on its behalf is responsible for the use, which might be made of the information contained in this publication. The COST Association is not responsible for external websites or sources referred to in this publication. © The Editor(s) (if applicable) and The Author(s) 2020. This book is an open access publication. Open Access This book is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this book are included in the book’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the book’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland European Cooperation in Science and Technology (COST) This publication is based upon work from COST Action IC1405 Reversible Computation - Extending Horizons of Computing, supported by COST (European Cooperation in Science and Technology). COST is a funding agency for research and innovation networks. Our Actions help connect research initiatives across Europe and enable scientists to grow their ideas by sharing them with their peers. This boosts their research, career, and innovation. www.cost.eu Preface Reversible Computation (RC) is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily as forwards. It aims to deliver novel com- puting devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of RC, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realised and have lasting effect if conceptual and firm theoretical foundations are established first. This state-of-the-art survey presents the main recent scientific outcomes in the area of RC, focusing on those that have emerged during COST Action IC1405 Reversible Computation - Extending Horizons of Computing, a European research network that operated from May 2015 to April 2019. Action IC1405 was organised into four Working Groups. The members of Working Group 1 concentrated their efforts on establishing Foundations of RC. Working Groups 2 and 3 focused on specific technical challenges and potential application areas of reversibility in Software and Systems and in Reversible Circuit Design respectively. The purpose of Working Group 4 was to validate and explore application of Action’s research results via practical case studies. Working Groups 1–3 produced yearly scientific reports during the life of the Action, and these reports have been developed further into four comprehensive chapters sur- veying the main conceptual, theoretical, and technical achievements of the RC Action. Seven of the case studies from Working Group 4 were selected for presentation in this book. They show that RC techniques can form essential parts of solutions to many difficult practical problems as can be seen, for example, in the success of reversible debugging software tools. Overall, there are 40 co-authors of the book, which repre- sents a substantial proportion of around 110 active members of the RC Action. This survey is a result of collaborative work that was carried out in part during regular Action meetings and Short-Term Scientific Missions (STSMs) supported by COST. The content of the survey is structured as follows: – Chapter 1 presents many new theoretical developments in the foundations of RC. It is worth noting the work on reversing Petri nets and on categorical characterisation of reversibility which was carried out as a direct result of the members of the respective communities participation in IC1405. Results obtained by Working Group 1 on reversibility in programming languages, term rewriting, membrane systems, process calculi, automata, and quantum formal verification are also given here. – The main results obtained in the area of reversible software and systems are described in Chapter 2. They span from the definition of imperative and reversible object-oriented languages to the impact of reversibility on analysis techniques based on behavioural types, and to the application of reversibility for recovery, efficient viii Preface simulation, and wireless communications. The outcomes of Working Group 2 have been mostly of practical nature, hence some of the topics above are further dis- cussed in the chapters of the book devoted to case studies. – Chapter 3 covers simulation and design techniques for quantum circuits. Quantum circuits are inherently reversible and have received significant attention in the recent years. Simulating and designing them in a proper fashion is however a non-trivial task. The chapter provides an overview of solutions for these tasks which utilise expertise on efficient data structures and algorithms gained in the design of con- ventional circuits and systems. – An overview of recent results towards a new classification of reversible functions, which would be useful in the synthesis of reversible circuits, is presented in Chapter 4. Firstly, theoretical results on properties of component functions of reversible functions are given. Then, the results of recent research on the existence of Boolean reversible functions of any number of variables (with all component functions belonging to different equivalence classes) are described. Finally, results on the existence of Boolean reversible functions with specified properties of all component functions are reported. – Chapter 5 focuses on the application of reversibility to debugging. This is a quite natural application, since debugging aims at finding bugs (that is, wrong lines of code) causing visible misbehaviours, and to do that it is quite natural to execute backward from the misbehaviour. The chapter focuses on debugging of concurrent systems, where the use of reversibility is more recent, and considers both a standard imperative language and a subset of the functional language Erlang. Notably, the results described in this section are practical, but obtained as a direct application of theoretical investigations in the area of process calculi and semantics. – The combination of reversibility and run-time monitoring of distributed systems is advocated in Chapter 6. It considers Erlang programs as an instance of the implementation of a model-driven methodology which can
Load more

Recommended publications
  • Efficient Algorithms for Comparing, Storing, and Sharing
    EFFICIENT ALGORITHMS FOR COMPARING, STORING, AND SHARING LARGE COLLECTIONS OF EVOLUTIONARY TREES A Dissertation by SUZANNE JUDE MATTHEWS Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY May 2012 Major Subject: Computer Science EFFICIENT ALGORITHMS FOR COMPARING, STORING, AND SHARING LARGE COLLECTIONS OF EVOLUTIONARY TREES A Dissertation by SUZANNE JUDE MATTHEWS Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Approved by: Chair of Committee, Tiffani L. Williams Committee Members, Nancy M. Amato Jennifer L. Welch James B. Woolley Head of Department, Hank W. Walker May 2012 Major Subject: Computer Science iii ABSTRACT Efficient Algorithms for Comparing, Storing, and Sharing Large Collections of Evolutionary Trees. (May 2012) Suzanne Jude Matthews, B.S.; M.S., Rensselaer Polytechnic Institute Chair of Advisory Committee: Dr. Tiffani L. Williams Evolutionary relationships between a group of organisms are commonly summarized in a phylogenetic (or evolutionary) tree. The goal of phylogenetic inference is to infer the best tree structure that represents the relationships between a group of organisms, given a set of observations (e.g. molecular sequences). However, popular heuristics for inferring phylogenies output tens to hundreds of thousands of equally weighted candidate trees. Biologists summarize these trees into a single structure called the consensus tree. The central assumption is that the information discarded has less value than the information retained. But, what if this assumption is not true? In this dissertation, we demonstrate the value of retaining and studying tree collections.
    [Show full text]
  • Analysis of Devops Tools to Predict an Optimized Pipeline by Adding Weightage for Parameters
    International Journal of Computer Applications (0975 – 8887) Volume 181 – No. 33, December 2018 Analysis of DevOps Tools to Predict an Optimized Pipeline by Adding Weightage for Parameters R. Vaasanthi V. Prasanna Kumari, PhD S. Philip Kingston Research Scholar, HOD, MCA Project Manager SCSVMV University Rajalakshmi Engineering Infosys, Mahindra City, Kanchipuram College, Chennai Chennai ABSTRACT cloud. Now-a-days more than ever, DevOps [Development + Operations] has gained a tremendous amount of attention in 2. SCM software industry. Selecting the tools for building the DevOps Source code management (SCM) is a software tool used for pipeline is not a trivial exercise as there are plethora’s of tools development, versioning and enables team working in available in market. It requires thought, planning, and multiple locations to work together more effectively. This preferably enough time to investigate and consult other plays a vital role in increasing team’s productivity. Some of people. Unfortunately, there isn’t enough time in the day to the SCM tools, considered for this study are GIT, SVN, CVS, dig for top-rated DevOps tools and its compatibility with ClearCase, Mercurial, TFS, Monotone, Bitkeeper, Code co- other tools. Each tool has its own pros/cons and compatibility op, Darcs, Endevor, Fossil, Perforce, Rational Synergy, of integrating with other tools. The objective of this paper is Source Safe, and GNU Bazaar. Table1 consists of SCM tools to propose an approach by adding weightage to each with weightage. parameter for the curated list of the DevOps tools. 3. BUILD Keywords Build is a process that enables source code to be automatically DevOps, SCM, dependencies, compatibility and pipeline compiled into binaries including code level unit testing to ensure individual pieces of code behave as expected [4].
    [Show full text]
  • DVCS Or a New Way to Use Version Control Systems for Freebsd
    Brief history of VCS FreeBSD context & gures Is Arch/baz suited for FreeBSD? Mercurial to the rescue New processes & policies needed Conclusions DVCS or a new way to use Version Control Systems for FreeBSD Ollivier ROBERT <[email protected]> BSDCan 2006 Ottawa, Canada May, 12-13th, 2006 Ollivier ROBERT <[email protected]> DVCS or a new way to use Version Control Systems for FreeBSD Brief history of VCS FreeBSD context & gures Is Arch/baz suited for FreeBSD? Mercurial to the rescue New processes & policies needed Conclusions Agenda 1 Brief history of VCS 2 FreeBSD context & gures 3 Is Arch/baz suited for FreeBSD? 4 Mercurial to the rescue 5 New processes & policies needed 6 Conclusions Ollivier ROBERT <[email protected]> DVCS or a new way to use Version Control Systems for FreeBSD Brief history of VCS FreeBSD context & gures Is Arch/baz suited for FreeBSD? Mercurial to the rescue New processes & policies needed Conclusions The ancestors: SCCS, RCS File-oriented Use a subdirectory to store deltas and metadata Use lock-based architecture Support shared developments through NFS (fragile) SCCS is proprietary (System V), RCS is Open Source a SCCS clone exists: CSSC You can have a central repository with symlinks (RCS) Ollivier ROBERT <[email protected]> DVCS or a new way to use Version Control Systems for FreeBSD Brief history of VCS FreeBSD context & gures Is Arch/baz suited for FreeBSD? Mercurial to the rescue New processes & policies needed Conclusions CVS, the de facto VCS for the free world Initially written as shell wrappers over RCS then rewritten in C Centralised server Easy UI Use sandboxes to avoid locking Simple 3-way merges Can be replicated through CVSup or even rsync Extensive documentation (papers, websites, books) Free software and used everywhere (SourceForge for example) Ollivier ROBERT <[email protected]> DVCS or a new way to use Version Control Systems for FreeBSD Brief history of VCS FreeBSD context & gures Is Arch/baz suited for FreeBSD? Mercurial to the rescue New processes & policies needed Conclusions CVS annoyances and aws BUT..
    [Show full text]
  • Regularity and Symmetry As a Base for Efficient Realization of Reversible Logic Circuits
    Portland State University PDXScholar Electrical and Computer Engineering Faculty Publications and Presentations Electrical and Computer Engineering 2001 Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits Marek Perkowski Portland State University, [email protected] Pawel Kerntopf Technical University of Warsaw Andrzej Buller ATR Kyoto, Japan Malgorzata Chrzanowska-Jeske Portland State University Alan Mishchenko Portland State University SeeFollow next this page and for additional additional works authors at: https:/ /pdxscholar.library.pdx.edu/ece_fac Part of the Electrical and Computer Engineering Commons Let us know how access to this document benefits ou.y Citation Details Perkowski, Marek; Kerntopf, Pawel; Buller, Andrzej; Chrzanowska-Jeske, Malgorzata; Mishchenko, Alan; Song, Xiaoyu; Al-Rabadi, Anas; Jozwiak, Lech; and Coppola, Alan, "Regularity and Symmetry as a Base for Efficient Realization of vRe ersible Logic Circuits" (2001). Electrical and Computer Engineering Faculty Publications and Presentations. 235. https://pdxscholar.library.pdx.edu/ece_fac/235 This Conference Proceeding is brought to you for free and open access. It has been accepted for inclusion in Electrical and Computer Engineering Faculty Publications and Presentations by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Authors Marek Perkowski, Pawel Kerntopf, Andrzej Buller, Malgorzata Chrzanowska-Jeske, Alan Mishchenko, Xiaoyu Song, Anas Al-Rabadi, Lech Jozwiak, and Alan Coppola This conference proceeding is available at PDXScholar: https://pdxscholar.library.pdx.edu/ece_fac/235 Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits Marek Perkowski, Pawel Kerntopf+, Andrzej Buller*, Malgorzata Chrzanowska-Jeske, Alan Mishchenko, Xiaoyu Song, Anas Al-Rabadi, Lech Jozwiak@, Alan Coppola$ and Bart Massey PORTLAND QUANTUM LOGIC GROUP, Portland State University, Portland, Oregon 97207-0751.
    [Show full text]
  • CSE 391 Lecture 9
    CSE 391 Lecture 9 Version control with Git slides created by Ruth Anderson & Marty Stepp, images from http://git-scm.com/book/en/ http://www.cs.washington.edu/391/ 1 Problems Working Alone • Ever done one of the following? . Had code that worked, made a bunch of changes and saved it, which broke the code, and now you just want the working version back… . Accidentally deleted a critical file, hundreds of lines of code gone… . Somehow messed up the structure/contents of your code base, and want to just “undo” the crazy action you just did . Hard drive crash!!!! Everything’s gone, the day before deadline. • Possible options: . Save as (MyClass-v1.java) • Ugh. Just ugh. And now a single line change results in duplicating the entire file… 2 Problems Working in teams . Whose computer stores the "official" copy of the project? • Can we store the project files in a neutral "official" location? . Will we be able to read/write each other's changes? • Do we have the right file permissions? • Lets just email changed files back and forth! Yay! . What happens if we both try to edit the same file? • Bill just overwrote a file I worked on for 6 hours! . What happens if we make a mistake and corrupt an important file? • Is there a way to keep backups of our project files? . How do I know what code each teammate is working on? 3 Solution: Version Control • version control system: Software that tracks and manages changes to a set of files and resources. • You use version control all the time .
    [Show full text]
  • Optimization of Reversible Circuits Using Toffoli Decompositions with Negative Controls
    S S symmetry Article Optimization of Reversible Circuits Using Toffoli Decompositions with Negative Controls Mariam Gado 1,2,* and Ahmed Younes 1,2,3 1 Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria 21568, Egypt; [email protected] 2 Academy of Scientific Research and Technology(ASRT), Cairo 11516, Egypt 3 School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK * Correspondence: [email protected]; Tel.: +203-39-21595; Fax: +203-39-11794 Abstract: The synthesis and optimization of quantum circuits are essential for the construction of quantum computers. This paper proposes two methods to reduce the quantum cost of 3-bit reversible circuits. The first method utilizes basic building blocks of gate pairs using different Toffoli decompositions. These gate pairs are used to reconstruct the quantum circuits where further optimization rules will be applied to synthesize the optimized circuit. The second method suggests using a new universal library, which provides better quantum cost when compared with previous work in both cost015 and cost115 metrics; this proposed new universal library “Negative NCT” uses gates that operate on the target qubit only when the control qubit’s state is zero. A combination of the proposed basic building blocks of pairs of gates and the proposed Negative NCT library is used in this work for synthesis and optimization, where the Negative NCT library showed better quantum cost after optimization compared with the NCT library despite having the same circuit size. The reversible circuits over three bits form a permutation group of size 40,320 (23!), which Citation: Gado, M.; Younes, A.
    [Show full text]
  • Software Development a Practical Approach!
    Software Development A Practical Approach! Hans-Petter Halvorsen https://www.halvorsen.blog https://halvorsen.blog Software Development A Practical Approach! Hans-Petter Halvorsen Software Development A Practical Approach! Hans-Petter Halvorsen Copyright © 2020 ISBN: 978-82-691106-0-9 Publisher Identifier: 978-82-691106 https://halvorsen.blog ii Preface The main goal with this document: • To give you an overview of what software engineering is • To take you beyond programming to engineering software What is Software Development? It is a complex process to develop modern and professional software today. This document tries to give a brief overview of Software Development. This document tries to focus on a practical approach regarding Software Development. So why do we need System Engineering? Here are some key factors: • Understand Customer Requirements o What does the customer needs (because they may not know it!) o Transform Customer requirements into working software • Planning o How do we reach our goals? o Will we finish within deadline? o Resources o What can go wrong? • Implementation o What kind of platforms and architecture should be used? o Split your work into manageable pieces iii • Quality and Performance o Make sure the software fulfills the customers’ needs We will learn how to build good (i.e. high quality) software, which includes: • Requirements Specification • Technical Design • Good User Experience (UX) • Improved Code Quality and Implementation • Testing • System Documentation • User Documentation • etc. You will find additional resources on this web page: http://www.halvorsen.blog/documents/programming/software_engineering/ iv Information about the author: Hans-Petter Halvorsen The author currently works at the University of South-Eastern Norway.
    [Show full text]
  • Distributed Versioning for Everyone
    Distributed versioning for everyone Distributed versioning for everyone Nicolas Pouillard [email protected] March 20, 2008 Nicolas Pouillard Distributed versioning for everyoneMarch 20, 2008 1 / 48 Distributed versioning for everyone Introduction Outline 1 Introduction 2 Principles of Distributed Versioning 3 Darcs is one of them 4 Conclusion Nicolas Pouillard Distributed versioning for everyoneMarch 20, 2008 2 / 48 Distributed versioning for everyone Introduction SCM: “Source Code Manager” Keeps track of changes to source code so you can track down bugs and work collaboratively. Most famous example: CVS Numerous acronyms: RCS, SCM, VCS DSCM: Distributed Source Code Manager Nicolas Pouillard Distributed versioning for everyoneMarch 20, 2008 3 / 48 Distributed versioning for everyone Introduction Purpose What’s the purpose of this presentation Show the importance of the distributed feature Enrich your toolbox with a DSCM Exorcize rumors about darcs Show how DSCM are adapted for personal use What’s not the purpose of it A flame against other DSCMs A precise darcs tutorial A real explanation of the Theory of patches Nicolas Pouillard Distributed versioning for everyoneMarch 20, 2008 4 / 48 Distributed versioning for everyone Principles of Distributed Versioning Outline 1 Introduction 2 Principles of Distributed Versioning 3 Darcs is one of them 4 Conclusion Nicolas Pouillard Distributed versioning for everyoneMarch 20, 2008 5 / 48 Distributed versioning for everyone Principles of Distributed Versioning Distributed rather than centralized
    [Show full text]
  • Energy Recovery and Logical Reversibility in Adiabatic CMOS Multiplier
    Energy Recovery and Logical Reversibility in Adiabatic CMOS Multiplier Ismo Hänninen, Hao Lu, Craig S. Lent, Gregory L. Snider University of Notre Dame, Center for Nano Science and Technology, Notre Dame, IN 46556, USA {ismo.hanninen, hlu1, lent, snider.7}@nd.edu Abstract. Overcoming the IC power challenge requires signal energy recovery, which can be achieved utilizing adiabatic charging principles and logically reversible computing in the circuit design. This paper demonstrates the energy- efficiency of a Bennett-clocked adiabatic CMOS multiplier via a simulation model. The design is analyzed on the logic gate level to determine an estimate for the number of irreversible bit erasures occurring in a combinatorial implementation, showing considerable potential for minimizing the logical information loss. Keywords: Multipliers, computer arithmetic, adiabatic charging, reversible logic. 1 Introduction Reversible logic is a strict requirement for quantum computing, however, overcoming the power challenge of the traditional digital integrated circuits potentially benefits from the associated energy recovery enabled by the reversible computation principles. Standard Complementary Metal Oxide Semiconductor (CMOS) technology does not recover signal energy, which leads to considerable energy waste and heat dissipation, limiting the attainable device densities and operating frequencies, and thereby, also the available computing power. While the technology scales down, expected to follow the predictions of the International Roadmap for Semiconductors (ITRS), the loss of signal energy and limiting the related heat become all the more important factors for circuit design. [1] Adiabatically charged logic recovers part of the signal energy, and if the circuits are slowed down, asymptotically nearly all of the energy can be recovered.
    [Show full text]
  • Time, Space, and Energy in Reversible Computing
    Time, Space, and Energy in Reversible Computing Paul Vitan´ yi ¤ CWI University of Amsterdam National ICT of Australia ABSTRACT sipate energy by generating a corresponding amount of entropy for We survey results of a quarter century of work on computation by every bit of information that gets irreversibly erased; the logically reversible general-purpose computers (in this setting Turing ma- reversible operations can in principle be performed dissipation-free. chines), and general reversible simulation of irreversible computa- One should sharply distinguish between the issue of logical re- tions, with respect to energy-, time- and space requirements. versibility and the issue of energy dissipation freeness. If a com- Categories and Subject Descriptors: F.2 [Algorithms], F.1.3 puter operates in a logically reversible manner, then it still may dis- [Performance] sipate heat. For such a computer we know that the laws of physics General Terms: Algorithms, Performance do not preclude that one can invent a technology in which to im- plement a logically similar computer to operate physically in a dis- Keywords: Reversible computing, reversible simulation, adia- sipationless manner. Computers built from reversible circuits, or batic computing, low-energy computing, computational complex- the reversible Turing machine, [1, 2, 7], implemented with cur- ity, time complexity, space complexity, energy dissipation com- rent technology will presumably dissipate energy but may conceiv- plexity, tradeoffs. ably be implemented by future technology in an adiabatic fashion. But for logically irreversible computers adiabatic implementation 1. INTRODUCTION is widely considered impossible. Computer power has roughly doubled every 18 months for the Thought experiments can exhibit a computer that is both logi- last half-century (Moore’s law).
    [Show full text]
  • Chapter 2 Quantum Gates
    Chapter 2 Quantum Gates “When we get to the very, very small world—say circuits of seven atoms—we have a lot of new things that would happen that represent completely new opportunities for design. Atoms on a small scale behave like nothing on a large scale, for they satisfy the laws of quantum mechanics. So, as we go down and fiddle around with the atoms down there, we are working with different laws, and we can expect to do different things. We can manufacture in different ways. We can use, not just circuits, but some system involving the quantized energy levels, or the interactions of quantized spins.” – Richard P. Feynman1 Currently, the circuit model of a computer is the most useful abstraction of the computing process and is widely used in the computer industry in the design and construction of practical computing hardware. In the circuit model, computer scien- tists regard any computation as being equivalent to the action of a circuit built out of a handful of different types of Boolean logic gates acting on some binary (i.e., bit string) input. Each logic gate transforms its input bits into one or more output bits in some deterministic fashion according to the definition of the gate. By compos- ing the gates in a graph such that the outputs from earlier gates feed into the inputs of later gates, computer scientists can prove that any feasible computation can be performed. In this chapter we will look at the types of logic gates used within circuits and how the notions of logic gates need to be modified in the quantum context.
    [Show full text]
  • A Quantum of Thermodynamics
    Henrik Wilming A Quantum of Thermodynamics From ground state cooling to spontaneous symmetry breaking Im Fachbereich Physik der Freien Universität Berlin eingereichte Dissertation zur Erlangung des Grades eines Doktors der Naturwissenschaften. Berlin, 2017 Erstgutachter: Prof. Dr. Jens Eisert Zweitgutachter: Prof. Felix von Oppen, PhD Datum der Disputation: 19.7.2018 Publications of the author of this thesis Peer-reviewed publications: [1] H. Wilming, R. Gallego, and J. Eisert. “Second law of thermodynamics under con- trol restrictions”. Phys. Rev. E 93.4 (2016). DOI: 10.1103/physreve.93. 042126. [2] R. Gallego, J. Eisert, and H. Wilming. “Thermodynamic work from operational principles”. New J. Phys. 18.10 (2016), p. 103017. DOI: 10 . 1088 / 1367 - 2630/18/10/103017. [3] M. Perarnau-Llobet, A. Riera, R. Gallego, H. Wilming, and J. Eisert. “Work and entropy production in generalised Gibbs ensembles”. New J. Phys. 18.12 (2016), p. 123035. DOI: 10.1088/1367-2630/aa4fa6. [4] H. Wilming, M. J. Kastoryano, A. H. Werner, and J. Eisert. “Emergence of spon- taneous symmetry breaking in dissipative lattice systems”. J. Math. Phys. 58.3 (2017), p. 033302. DOI: 10.1063/1.4978328. [5] F. Pastawski, J. Eisert, and H. Wilming. “Towards Holography via Quantum Source- Channel Codes”. Phys. Rev. Lett. 119.2 (2017), p. 020501. DOI: 10 . 1103 / PhysRevLett.119.020501. [6] J Lekscha, H Wilming, J Eisert, and R Gallego. “Quantum thermodynamics with local control”. Phys. Rev. E 97.2 (2018), p. 022142. DOI: 10.1103/PhysRevE. 97.022142. arXiv: 10.1103/PhysRevD.97.086015. [7] H. Wilming, R. Gallego, and J. Eisert. “Axiomatic Characterization of the Quan- tum Relative Entropy and Free Energy”.
    [Show full text]