Maher Hawash

  • Citations Per Year
Learn More
This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The well-known MMD algorithm for synthesis of reversible circuits requires to store a truth table (or a Reed-Muller RM transform) as a 2n vector to represent a reversible function of n variables. This representation prohibits synthesis(More)
This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The MMD algorithm requires to store a truth table (or a Reed-Muller RM transform) as a 2 vector for a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we do not store such(More)
This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2n terms in memory or require a huge amount of time to yield results because they must calculate(More)
We present the results of application of Evolutionary Algorithms to the problem of synthesizing quantum circuits which belong to the class of reversible circuits, represented as an input/output mapping vectors. The paper specifically focuses on large quantum circuits where many valid solutions exist in an exponentially inflating search space. Valid(More)
  • M. G. Betigeri, J. Bojowald, +15 authors K. Zwoll
  • 1999
We present a method to determine precisely the absolute momentum of the external proton beam from the JuK lich Cooler Synchrotron COSY near 1930 MeV/c. In the ppPdp` reaction at 1930.477 MeV/c incident beam momentum, the forward going pions (h #... "03) and the backward going deuterons (h #... "1803) have the same laboratory momentum. Such coincident(More)
We present the results of application of Hasse diagrams to the problem of synthesizing ternary quantum circuits represented as input-output mapping vectors. The paper specifically focuses on ternary quantum circuits with relatively large number of variables where valid solutions exist in an exponentially expanding search space. Valid solutions represent the(More)
  • B. Razen, M. G. Betigeri, +30 authors K. Zwoll
  • 2005
M.G. Betigeri , J. Bojowald , A. Budzanowski , A. Chatterjee i M. Drochner , J. Ernst , S. Förtsch , L. Freindl , D. Frekers h W. Garske , K. Grewer , A. Hamacher , M. Hawash , S. Igel a I. Ilieva , R. Jahn , L. Jarczyk , G. Kemmerling , K. Kilian a S. Kliczewski , W. Klimala , D. Kolev f , T. Kutsarova , B.J. Lieb k G. Lippert , H. Machner , A. Magiera ,(More)
In this paper we present improvements to the cost of quantum circuits implemented with 2n-lines circuit implementation. The 2n-line circuit implementation is intended for the linear nearest neighbor quantum circuits and implements any quantum circuits in such manner that they can be directly mapped to quantum implementations. In this paper we propose a(More)
  • 1