Quantum state preparation and oracles got cheaper at QCE26, on paper

This guide follows 18 talks on the standard parts inside quantum algorithms at IEEE Quantum Week 2026 in Toronto. Gate counts fell, sometimes sharply, and nearly all of it happened in proofs, simulations and counts. On the Sunday morning of IEEE Quantum Week 2026, in Room 713B of the Metro Toronto Convention Centre, a paper from Fujitsu made a quantum circuit cheaper by doing something any filing clerk could do. Yusuke Kimura and Yutaka Takita shuffled the rows of a table before any circuit was built. In their worked example, the circuit that looks those rows up came out with half its Toffoli gates, the most expensive kind it used. The talk was about lookup tables, yet the same move ran through the week’s work on oracles, arithmetic and quantum state preparation, the step that loads data into a quantum computer. Most of the savings were bought on an ordinary computer before the quantum one was switched on. The famous quantum algorithms are built from a short list of standard parts. The first is quantum state preparation, which loads numbers into the amplitudes of a set of qubits, the weights whose squares give the chance of each outcome. The second…