An Examination of the NCV-|u1 > Quantum Library Based on Minimal Circuits

In the recent past, significant effort has been put on the investigation of design methods for quantum circuits. Based on different physical realizations, several gate libraries have been proposed for this purpose. Recently, the so-called NCV-|v₁> library has been introduced in this context. In contrast to established libraries, the NCV-|v₁> library seems to inherit some significant advantages compared to established ones, e.g. with respect to the mapping from reversible circuits or the satisfaction of nearest neighbour constraints. However, all these conclusions have been drawn based on heuristically results. In this work, we perform a more in-depth examination of the NCV-|v₁> library based on minimal circuits. For this purpose, an exact synthesis scheme is proposed which utilizes the power of solvers for Boolean satisfiability. Our examination clearly unveiled that, from a logic design perspective, the NCV-|v₁> library indeed superiors the currently established library.