Nick Thieme

For years, intermediate measurements made it hard to quantify the complexity of quantum algorithms. New work establishes that those measurements aren’t necessary after all.

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem.