Fault tolerance is essential for reliable quantum computation because quantum information (qubits) is inherently fragile. This workshop gathers experts on two primary, interconnected thrusts to advance fault-tolerant quantum computing: quantum low-density parity-check (qLDPC) codes and the Clifford hierarchy. Several families of qLDPC codes have been constructed recently, including quantum Tanner, hypergraph product, and lifted product codes. While they perform well when paired with iterative decoders, their capabilities remain to be fully understood. In particular, it remains an open question how to employ these constructions to achieve provably strong performance in practical (finite-length) settings and to describe decoding failures. Another key challenge is to leverage the Clifford hierarchy, the first two levels of which are the Pauli group and Clifford group, respectively. Because a classical computer can efficiently simulate the Clifford group, additional gates are needed for quantum computation. There are synergies across these thrusts, especially the theory of qLDPC codes that respect gates that support fault-tolerant quantum computing.