stomp-code

Haskell implementation of the T-count optimization algorithm "Stomp"

instruction to run

install Haskell platform
install Quipper
compile Main using "ghc -O2 Main"
create "Stomp" folder(in the same folder where you executable Main is)
run "./Main -tcount A.log -identity 45 -order wire B", where A is your log file name, B is your circuit. we support "tfc" format classical reversible circuit (.tfc extension), and Quipper circuit format (empty extension or any extension).
relevant statistics will be in A.log file. The optimized circuit will be in .qc format and in the Stomp folder, together with the input circuit in .qc format.
the optimized and input .qc circuits can be piped to "feynver" for verification.

This code runs, and is the basis of our results, but is not in an ideal state; this is to be addressed in future revisions.

Name		Name	Last commit message	Last commit date
Latest commit History 20 Commits
benchmark		benchmark
.gitignore		.gitignore
CirParser.hs		CirParser.hs
Circuit4.hs		Circuit4.hs
Fast.hs		Fast.hs
GateStruct.hs		GateStruct.hs
LICENSE		LICENSE
Latex.hs		Latex.hs
Main.hs		Main.hs
QCParser.hs		QCParser.hs
QCParser2.hs		QCParser2.hs
QuipperParser.hs		QuipperParser.hs
README.md		README.md
Squeeze.hs		Squeeze.hs
Squeeze3.hs		Squeeze3.hs
TfcParser.hs		TfcParser.hs
TfcParser2.hs		TfcParser2.hs
ToFile.hs		ToFile.hs
ToQC.hs		ToQC.hs
Todd.hs		Todd.hs
ZX8.hs		ZX8.hs