摘要: In this talk, we describe two recent developments in quantum algorithms. The first new development is a algorithm for evaluating Boolean formula consisting of AND and OR gates size N time O(√N). This provides speedups any problem that can be expressed via formulas. result also extended to span problems, generalization an optimal function the black-box query model. The second solving systems linear equations. contrast with traditional algorithms run O(N2.37...) where system, runs O(logc N). It outputs state describing solution system.