From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- 12 January 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Quantum Information Processing
- Vol. 20 (1), 1-55
- https://doi.org/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 a general method for this problem. Due to the fact that every Boolean function can be represented by a sum-of-squares of some multilinear polynomials, in this paper a primary algorithm framework is proposed with three basic steps: The first basic step is to find sum-of-squares representations of the Boolean function and its negation function; the second basic step is to construct a state which is assumed to be the final state of an optimal exact quantum query algorithm; the third basic step is to find each unitary operator in the undetermined algorithm. However, there still exist some intractable problems such that the algorithm framework may not be feasible in some cases, but it can be used to investigate the quantum query model with low complexity, such as Deutsch’s problem, a five-bit symmetric Boolean function and the characterization of Boolean functions with exact quantum 2-query complexity.Keywords
Funding Information
- NSFC (61572532)
This publication has 23 references indexed in Scilit:
- On Exact Quantum Query ComplexityAlgorithmica, 2013
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Quantum algorithms for the ordered search problem via semidefinite programmingPhysical Review A, 2007
- A Sum of Squares Approximation of Nonnegative PolynomialsSIAM Journal on Optimization, 2006
- Complexity measures and decision tree complexity: a surveyTheoretical Computer Science, 2002
- Quantum lower bounds by polynomialsJournal of the ACM, 2001
- The homology of certain subgroups of the symmetric group with coefficients inJournal of Pure and Applied Algebra, 1998
- On the degree of boolean functions as real polynomialscomputational complexity, 1994
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985