WCCI, Vancouver, Canada July 20, 2006 Level Compaction in Quantum Circuits D. Maslov - University of Waterloo, Canada G. W. Dueck - University of New Brunswick,

Slides:

Advertisements

Similar presentations

Quantum Circuit Decomposition

Advertisements

3/6 do now A piece of copper wire with a cross-sectional area of 3.0 x 10-5 meter2 is 25 meters long. How would changing the length of this copper wire.

Parallel Adder Recap To add two n-bit numbers together, n full-adders should be cascaded. Each full-adder represents a column in the long addition. The.

Advanced Computer Architecture Lab University of Michigan Quantum Operations and Quantum Noise Dan Ernst Quantum Noise and Quantum Operations Dan Ernst.

A Transformation Based Algorithm for Reversible Logic Synthesis D. Michael Miller Dmitri Maslov Gerhard W. Dueck Design Automation Conference, 2003.

Two-Qubit Quantum Circuits Vivek V. Shende Igor L. Markov Stephen S. Bullock.

Derivatives of Perkowski’s Gate k f2 g h t t De Vos gates  f1f1  A B P Q Feynman gates A B P f 2f 2  C Q R Toffoli gates Q P f 2 A C R B S D 0.

Systems of Equations. I. Systems of Linear Equations Four Methods: 1. Elimination by Substitution 2. Elimination by Addition 3. Matrix Method 4. Cramer’s.

How to realize many-input AND gates a 0 d c b X ab abc  X 0 acd  abc  X 0 cd We need just one row to create all three-input ANDs.

April 25, A Constructive Group Theory based Algorithm for Reversible Logic Synthesis.

Quantum Algorithms I Andrew Chi-Chih Yao Tsinghua University & Chinese U. of Hong Kong.

Symbolic Reduction of Quantum Circuits. Motivation In classical computation, it is desirable to find a “minimal” circuit to compute a given function In.

Minimization Techniques for Reversible Logic Synthesis.

Introduction to Quantum logic (2) Yong-woo Choi.

|x1 |x1 (a) |x2 |x2 | x1 x2  y |y |x |x (b) | x  y |y

MATRICES Using matrices to solve Systems of Equations.

2.4 Solving Equations with Variables on Both Sides

Introduction to CMOS VLSI Design Lecture 11: Adders David Harris Harvey Mudd College Spring 2004.

Matrix Definition A Matrix is an ordered set of numbers, variables or parameters. An example of a matrix can be represented by: The matrix is an ordered.

CE 311 K - Introduction to Computer Methods Daene C. McKinney

4.3 Logarithm Functions Recall: a ≠ 1 for the exponential function f(x) = a x, it is one-to-one with domain (-∞, ∞) and range (0, ∞). when a > 1, it is.

MATRICES AND DETERMINANTS

Systems of Linear Equation and Matrices

GEOMETRIC PROPERTIES OF LINEAR FUNCTIONS 2.

1 Cost Metrics for Reversible and Quantum Logic Synthesis Dmitri Maslov 1 D. Michael Miller 2 1 Dept. of ECE, McGill University 2 Dept. of CS, University.

4.4 & 4.5 Notes Remember: Identity Matrices: If the product of two matrices equal the identity matrix then they are inverses.

CS654: Digital Image Analysis Lecture 15: Image Transforms with Real Basis Functions.

Computer Organization & Programming Chapter4 Combinatorial Components.

What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.

1 hardware of quantum computer 1. quantum registers 2. quantum gates.

