TL;DR
This work proposes two SMT encodings: an exact-G encoding and an at-most-G encoding with null gates, which enables automated synthesis of practical 5-bit S-box quantum circuits, such as KECCAK and ASCON.
It is demonstrated that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types, and it is found that MPS efficiency depends sensitively on implementation choices.
This work presented, to the best of the knowledge, the first reported 12-CNOT decomposition of the double qubit excitation operator, and compared the new circuit with the previous SOTA 13-CNOT circuits in 4 different metrics.
This work develops PTN constructions based on different native entangling-gate realizations, namely CZ, CZSWAP, and iSWAP, providing flexibility to accommodate different hardware capabilities on both static and mobile neutral-atom platforms.
A measurement of what diagrammatic post-processing recovers from structural redundancy in the Solovay-Kitaev algorithm, which optimizes for numerical convergence rather than circuit economy, and its output carries structural redundancy that a gate-level compiler cannot see.
A novel compact representation named X-Map decision diagram (XMDD) for Boolean functions, which integrates local invertible maps and complement edges to achieve higher compression efficiency, is proposed and an optimized quantum oracle synthesis algorithm is developed.
A unified, highly scalable methodology for the optimal design of reversible circuits across both libraries is presented, establishing best-known upper bounds that significantly outperform heuristic literature benchmarks.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
