- Compilation/
RowCol Algorithm
RowCol Algorithm
Academic resource(s)
Explore foundational research through preprint papers, scholarly articles, and textbooks that introduce, use, and extend this technique.
This work presents methods to optimize the size and depth of CNOT circuits under constrained topologies. It is a subroutine to many other quantum compilation techniques.
This paper introduces the parity matrix intermediate representation of CNOT circuits. It proposes a technique based on Gaussian elimination and Steiner trees, and has been further refined to work with arbitrary topologies in the RowCol algorithm.
Early CNOT routing algorithm for constrained connectivity. The worst-case scaling of 4n² is improved upon in RowCol algorithm.
