SearcharxivSearch

arXiv subjects

David González-Lociga

Publications and source records attributed to David González-Lociga.

3 recordsLinked to original sources

Quantum-Enhanced Zero-Error Communication and Storage under Positional Uncertainty

Permutation channels model communication and storage scenarios in which the positional identity of the physical carriers is partially or completely lost, so that the transmitted information is only accessible up to an unknown reordering. Here we show that quantum mechanics can dramatically enhance zero-error communication through such channels. For cyclic reorderings of $n$ $d$-level systems, and in the absence of positional metadata, the number of classical zero-error messages scales asymptotically as $d^n/n$, whereas quantum protocols can fully recover the identity-channel value $d^n$. Ancilla-assisted protocols further increase this number to $d^{2n}/n$, enabling dense coding under positional uncertainty. We also analyze dihedral permutation channels and derive general P\'olya-like formulas for the number of distinguishable messages in a broad class of permutation groups. Finally, for the symmetric group $S_n$, corresponding to complete scrambling of the information carriers, the number of distinguishable messages scales as $n^{d-1}$ classically, compared with $n^{d(d+1)/2-1}$ for quantum protocols and $n^{d^2-1}$ in the ancilla-assisted setting. Our results establish a fundamental quantum advantage for communication and storage under positional uncertainty.

quant-ph

Mixed-dimensional quantum MacWilliams identity: Bounds for codes and absolutely maximally entangled states in heterogeneous systems

As emerging quantum architectures evolve into heterogeneous networks combining different physical substrates, such as qubits for logic and higher-dimensional qudits for robust communication, the traditional scalar metrics of quantum error correction become insufficient. To address this, we introduce a mathematical framework based on dimension multisets to characterize quantum error-correcting codes (QECC) and absolutely maximally entangled (AME) states in mixed-dimensional Hilbert spaces. By replacing scalar weights with multisets, we accurately capture the exact physical composition of error supports across these diverse systems. Our central result is the mixed-dimensional quantum MacWilliams identity, which establishes the formal algebraic relationship between Shor-Laflamme enumerators and unitary weight enumerators. From this foundation, we deduce the mixed-dimensional shadow identity and derive rigorous, generalized constraints on code parameters, explicitly formulating the mixed-dimensional quantum Hamming, Singleton and Scott bounds, and developing a linear program to systematically evaluate code viability. For the Singleton bound, a tighter bound that has no homogeneous analogue is derived for pure mixed-dimensional codes. Finally, we deploy this enumerator machinery to thoroughly analyze AME states, utilizing shadow inequalities to constrain their existence and introducing a combinatorial grid method for the explicit construction of mixed-dimensional tripartite AME states.

quant-ph

Quantum Advantage in Identifying the Parity of Permutations with Certainty

We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is limited to random guessing. Quantum mechanics does it with certainty with as few as $\lceil \sqrt{n}\, \rceil$ distinguishable states per particle, thanks to entanglement. Below this threshold, not even quantum mechanics helps: both classical and quantum success are limited to random guessing. For small $n$, we provide explicit expressions for states that ensure perfect parity identification. We also assess the minimum entanglement these states need to carry, finding it to be close to maximal, and even maximal in some cases. The task requires no oracles or contrived setups and provides a simple, rigorous example of genuine quantum advantage.

quant-ph