1 A Novel Synthesis Algorithm for Reversible Circuits Mehdi Saeedi, Mehdi Sedighi*, Morteza Saheb Zamani {msaeedi, msedighi, aut.ac.ir.

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.

2009/9 1 Matrices(§3.8)  A matrix is a rectangular array of objects (usually numbers).  An m  n (“m by n”) matrix has exactly m horizontal rows, and.

4.4 Identify and Inverse Matrices Algebra 2. Learning Target I can find and use inverse matrix.

Weikang Qian. Outline Intersection Pattern and the Problem Motivation Solution 2.

Geodetic Control Network Lecture 4. Computations on the ellipsoid.

EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 8 Arithmetic.

Computer Science 101 More Devices: Arithmetic. From 1-Bit Equality to N-Bit Equality = A B A = B Two bit strings.

CS654: Digital Image Analysis Lecture 13: Discrete Fourier Transformation.

Generating Toffoli Networks from ESOP Expressions Yasaman Sanaee Winter 2009 University of New Brunswick.

Uniformly-switching Logic for Cryptographic Hardware D. Maslov - University of Victoria, Canada I. L. Markov - University of Michigan, USA.

On the Complexity of Manipulating Quantum Boolean Circuits Vincent Liew.

Logarithm Basics. The logarithm base a of b is the exponent you put on a to get b: i.e. Logs give you exponents! Definition of Logarithm a > 0 and b >

Garbage in Reversible Designs of Multiple Output Functions

Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment D. Maslov (spkr) – IQC/UWaterloo,

Quantum Cost Calculation of Reversible Circuit Sajib Mitra MS/ Department of Computer Science and Engineering University of Dhaka

Exponents – Logarithms xy -31/8 -2¼ ½ xy 1/8-3 ¼-2 ½ The function on the right is the inverse of the function on the left.

Algebra 2 Notes May 4,  Graph the following equation:  What equation is that log function an inverse of? ◦ Step 1: Use a table to graph the exponential.

Direct Variation Chapter 5 Section 2. Objective  Students will write and graph an equation of a direct variation.

Quantum Circuit Simplification Using Templates D. Maslov - University of Victoria, Canada G. W. Dueck - UNB, Canada C. Young - University of Victoria,

Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.

Templates for Toffoli Network Synthesis by Dmitri Maslov Gerhard W. Dueck Michael D. Miller.

Equations with Variables on Both Sides Chapter 3 Section 3.

BDD-based Synthesis of Reversible Logic for Large Functions Robert Wille Rolf Drechsler DAC’09 Presenter: Meng-yen Li.

A Synthesis Method for MVL Reversible Logic by 1 Department of Computer Science, University of Victoria, Canada M. Miller 1, G. Dueck 2, and D. Maslov.

CHAPTER 7 Determinant s. Outline - Permutation - Definition of the Determinant - Properties of Determinants - Evaluation of Determinants by Elementary.

D. Cheung – IQC/UWaterloo, Canada D. K. Pradhan – UBristol, UK

Boolean algebra and Logic Circuits Chapter 5

Fredkin/Toffoli Templates for Reversible Logic Synthesis

Two-port networks Adam Wąż

Logarithms and Logarithmic Functions

A Ridiculously Brief Overview

Inverse Variation.

Introduction to Quantum logic (2)

Point-slope Form of Equations of Straight Lines

Quantum Computing Prabhas Chongstitvatana Faculty of Engineering

Possible Intersection of Straight Lines

Using matrices to solve Systems of Equations

Sajib Kumar Mitra, Lafifa Jamal and Hafiz Md. Hasan Babu*

Presentation transcript:

WCCI, Vancouver, Canada July 20, 2006 Level Compaction in Quantum Circuits D. Maslov - University of Waterloo, Canada G. W. Dueck - University of New Brunswick, Canada

WCCI, Vancouver, Canada July 20, 2006 Outline - Background - The templates (properties, definition) - Using templates for level compaction - Example - Results page 1/14

WCCI, Vancouver, Canada July 20, 2006 Background page 2/14 A quantum circuit is composed of gates arranged in a cascade: … In an n-bit quantum computation each gate is a unitary matrix.

WCCI, Vancouver, Canada July 20, 2006 Background page 3/14 NOT CNOT (Feynman) InOut InOut Some quantum gates

WCCI, Vancouver, Canada July 20, 2006 Background page 4/14 V Iff control value is 1, the target is changed according to. In practice, controlled-V gates are used w/Boolean controls. InOut v0 1 1 v1 InOut 0 v0 0 v1 1 v01 1 v11 0 and

WCCI, Vancouver, Canada July 20, 2006 Background page 5/14 V+V+ Controlled-V+ is the inverse of controlled- V. - Set of gates: NOT, CNOT, controlled-V and controlled-V+ is complete. - Set of gates NOT and controlled-V is complete. - Controlled-V is complete on its own. With regards to synthesizing quantum Boolean functions and with the addition of a constant line:

WCCI, Vancouver, Canada July 20, 2006 The Templates: Definition Observation 1. If one has a circuit equality then the gates satisfy the equation Observation 3. If, then Observation 2. For each circuit and for any parameter p,. page 6/14

WCCI, Vancouver, Canada July 20, 2006 The Templates: Definition A size m template is a cascade of m gates that realizes the identity function. Any template T of size m should be independent of smaller size templates, i.e. application of smaller templates does not decrease the number of gates in T or make it equal to another template. Given G 0 G 1 …G m-1, a template of size m, its application for parameter p, is: - for page 7/14

WCCI, Vancouver, Canada July 20, 2006 The Templates: Definition A B C D E F G Example. Template ABCDEFG. p=4. Starting gate B. Direction: backward. B -1 B A -1 A G -1 G F -1 F C C D D E E page 8/14

WCCI, Vancouver, Canada July 20, 2006 Quantum Gate Templates Gate-inverse rule. Moving rule. Gate G 1 with control c 1 and target t 1 passes gate G 2 with c 2, t 2 iff Other templates: page 9/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction The non intersecting gates may be applied in parallel. Form a level by: - put the leftmost gate in the level; LEVEL CIRCUIT page 10/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction The non intersecting gates may be applied in parallel. Form a level by: LEVEL CIRCUIT - find a gate that can be put in a level and moves to the left of the circuit; page 10/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction The non intersecting gates may be applied in parallel. Form a level by: LEVEL CIRCUIT - if a size 2m template applies w/parameter m to a non- movable or non-arrangable gate, apply it and see what happens. page 10/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction V V+V+V+V+ V Levels: 012Can there be less than 10 levels? page 11/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction V+V+ V+V+ Levels: 2Can there be less than 10 levels? page 11/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction V+V+V+V+ Levels: 2 V+V+ V+V+ Can there be less than 10 levels? page 11/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction V+V+ Levels: 2 V+V+ V+V+ V+V+ Can there be less than 10 levels? page 11/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction Levels: 2 V+V+ V+V+ 348Can there be less than 10 levels? page 11/14

WCCI, Vancouver, Canada July 20, 2006 Level Compaction Levels: 8 page 11/14

WCCI, Vancouver, Canada July 20, 2006 Results R. V. Meter and K. M. Itoh. Fast quantum modular exponentiation. Physical Review A, 71(052320), May NameSizeGCLvlsOptimized GC Optimized Lvls Time (sec) Fig Fig Fig page 12/14

WCCI, Vancouver, Canada July 20, 2006 Results T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore. A logarithmic-depth quantum carry-lookahead adder. quant-ph/ , June NameSizeGCLvlsOptimized GC Optimized Lvls Time (sec) Fig Fig Fig page 13/14

WCCI, Vancouver, Canada July 20, 2006 Acknowledgements page 14/14 Natural Sciences and Engineering Research Council (NSERC), Canada

WCCI, Vancouver, Canada July 20, 2006 END Thank you for your attention!