Lowering the Tdepth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks
Abstract
The multiplicative depth of a logic network over the gate basis $\{\land, \oplus, \neg\}$ is the largest number of $\land$ gates on any path from a primary input to a primary output in the network. We describe a dynamic programming based logic synthesis algorithm to reduce the multiplicative depth in logic networks. It makes use of cut enumeration, tree balancing, and exclusive sumofproducts (ESOP) representations. Our algorithm has applications to cryptography and quantum computing, as a reduction in the multiplicative depth directly translates to a lower $T$depth of the corresponding quantum circuit. Our experimental results show improvements in $T$depth over stateoftheart methods and over several handoptimized quantum circuits for instances of AES, SHA, and floatingpoint arithmetic.
 Publication:

arXiv eprints
 Pub Date:
 June 2020
 arXiv:
 arXiv:2006.03845
 Bibcode:
 2020arXiv200603845H
 Keywords:

 Quantum Physics;
 Computer Science  Cryptography and Security;
 Computer Science  Emerging Technologies;
 81P68;
 94A60;
 03B70;
 B.6.3
 EPrint:
 8 pages, 3 figures