Reversible and Quantum Circuits Optimization and Complexity Analysis

This book presents a new optimization flow for quantum circuits realization. At the reversible level, optimization algorithms are presented to reduce the quantum cost. Then, new mapping approaches to decompose reversible circuits to quantum circuits using

  • PDF / 6,281,695 Bytes
  • 206 Pages / 439.42 x 683.15 pts Page_size
  • 91 Downloads / 167 Views

DOWNLOAD

REPORT


versible and Quantum Circuits Optimization and Complexity Analysis

Reversible and Quantum Circuits

Nabila Abdessaied • Rolf Drechsler

Reversible and Quantum Circuits Optimization and Complexity Analysis

123

Nabila Abdessaied AG Rechnerarchitektur/ Cyber-Physical Systems University of Bremen/DFKI Bremen, Germany

Rolf Drechsler AG Rechnerarchitektur/ Cyber-Physical Systems University of Bremen Bremen, Germany

ISBN 978-3-319-31935-3 ISBN 978-3-319-31937-7 (eBook) DOI 10.1007/978-3-319-31937-7 Library of Congress Control Number: 2016936659 © Springer International Publishing Switzerland 2016 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. 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. Printed on acid-free paper This springer imprint is published by Springer Nature The registered company is Springer International Publishing AG Switzerland

Preface

Due to the increasing miniaturization according to Moore’s law, classical circuit design will reach soon its limits. Reversible computation is an interesting alternative, since it provides a fundamental approach to the design of low-power circuits, a very critical aspect already in today’s circuit design. Beyond that aspect, reversible circuits can be used as a starting point for synthesizing quantum circuits. Quantum computers can efficiently solve problems such as factorization, while the best known classical algorithms have sub-exponential complexity. In this emerging research field, first approaches to key design steps have been proposed, but they suffer from problems regarding complexity and scalability. Furthermore, most of the existing approaches are not optimal. Theoretical studies looking at the complexity of the underlying circuits are hard to perform, and so far only few results in this field are available. In this context, this book introduces important new optimization approaches as well as complexity analysis that present various improvements compared to the state-of-the-art methods. The book has considered these two aspects on the different levels of the des