Reversible and Quantum Circuits: Optimization and Complexity Analysis by Abdessaied, Nabila

Reversible and Quantum Circuits: Optimization and Complexity Analysis (Hardcover) (ISBN-13: 9783319319353)

Vendor: Nabila Abdessaied
Product type: Books
Format: Hardcover
$54.99
$54.99
$54.99
Subtotal: $54.99
Reversible and Quantum Circuits: Optimization and Complexity Analysis by Abdessaied, Nabila

Reversible and Quantum Circuits: Optimization and Complexity Analysis

$54.99
Reversible and Quantum Circuits: Optimization and Complexity Analysis by Abdessaied, Nabila

Reversible and Quantum Circuits: Optimization and Complexity Analysis

$54.99
Format: Hardcover
Description
Description
x
1 Introduction . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . .. . . 11.1 Book Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41.1.1 Optimization of Quantum Circuits . . . . . . . . . . . . . . . . . . . . . . 41.1.2 Complexity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51.2 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .72 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92.1 Boolean Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92.2 Boolean Function Decomposition . . . . . . . . . . . . . . . . . . . . . . . . 102.2.1 Ashenhurst Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . 102.2.2 Curtis Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112.2.3 Bi-decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122.2.4 Multiplexer Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122.3 Exclusive-OR Sum Of Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132.4 Boolean Satisfiability and SAT Modulo Theory . . . . . . . . . . . . . . . . . 142.5 Reversible Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 162.5.1 Reversible Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172.5.2 Reversible Gates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192.5.3 Reversible Circuits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 222.6 Quantum Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242.6.1 Quantum Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242.6.2 Quantum Libraries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 272.6.3 Quantum Circuits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 302.7 Cost Metrics for Reversible and Quantum Circuits . . . . . . . . . . . . . . . 322.7.1 Quantum Cost . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322.7.2 Number of Gates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342.7.3 Number of Lines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 352.7.4 Depth . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 362.7.5 Nearest Neighbor Cost . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 362.8 Decision Diagrams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372.8.1 Binary Decision Diagrams . . . . . . . . . . . . . . . . . . . . . . . . . . . . 372.8.2 Quantum Multiple-valued Decision Diagrams . . . . . . . . . . . . 383 Optimizations and Complexity Analysis on the Reversible Level . . . . . 453.1 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453.1.1 Optimization Approaches of Reversible Circuits . . . . . . . . . . 453.1.2 Complexity of Reversible Circuits . . . . . . . . . . . . . . . . . . . . . . 513.2 Exact Quantum Cost Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523.2.1 General Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523.2.2 Encoding Using SMT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 533.2.3 Experimental Results . . . . . . . . . . . . . . . . . . . . . . . .

Author: Nabila Abdessaied, Rolf Drechsler
ISBN-10: 3319319353
ISBN-13: 9783319319353
Publisher: Springer
Language: English
Published: 06/14/2016
Pages: 186
Format: Hardcover
Weight: 1.04lbs
Size: 9.21h x 6.14w x 0.50d
By Nabila Abdessaied
By Nabila Abdessaied
x

Nabila Abdessaied is a researcher at the German Research Center for Artificial Intelligence (DFKI) since 2013. She received the Diple d'Ing駭ieur in computer science from the University of sciences in Tunis, Tunisia, in 2007. Then, she obtained her Master degree in computer science from the National Engineering School of Sousse, Tunisia, in 2009. In 2012, she joined the Institute of Computer Science of the University of Bremen where she received her Dr.-Ing. degree in computer science in 2015. Nabila Abdessaied is interested in the optimization of reversible and quantum circuits and studying their complexity. Furthermore, she is also working in the field of requirements engineering using NLP techniques.

Rolf Drechsler is head of Cyber-Physical Systems department at the German Research Center for Artificial Intelligence (DFKI) since 2011. Furthermore, he is a Full Professor at the Institute of Computer Science, University of Bremen, since 2001. Before, he worked for the Corporate Technology Department of Siemens AG, and was with the Institute of Computer Science, Albert-Ludwig University of Freiburg/Breisgau, Germany. Rolf Drechsler received the Diploma and Dr. Phil. Nat. degrees in computer science from the Goethe-University in Frankfurt/Main, Germany, in 1992 and, respectively,1995. Rolf Drechsler focusses in his research at DFKI and in the Group for Computer Architecture, which he is heading at the Institute of Computer Science of the University of Bremen, on the development and design of data structures and algorithms with an emphasis on circuit and system design.

Recently Viewed Products