Fig. 2: Average reduction in polynomial degree and hence circuit depth for some common polynomials in the literature. | npj Quantum Information

Fig. 2: Average reduction in polynomial degree and hence circuit depth for some common polynomials in the literature.

From: Halving the cost of quantum algorithms with randomization

Fig. 2

davg is computed directly from the probabilities pi in Eq. (38), not from the bound in Eq. (45). The cutoff degree d* is selected according to Eq. (36), which depends on a choice of C and q obtained from n1, n2—see the explanation in the main text.

Back to article page