Researchers have made a significant breakthrough in reducing the physical spacetime overhead in fault-tolerant quantum computation by introducing phantom codes. These codes achieve logical entangling gates through physical qubit permutations and Pauli-frame updates, rather than relying on traditional methods. The key question is whether this approach can be integrated with the low-weight stabilizer structure of quantum low-density parity-check (qLDPC) codes, which are crucial for low-overhead fault-tolerant quantum computing. By exploring the coexistence of phantom codes with qLDPC codes, scientists can potentially minimize the physical resources required for quantum computation. The study of logical entangling with phantom codes in hypergraph products1 has significant implications for the development of efficient quantum computing architectures. This advancement matters to practitioners because it could lead to more efficient and scalable quantum computing systems, ultimately rewriting the rules of computation and cryptography.