A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.
In: Wermelinger, M., Gall, H.C
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
CSF is the first separation logic-based concolic testing engine for heap-manipulating programs that integrates specification-based testing to generate valid inputs with high coverage.
API misuses in data-centric libraries share key characteristics with deep learning misuses and occur regardless of whether documentation directives are present.
citing papers explorer
-
Linear-Time T-Gate Optimization via Random Abstraction
A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.
-
Concolic Testing Heap-Manipulating Programs
CSF is the first separation logic-based concolic testing engine for heap-manipulating programs that integrates specification-based testing to generate valid inputs with high coverage.
-
An Empirical Study of API Misuses of Data-Centric Libraries
API misuses in data-centric libraries share key characteristics with deep learning misuses and occur regardless of whether documentation directives are present.