  Building on recent constructions of Quantum Cross Subspace Alignment (QCSA)
codes, this work develops a coding scheme for QEBXSTPIR, i.e., classical
private information retrieval with $X$-secure storage and $T$-private queries,
over a quantum multiple access channel, that is resilient to any set of up to
$E$ erased servers (equivalently known as unresponsive servers, or stragglers)
together with any set of up to $B$ Byzantine servers. The scheme is accordingly
labeled QEBCSA, with the `E' and `B' indicating resilience to erased and
Byzantine servers respectively. The QEBCSA code structure may be broadly useful
for problems such as quantum coded secure distributed computation, where
security, straggler resilience, and distributed superdense coding gains are
simultaneously required. The $X$-security property is further exploited to
improve the communication rate when $\epsilon$-error decoding is allowed.
