arXiv subjects

Archishna Bhattacharyya

Publications and source records attributed to Archishna Bhattacharyya.

6 recordsLinked to original sources

arXiv2026

Statistically secure uncloneable encryption of arbitrary messages

Unconditional uncloneable encryption of a single bit with efficient encryption and decryption is now possible. However, whether the extension to messages of arbitrary length achieves statistical security remains to be known. Using the fact that the encoding bases for the single-bit scheme known to be secure consist of a subset of the Clifford unitaries, we show that this scheme can be upgraded to achieve unconditional uncloneable encryption for messages of arbitrary length, with encoding time polynomial in the message length and security parameter. This establishes that one-time uncloneable encryption of arbitrary messages enjoys statistical security.

quant-ph↗

arXiv2026

The uncloneable bit exists

We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key. Our construction achieves security that approaches the ideal limit at a rate that is exponentially small in the security parameter, without employing any assumptions. Our proof invokes unitary invariance of the shared entangled state and simplifies the adversarial strategies by enforcing this symmetry. Crucially, it then rules out the sender being highly correlated with two non-communicating adversaries at once by an approximation property that we develop, for such unitarily invariant states, which yields a near-optimal bound on the probability of cloning. Consequently, no coordinated strategy beats random guessing of the encrypted bit, establishing unconditional uncloneability. This reveals the existence of an uncloneable bit in Nature and delineates a fundamental, physically enforced cryptographic primitive unavailable in classical settings.

quant-ph↗

arXiv2026

Uncloneable Encryption from Decoupling

We show that uncloneable encryption exists with no computational assumptions, with security $\widetilde{O}\left(\tfrac{1}λ\right)$ in the security parameter $λ$.

quant-ph↗

arXiv2026

On the undecidability of quantum channel capacities

An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is overwhelming evidence suggesting that quantum channel capacities may be uncomputable, a formal proof of any such statement is elusive. We initiate the study of the hardness of computing quantum channel capacities. We show that, for a general quantum channel, it is QMA-hard to compute its quantum capacity, and that the entanglement-assisted zero-error capacity under some restrictions is uncomputable; indicative of the fact that quantum channel capacities may generally be undecidable.

quant-ph↗

arXiv2025

Sequential transmission at short times

We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels $(Ξ^n)_{n \in \mathbb{N}}$ modelled as a discrete quantum Markov semigroup, long enough to generate entanglement at some finite $n$. This is achieved by interspersing the action of noise with quantum error correction in succession. We show this by means of a non-trivial lower bound on the one-shot quantum capacity in the sequential setting as a function of $n$, in an attempt to model a linear quantum network and assess its capabilities to distribute entanglement. Intriguingly, the rate of transmission of such a network turns out to be a property of the spectrum of the channels composed in sequence, and the maximum possible error in transmission can be bounded as a function of the noise model only. As an application, we derive an exact error bound for the infinite dimensional pure-loss channel believed to be the dominant source of noise in networks precluding the distribution of entanglement. We exemplify our results by analysing the amplitude damping channel and its bosonic counterpart.

quant-ph↗

arXiv2020

Memory of rheological stress in polymers using Fractional Calculus

The rheological properties of viscoelastic materials like polymer melts are greatly affected by factors like salinity, temperature, concentration and pH of the solution. In this study, the memory of the stress affected by each of these factors is shown to be trapped in the order of the fractional derivative of the dynamical equation describing stress and strain in the material. To demonstrate this, the rheological properties of the polymer melt hydrolyzed polyacrylamide HPAM have been modeled using a two element Maxwell model. The model has successfully reproduce existing experimental data on elastic modulus and complex viscosity for these stress factors, besides predicting the development of creep compliance with shear rate. The work also establishes that it is possible to tailor a particular rheological property by suitably tuning a pair of properties, complementary conjugates, that offset each others effects on the rheology. The study shows that HPAM has at least two pairs of complementary conjugates in temperature and pH, and concentration and pH. Further it is shown that the variation of viscosity with shear rate shows a power law behavior for almost all variations in stress parameters. Our modelling using fractional calculus establishes that the fractional order derivative q which is recognized as a memory index to emergent phenomena, shows an inverse relationship with respect to the power law exponent a, the higher the memory index q, the smaller is the power-law exponent a.

cond-mat.soft↗