[00716] Resource Efficient Boolean Function Solver on Quantum Computer
Session Time & Room : 4E (Aug.24, 17:40-19:20) @E711
Type : Contributed Talk
Abstract : Grover's algorithm is the best-known quantum search algorithm for problems when classical ones cannot outperform brute-force search. We propose several novel techniques to improve efficiency in solving boolean equations under Grover's algorithm framework. A W-cycle circuit construction strategy and a greedy compression technique are proposed for the oracle to reduce quantum resource usage. A randomized Grover's algorithm further reduces the circuit depth. Numerical results on boolean quadratic equations demonstrate the advantage of the proposed techniques.
