Name
Abstract | ||
|---|---|---|
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circuits for operations such as the modular multiplicative inverse, exponentiation, and discrete logarithm computation in classical binary logic circuits. This principle has desirable features with regard to quantum logic circuit implementations and is generalized for the case of MVL arithmetic systems. It is shown that the inheritance principle in conjunction with the bijective nature of many unary functions is used to realize compact quantum logic cascades that require no ancilla digits and generate no garbage outputs. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ISMVL.2008.27 | ISMVL |
Keywords | Field | DocType |
certain unary,ancilla digit,unary arithmetic operations,inheritance principle,quantum logic implementation,unary function,arithmetic algorithm,bijective nature,classical binary logic circuit,mvl arithmetic system,logic circuit implementation,compact quantum logic cascade,exponentiation,logic design,minimization,computer science,discrete logarithm,quantum theory,quantum logic,modular multiplicative inverse,fixed point,fixed point arithmetic,logic circuits,quantum computing,quantum gate,modular multiplication | Logic synthesis,Discrete mathematics,Logic gate,Modular multiplicative inverse,Unary operation,Computer science,Quantum logic,Arithmetic,Quantum computer,Unary function,Exponentiation | Conference |
Citations | PageRank | References |
4 | 0.51 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mitchell A. Thornton | 1 | 280 | 40.94 |
| David W. Matula | 2 | 628 | 174.69 |
| Laura Spenner | 3 | 4 | 0.51 |
| D. Michael Miller | 4 | 744 | 66.30 |