CC 2022 (series) / CC Research Papers /
A Polynomial Time Exact Solution to the Bit-Aware Register Binding Problem
Tue 5 Apr 2022 12:10 - 12:25 at CC Virtual Room - Session 1: Quantum Computing and Hardware Design Chair(s): Bruno Bodin
Finding the minimum register bank is an optimization problem related to the synthesis of hardware. Given a program, the problem asks for the minimum number of registers plus their minimum size, in bits, that suffices to compile said program. This problem is NP-complete; hence, usually solved via heuristics. In this paper, we show that this problem has an optimal solution in polynomial time, as long as swaps can be inserted in the program to move variables across registers. This observation sets a lower bound to heuristics that minimize the size of register banks. We have compared the optimal algorithm with two classic heuristics. Our approach uses, on average, 6 to 10% less bits than that previous work.
Tue 5 AprDisplayed time zone: Eastern Time (US & Canada) change
Tue 5 Apr
Displayed time zone: Eastern Time (US & Canada) change
11:40 - 12:25 | Session 1: Quantum Computing and Hardware DesignCC Research Papers at CC Virtual Room Chair(s): Bruno Bodin Yale-NUS College | ||
11:40 15mPaper | QSSA: An SSA-Based IR for Quantum Computing CC Research Papers DOI | ||
11:55 15mPaper | QRANE: Lifting QASM Programs to an Affine IR CC Research Papers Blake Gerard University of Oklahoma, Tobias Grosser University of Edinburgh, Martin Kong The Ohio State University DOI | ||
12:10 15mPaper | A Polynomial Time Exact Solution to the Bit-Aware Register Binding Problem CC Research Papers Michael Canesche UFMG, Ricardo Ferreira UFV, Jose Augusto Nacif UFV, Fernando Magno Quintão Pereira Federal University of Minas Gerais DOI |