We already have the second and the first is based on the idea that qbits can be stabilized enough to actually accomplish any of the algorithms that would make quantum computers useful.

In 2001, Shor’s algorithm was demonstrated by a group at IBM, who factored 15  into 3 × 5 , using an NMR implementation of a quantum computer with seven qubits.[10] After IBM’s implementation, two independent groups implemented Shor’s algorithm using photonic qubits, emphasizing that multi-qubit entanglement was observed when running Shor’s algorithm circuits.[11][12] In 2012, the factorization of 15  was performed with solid-state qubits.[13] Later, in 2012, the factorization of 21  was achieved.[14] In 2016, the factorization of 15  was performed again using trapped-ion qubits.[15] However, none of these demonstrations fulfill the requirements of Shor’s algorithm: they compile the circuit using prior knowledge of the solution, and some have even oversimplified the algorithm in a way that makes it equivalent to coin flipping.[16]

Unless the US MIC has evidence that Quantum computing is reaching viability, this is just them hedging their bets in case some research actually leads to something, which means it’s currently just a pre-emptive hype train.