From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
Sign Up to like & getrecommendations! Published in 2021 at "Quantum Information Processing"
DOI: 10.1007/s11128-020-02975-0
Abstract: In quantum computation, designing an optimal exact quantum query algorithm (i.e., a quantum decision tree algorithm) for any small input Boolean function is a fundamental and abstract problem. As we are aware, there is not… read more here.
Keywords: function; quantum query; exact quantum; boolean function ... See more keywords