design of regular classical and quantum circuits
DESCRIPTION
Design of Regular CLASSICAL AND Quantum Circuits. CLASSICAL LOGIC. Design of SRFPGA cell. General idea of SRFPGA architecture. SRFPGA layout With I/O pins. 1. Faults observed during column test C = 2. Test output. 0. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/1.jpg)
DESIGN OF DESIGN OF REGULAR REGULAR
CLASSICAL AND CLASSICAL AND QUANTUM QUANTUM CIRCUITSCIRCUITS
![Page 2: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/2.jpg)
CLASSICACLASSICAL LOGICL LOGIC
2
![Page 3: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/3.jpg)
3
![Page 4: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/4.jpg)
4
![Page 5: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/5.jpg)
5
SRFPGA layoutWith I/O pins
![Page 6: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/6.jpg)
6
Var1
var2
var3
var4
var5
var6
var7
var8
var9
var10
var11
var12
var13
var14
var15
var16
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
0
Input test vector
Inputtestvector
Test output
Testoutput
Faults observed during column testC = 2.
Faults observed during
diagonal testD = 2
Total number ofFaults N = C * D= 2 * 2 = 4.
![Page 7: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/7.jpg)
REVERSIBLE REVERSIBLE LOGICLOGIC
7
![Page 8: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/8.jpg)
A logic gate is reversible if Each input is mapped to a unique output It permutes the set of input values
A combinational logic circuit is reversible if it satisfies the following:
Has only one Fanout, Uses only reversible gates, No feedback path, has as many input wires as output wires, and
permutes the input values.8
![Page 9: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/9.jpg)
a a
aa
bbac
9
NOT gate
a b a c0 0 0 00 1 0 11 0 1 11 1 1 0
Controlled-NOT or Feynman gate
![Page 10: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/10.jpg)
a
c
b
a
b
cabf
10
a b c a b f0 0 0 0 0 00 0 1 0 0 10 1 0 0 1 00 1 1 0 1 11 0 0 1 0 01 0 1 1 0 11 1 0 1 1 11 1 1 1 1 0
Toffoli gate (Controlled-Controlled NOT gate)
![Page 11: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/11.jpg)
a
a
b
b
11
Swap gate
Implementation of Swap gate using controlled-NOT
![Page 12: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/12.jpg)
a
a
b
b
12
Swap gate
Implementation of Swap gate using controlled-NOT
![Page 13: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/13.jpg)
a
b
c
baacf
abcag
a
b
c
baacf
abcag
13
a b c a f g0 0 0 0 0 00 0 1 0 0 10 1 0 0 1 00 1 1 0 1 11 0 0 1 0 01 0 1 1 1 01 1 0 1 0 11 1 1 1 1 1
Fredkin gate (Controlled SWAP gate)
![Page 14: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/14.jpg)
14
ALGORITHMS FOR ALGORITHMS FOR SYNTHESIS OF SYNTHESIS OF REVERSIBLE LOGIC REVERSIBLE LOGIC CIRCUITSCIRCUITS
![Page 15: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/15.jpg)
MMD: Transformation based
Gupta-Agrawal-Jha: PPRM based
Mishchenko-Perkowski: Reversible wave cascade
Kerntopf: Heuristics based
Wille: BDD based synthesis
15
![Page 16: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/16.jpg)
16
c b a co bo ao
0 0 0 0 0 1
0 0 1 0 0 0
0 1 0 1 1 1
0 1 1 0 1 0
1 0 0 0 0 1
1 0 1 1 0 0
1 1 0 1 0 1
1 1 1 1 1 0
PPRM form for each output in terms ofInput variables are given as follows and node is created
PPRM form for each output in terms ofInput variables are given as follows and node is created
acabbc 0
accbb 0
10 aa
![Page 17: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/17.jpg)
Parent node is explored by examining each output variable in the PPRM expansion.
Factors are searched in the PPRM expansions that do not contain the same input variable.
For example in the expansion below appropriate terms are “c” and “ac”
The substitution is performed as In this example OR
accbb 0
factorvv ii
17
cbb acbb
![Page 18: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/18.jpg)
acabbc 0
accbb 0
10 aa
Node0
PQ head Node0
1aa
Algorithm identifies three possible substitutions
1. 2. 3.
cbb acbb
18
![Page 19: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/19.jpg)
1aa acbb cbb
aa 0
acbb 0
acabbc 0
10 aa
accbb 0
acabbc 0
acabbc 0
cbb 0
10 aa
abbcc 0
acbb 0
10 aa
PQ head Node 1.0 Node 1.1 Node 1.2
Node 1.0 Node 1.1 Node 1.2
19
New nodes are created based on substitution
![Page 20: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/20.jpg)
20
1aa cbb
aa 0
acbb 0
acabbc 0
10 aa
accbb 0
acabbc 0
acabbc 0
cbb 0
10 aa
abbcc 0
acbb 0
10 aa
Node 1.0
Node 1.1 Node 1.2
acbb
acbb abcc
abcc 0
bb 0
aa 0
acabcc 0
acabbb 0
aa 0
Node 2.0 Node 2.1
PQ head Node 2.0 Node 1.1 Node 1.2 Node 2.1
![Page 21: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/21.jpg)
21
1aa cbb
aa 0
acbb 0
acabbc 0
10 aa
accbb 0
acabbc 0
acabbc 0
cbb 0
10 aa
abbcc 0
acbb 0
10 aa
Node 1.0
Node 1.1 Node 1.2
acbb
acbb abcc
abcc 0
bb 0
aa 0
acabcc 0
acabbb 0
aa 0
Node 2.0 Node 2.1
abcc
00 cc bb 0
aa 0
Node 3.0
PQ head Node 1.1 Node 1.2 Node 2.1
![Page 22: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/22.jpg)
22
1aa
aa 0
acbb 0
acabbc 0
10 aa
accbb 0
acabbc 0
Node 1.0
acbb
abcc 0
bb 0
aa 0
Node 2.0
abcc
00 cc bb 0
aa 0
Node 3.0
Node0
a
c
b acbb
a
b
c abcc
a
b
c
ao
bo
co
Final circuit
![Page 23: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/23.jpg)
Common problem with current approaches: they invariably use nxn Toffoli gates, that might imposes technological limitations.
High Quantum cost of Toffoli gates with many inputs.
Synthesize only reversible functions, not Boolean functions that is not reversible.
23
![Page 24: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/24.jpg)
24
Implementation of 4x4 Toffoli gate with Quantum realizable 2x2 primitives such as controlled-V, controlled-NOT, controlled-V+.
Implementation of 4x4 Toffoli gate with Quantum realizable 2x2 primitives such as controlled-V, controlled-NOT, controlled-V+.
a
b
0
c
d
a
b
d
c
V V V+
V V V+
V V V+
a
b
0
c
d
![Page 25: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/25.jpg)
CREATING CREATING QUANTUM QUANTUM
ARRAY FROM ARRAY FROM LATTICELATTICE
25
![Page 26: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/26.jpg)
26
zbby
r sbb b b
x y z v
r sbb b b
xv
RULE (S, S)
r sb1 b
x y z v
r sb1 b
x
zbby
RULE (pD, pD)1
vzy
1
r sb1
x y z v
r sb b
x
zbby
RULE (nD, nD)1
vzy
b 11
r sb
x y z v
r sb
x
zbby
RULE (s, pD)1
vzy
1b b b b
r sb
x y z v
r sb
x
zbby
RULE (pD, s)1
vzy
1b b b b
Positive Davio Tree can be created by expanding PPRM function using positive Davio expansion.
Positive Davio Lattice is created by performing joining operation for neighboring cells at every level.
Other Lattices can be created using similar method but using expansions such as Shannon or Negative Davio expansions or combination of them.
![Page 27: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/27.jpg)
On the previous foils I showed representation of the Davio and Shannon cells as cascade of reversible gates.
Next I present unique method to create Quantum Array from Positive Davio Lattice.
The same approach can be used for other Lattices.
27
![Page 28: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/28.jpg)
a
c
b
a
b
cabd
a
bc cabd
Positive Davio cell
Positive Davio cell representation with
Toffoli gate
28
bcdcdbcacabdbdad 1
abdbdad 1 bddba
abdba abb 1
ad1 a1
d
a
1 c
1 d 1 d
1 b 1 b
1 a 1 a 1 a
1 d
1
11
1
1 1
10
0
Each node represents pDv cell.
![Page 29: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/29.jpg)
29
+
+ +
++
+ ++
+
0
d
1
11
1
1
1
1 1
1
111
1
d
a
d
bb
1
a a
c
1
![Page 30: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/30.jpg)
30
abcd
0
1
1
1
0
1
a1
ad1
bab1
d
a aabdb
adabddb1
bddab
bcdcdacbcabdaddb1
garbage
garbage
garbage
garbage
garbage
function
![Page 31: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/31.jpg)
31
abcd
0
1
1
1
0
1
a1
ad1
bab1
d
a aabdb
adabddb1
bddab
bcdcdacbcabdaddb1
garbage
garbage
garbage
garbage
garbage
function
![Page 32: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/32.jpg)
a
c
b
a
b
cabd
a
bc cabd
Positive Davio cell
Positive Davio cell representation with
Toffoli gate
32
Each node represents pDv cell.
![Page 33: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/33.jpg)
33
![Page 34: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/34.jpg)
Reversible circuit synthesized with only 3x3 Toffoli gates.
Generates reversible circuit for any ESOP.
Adds ancilla bits but overall cost of the circuit will be lower due to use of low cost 3x3 Toffoli gates.
34
![Page 35: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/35.jpg)
35
![Page 36: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/36.jpg)
36
![Page 37: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/37.jpg)
37
![Page 38: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/38.jpg)
DIPAL GATES, DIPAL GATES, DIPAL GATE DIPAL GATE
FAMILIES AND FAMILIES AND THEIR ARRAYSTHEIR ARRAYS
38
![Page 39: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/39.jpg)
a
c
b
a
b
cabd
a
b
c cabd
a
c
b
a
ba
b
c
cbad cbad
Positive Davio cell
Positive Davio cell representation with Toffoli
gate
Negative Davio cell
Negative Davio cell representation with Toffoli
gate
39
![Page 40: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/40.jpg)
][
]1[
cbab
acabb
acba
acbaf
40
a
b
c
cabaf a
b
c
cabaf
cb
a
Shannon cell
Dipal cell representation with
reversible gates
There are 23! = 8! = 40320 3x3 Reversible logic functions, however only handful of them shown earlier are useful for synthesis purpose.
Dipal gate is a reversibleequivalent of Shannon cell
Dipal gate is a reversibleequivalent of Shannon cell
![Page 41: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/41.jpg)
41
a
b
c
bacaf
a
b
c
a
cb
bacaf
Shannon cell with negative variable
Dipal cell with negative variable represented with
reversible gates
![Page 42: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/42.jpg)
][
]1[
cbab
acabb
acba
acbaf
42
a
b
c
cabaf a
b
c
cabaf
cb
a
Shannon cell
Dipal cell representation with
reversible gates
There are 23! = 8! = 40320 3x3 Reversible logic functions, however only handful of them shown earlier are useful for synthesis purpose.
Dipal gate is a reversibleequivalent of Shannon cell
Dipal gate is a reversibleequivalent of Shannon cell
![Page 43: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/43.jpg)
c b a a
0 0 0 0 0 0
0 0 1 0 0 1
0 1 0 1 1 0
0 1 1 1 0 1
1 0 0 1 0 0
1 0 1 1 1 1
1 1 0 0 1 0
1 1 1 0 1 1
43
b c
b a[b c] input
output
0 0
1 1
2 6
3 5
4 4
5 7
6 2
7 3
![Page 44: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/44.jpg)
44
1 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0
0 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0
0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 1
0 0 1 0 0 0 0 0
0 0 0 1 0 0 0 0
000
001
010
011
100
101
110
111
000 001 010 011 100 101 110 111
![Page 45: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/45.jpg)
45
![Page 46: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/46.jpg)
EXPERIMENEXPERIMENTAL TAL
RESULTSRESULTS46
![Page 47: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/47.jpg)
47
Benchmark #Real inputs
#Garbage inputs
#Gates Lattice
Cost Lattice
CPU time Lattice
#Gates DMM
Cost DMM
#Gates AJ
Cost AJ
2to5 5 4 31 107 0.12 15 107 20 100
rd32 3 1 4 8 < 0.01 4 8 4 8
rd53 5 5 11 39 < 0.01 16 75 13 116
3_17 3 1 10 21 < 0.01 6 12 6 14
6sym 10 6 34 150 0.37 20 62 NA NA
5mod5 5 1 14 58 < 0.01 10 90 11 91
4mod5 4 1 6 18 < 0.01 5 13 5 13
ham3 3 0 3 7 < 0.01 5 7 5 9
xor5 5 0 4 4 < 0.01 4 4 4 4
Xnor5 5 1 5 5 < 0.01 -------- ---------- ---------- ----------
decod24 4 2 10 30 < 0.01 -------- ---------- 11 31
Cycle10_2 12 6 180 860 27.9 19 1198 ---------- ----------
ham7 7 5 22 58 0.10 23 81 24 68
![Page 48: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/48.jpg)
48
Benchmark #Real inputs
#Garbage inputs
#Gates Lattice
Cost Lattice
CPU time Lattice
#Gates DMM
Cost DMM
#Gates AJ
Cost AJ
graycode6 6 5 5 5 < 0.01 5 5 5 5
graycode10 10 9 9 9 < 0.01 9 9 9 9
graycode20 20 19 19 19 < 0.01 19 19 19 19
nth_prime3_inc
3 4 4 6 < 0.01 4 6 ---------- ----------
nth_prime4_inc
4 5 16 48 < 0.01 12 58 ---------- ----------
nth_prime5_inc
5 5 29 91 0.22 26 78 ---------- ----------
alu 5 2 5 17 < 0.01 -------- ---------- 18 114
4_49 4 4 16 52 0.04 16 58 13 61
hwb4 4 4 12 28 < 0.01 17 63 15 35
hwb5 5 5 24 96 1.2 24 104 ---------- ----------
hwb6 6 6 32 128 2.0 42 140 ---------- ----------
pprm1 4 4 9 33 < 0.01 -------- ---------- ---------- ----------
![Page 49: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/49.jpg)
49
Benchmark #Inputs #Gates pDv Lattice
Cost pDv Lattice
#Gates Shannon Lattice
Cost Shannon Lattice
2to5 5 31 107 41 117
rd32 3 4 8 4 8
rd53 5 11 39 18 46
3_17 3 10 21 15 26
6sym 10 34 150 51 167
5mod5 5 14 58 30 81
4mod5 4 6 18 12 24
Ham3 3 3 7 6 10
xor5 5 4 4 4 4
Xnor5 5 5 5 5 5
Decod24 4 10 30 20 40
Cycle10_2 12 180 860 270 950
Ham7 7 22 58 32 68
![Page 50: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/50.jpg)
50
Benchmark #Inputs #Gates pDv Lattice
Cost pDv Lattice
#Gates Shannon Lattice
Cost Shannon Lattice
Graycode6 6 5 5 5 5
Graycode10 10 9 9 9 9
Graycode20 20 19 19 19 19
nth_prime3_inc
3 4 6 6 8
nth_prime4_inc
4 16 48 29 61
nth_prime5_inc
5 29 91 39 101
Alu 5 5 17 10 22
4_49 4 16 52 22 58
Hwb4 4 12 28 15 31
Hwb5 5 24 96 38 110
Hwb6 6 32 128 40 134
Pprm1 4 9 33 14 38
![Page 51: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/51.jpg)
51
![Page 52: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/52.jpg)
52
![Page 53: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/53.jpg)
Fig. 2. Circuit for function FX2 created with our method for traditional cost function calculation that does not take Ion Trap technology constraints into account.
53
abcd
0
1
1
1
0
1
a1
ad1
bab1
d
a aabdb
adabddb1
bddab
bcdcdacbcabdaddb1
garbage
garbage
garbage
garbage
garbage
function
![Page 54: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/54.jpg)
Fig. 3. Circuit from Figure 2 modified with adding SWAP gates for new cost function calculation that does take Ion Trap technology constraints into account, with XX gates added. It has 36 SWAP gates added to realize LNNM.
54
![Page 55: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/55.jpg)
55
bcdcdbcacabdbdad 1
abdbdad 1 bddba
abdba abb 1
ad1 a1
d
a
1 c
1 d 1 d
1 b 1 b
1 a 1 a 1 a
1 d
1
11
1
1 1
10
0
Example of Positive Davio Lattice from [Perkowski97d]. Positive Davio Expansion is applied in each node. Variable d is repeated
![Page 56: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/56.jpg)
56
1
2 3
45 6
7 8 9
a
b
c
f
Garbage
Garbage
Garbage
a
b
c
f
Garbage
Garbage
Garbage
(a)
(b)
Transformation of function F3(a,b,c) from classical Positive Davio Lattice to a Quantum Array with Toffoli and SWAP gates. Each SWAP gate is next replaced with 3 Feynman gates.(a) intermediate form, (b) final Quantum Array.
![Page 57: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/57.jpg)
1
2 3
45 6
7 8 9
a
b
c
f
Garbage
Garbage
Garbage
Garbage
Garbage
Garbage
57
![Page 58: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/58.jpg)
a
b
c
f
Garbage
Garbage
Garbage
Garbage
Garbage
Garbage
d1
d2
d3
d4
d5
d6
x
y
z
v
58
![Page 59: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/59.jpg)
a
b
59
General layout of the layered diagram
Each box represents a gate from family of Dipal gate
![Page 60: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/60.jpg)
d3
d6
d2
d4
d1
a
b
cx
y
z
v
d5
60
![Page 61: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/61.jpg)
61
Benchmark #Gates Lattice
Cost Lattice
#Gates with SWAP insertion for Lattice
Cost with SWAP gates for Lattice
#Gates DMM
Cost DMM
#Gates with SWAP insertion for MMD
Cost with SWAP gates for MMD
2to5 31 107 61 197 15 107 31 155
rd32 4 8 8 20 4 8 6 14
rd53 11 39 44 138 16 75 72 273
3_17 10 21 14 33 6 12 8 18
6sym 34 150 56 216 20 62 78 236
5mod5 14 58 17 67 10 90 48 204
4mod5 6 18 10 30 5 13 11 31
Ham3 3 7 3 7 5 7 7 13
Xor5 4 4 4 4 4 4 4 4
Xnor5 5 5 5 5 -------- -------- -------- --------
decod24 10 30 14 42 -------- -------- -------- --------
Cycle10_2 180 860 306 1238 19 1198 199 1738
Ham7 22 58 30 112 23 81 79 249
![Page 62: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/62.jpg)
62
Benchmark #Gates Lattice
Cost Lattice
#Gates with SWAP insertion for Lattice
Cost with SWAP gates for Lattice
#Gates DMM
Cost DMM
#Gates with SWAP insertion for MMD
Cost with SWAP gates for MMD
Graycode6 5 5 5 5 5 5 5 5
Graycode10 9 9 9 9 9 9 9 9
Graycode20 19 19 19 19 19 19 19 19
Nth_prime3_inc
4 6 5 9 4 6 6 12
Nth_prime4_inc
16 48 20 60 12 58 18 76
Nth_prime5_inc
29 91 39 121 26 78 128 384
Alu 5 17 7 23 -------- -------- ---------- ----------
4_49 16 52 41 127 16 58 40 130
hwb4 12 28 15 40 17 63 39 129
hwb5 24 96 44 156 24 104 64 224
hwb6 32 128 72 248 42 140 144 446
pprm1 9 33 19 63 -------- -------- ---------- ----------
![Page 63: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/63.jpg)
GENERALIZED GENERALIZED REGULARITIES REGULARITIES FOR QUANTUM FOR QUANTUM
AND NANO-AND NANO-TECHNOLOGIESTECHNOLOGIES
63
![Page 64: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/64.jpg)
64
(a) (b) (c)
(d)
![Page 65: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/65.jpg)
65
![Page 66: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/66.jpg)
66
![Page 67: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/67.jpg)
67
![Page 68: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/68.jpg)
68
![Page 69: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/69.jpg)
69
![Page 70: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/70.jpg)
70
![Page 71: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/71.jpg)
71
![Page 72: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/72.jpg)
72
![Page 73: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/73.jpg)
73
![Page 74: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/74.jpg)
QUANTUM QUANTUM CIRCUITS AND CIRCUITS AND
QUANTUM ARRAYS QUANTUM ARRAYS FROM TRULY FROM TRULY
QUANTUM GATESQUANTUM GATES74
![Page 75: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/75.jpg)
Basic single qubit quantum gates
75
NOT Pauli x Pauli y Pauli z Hadamard
X Y Z H
01
10x
0
0
i
iy
10
01z
11
11
2
1H
XX YY ZZ HH
(a) (b) (c) (d)
01
10x
0
0
i
iy
10
01z
11
11
2
1H
Phase gate Pseudohadamard gate Inverse pseudohadamard gate
V S h 1h
ii
iiiV
11
1
2
1
ie
S0
01)(
11
11
2
1h
11
11
2
11h
V Gate
VV SS hh 1h 1h
ii
iiiV
11
1
2
1
ie
S0
01)(
11
11
2
1h
11
11
2
11h
(a) (b) (c) (d)
![Page 76: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/76.jpg)
Transformation of the circuit realized in Fig. 7 using Toffoli gate. Each Toffoli and SWAP gates are replaced by quantum CNOT and CV/CV+ quantum gates and rearranged to satisfy the neighborhood requirements of Ion trap.
76
![Page 77: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/77.jpg)
The transformations of blocks of quantum gates to the pulses level. 77
![Page 78: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/78.jpg)
CONCLUSIONCONCLUSIONSS
78
![Page 79: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/79.jpg)
Experimental results proved that our algorithm produced better results in terms of quantum cost compared to other contemporary algorithms for synthesis of reversible logic.
New gate family called Dipal gate
Presented new synthesis method with layered diagrams.
More accurate technology specific cost model for 1D
qubit neighborhood architecture.
79
![Page 80: Design of Regular CLASSICAL AND Quantum Circuits](https://reader036.vdocuments.mx/reader036/viewer/2022070413/56814c24550346895db92801/html5/thumbnails/80.jpg)
A new method based of lattice diagram to synthesize reversible logic circuit with A new method based of lattice diagram to synthesize reversible logic circuit with
3x3 Toffoli gates.3x3 Toffoli gates.
A new family of gates called Dipal Gates.A new family of gates called Dipal Gates.
New diagrams called layered diagram that uses family of Dipal gate for synthesis New diagrams called layered diagram that uses family of Dipal gate for synthesis
of reversible logic function.of reversible logic function.
Software for creating Lattice diagrams and software for creating quantum array Software for creating Lattice diagrams and software for creating quantum array
from Lattice (Lattice to QA).from Lattice (Lattice to QA).
Program to implement a variant of MMD algorithm.Program to implement a variant of MMD algorithm.
80