SearcharxivSearch

arXiv subjects

Arnau Diebra

Publications and source records attributed to Arnau Diebra.

4 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ólya-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

Exact identification of unknown unitary processes

The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of $n$ devices is intended to apply the same unitary operation, but $k$ malfunctioning devices among them apply a different, unknown unitary action. Under the assumption of complete ignorance regarding the specific unitary transformation applied, we model our hypotheses using representation-theoretic tools and study the zero-error protocol for identifying these faulty devices. We derive the optimal success probability for the single- and two-anomaly scenarios, demonstrating that it is independent of the total number of devices in the series. Furthermore, we present a simple protocol that makes use of ancillary systems that achieves this optimal limit. Notably, this protocol offers significant operational advantages, such as allowing us to test each device independently. Finally, we extend our analysis to the general scenario in which both the number of anomalies and the local dimension of the systems are arbitrary, evaluating our protocol's performance and conjecturing its global optimality in the general case.

quant-ph

Quantum state exclusion for group-generated ensembles of pure states

Quantum state exclusion is the task of determining which states from a given set a system was not prepared in. We provide a complete solution to optimal quantum state exclusion for arbitrary sets of pure states generated by finite groups, establishing necessary and sufficient conditions for perfect (zero-error conclusive) exclusion. When perfect exclusion is impossible, we introduce two natural extensions: minimum-error and unambiguous exclusion. For both, we derive the optimal protocols and present analytical expressions for the corresponding failure probabilities and measurements, providing additional insight into how quantum states encode information.

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