Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators Hideaki FUKUHARAEiji TAKIMOTO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/02/01 Vol. E93-DNo. 2 ;
pp. 280-289 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: quantum query complexity, read-once formulas, decision trees, adversary method,