Bosonic codes offer hardware-efficient approaches to logical qubit construction and hosted the first demonstration of beyond-break even logical quantum memory. However, such accomplishments were done for idling information, and realization of fault-tolerant logical operations remains a critical bottleneck for universal quantum computation in scaled systems. Error-transparent (ET) gates offer an avenue to resolve this issue, but experimental demonstrations have been limited to phase gates. Here, we introduce a framework based on dynamic encoding subspaces that enables simple linear drives to accomplish universal gates that are error semi-transparent (EsT) to oscillator photon loss. With an EsT logical gate set of {X, H, T}, we observe a five-fold reduction in infidelity conditioned on photon loss, demonstrate extended active-manipulation lifetimes with quantum error correction, and construct a composite EsT non-Clifford operation using a sequence of eight gates from the set. Our approach is compatible with methods for detectable ancilla errors, offering an approach to error-mitigated universal control of bosonic logical qubits with the standard quantum control toolkit.
We provide the numerical codes to produce the data contained in "Competition between pair and single-particle superfluidity in bosonic quasi-flat bands: A Gaussian state approach", https://arxiv.org/abs/2605.26231, as well as notebooks to plot them. v1 contains a minimal version of Python and Julia codes. v2 provides the final version of the plots, explicitly stores data used in the plots and avoids Julia notebooks (in order to avoid compatibility issues). The LaTeX script allows to generate the manuscipt. Some of the Python codes rely on the external library QuSpin.py.