arXiv subjects

Sumit Rout

Publications and source records attributed to Sumit Rout.

8 recordsLinked to original sources

arXiv2026

Quantum work beyond classical (commuting) limits

Free energy fixes the maximum work of a thermodynamic process once the state and Hamiltonian are specified. A work-extraction task asks a different question: how much average work can a single device realize across several preparations and Hamiltonian settings? A classical work device is one whose Hamiltonian settings are mutually commuting. We place every branch at its best free-energy-limited work envelope and derive the corresponding classical limit on the task average. For pure preparations, the source is specified only by pairwise maximal-energy constraints: for each pair, the intrinsic maximal average energy under one common normalized Hamiltonian is bounded as part of the task data, while the work device is otherwise microscopically unrestricted. The benchmark is optimized over arbitrary-dimensional classical implementations. Incompatible Hamiltonian settings exceed this limit, even though every branch remains bounded by its own free-energy maximum. The advantage therefore does not arise in any single process, but in the average work of the task: incompatible Hamiltonians realize a value that no classical work device can attain. Hamiltonian incompatibility is thus a thermodynamic resource for work extraction.

quant-ph↗

arXiv2025

Facets of Non-locality and Advantage in Entanglement-Assisted Classical Communication Tasks

We reveal key connections between non-locality and advantage in correlation-assisted classical communication. First, using the wire-cutting technique, we provide a Bell inequality tailored to any correlation-assisted bounded classical communication task. The violation of this inequality by a quantum correlation is equivalent to its quantum-assisted advantage in the corresponding communication task. Next, we introduce wire-reading, which leverages the readability of classical messages to demonstrate advantageous assistance of non-local correlations in setups where no such advantage can be otherwise observed. Building on this, we introduce families of classical communication tasks in a Bob-without-input prepare-and-measure scenario, where non-local correlation enhances bounded classical communication while shared randomness assistance yields strictly suboptimal payoff. For the first family of tasks, assistance from any non-local facet leads to optimal payoff, while each task in the second family is tailored to a non-local facet. We reveal quantum advantage in these tasks, including qutrit over qubit entanglement advantage.

quant-ph↗

arXiv2024

Randomness-free Detection of Non-projective Measurements: Qubits & beyond

Non-projective measurements play a crucial role in various information-processing protocols. In this work, we propose an operational task to identify measurements that are neither projective nor classical post-processing of data obtained from projective measurements. Our setup involves space-like separated parties with access to a shared state with bounded local dimensions. Specifically, in the case of qubits, we focus on a bipartite scenario with different sets of target correlations. While some of these correlations can be obtained through non-projective measurements on a shared two-qubit state, it is impossible to generate these correlations using {\it projective simulable} measurements on bipartite qubit states, or equivalently, by using one bit of shared randomness and local post-processing. For certain target correlations, we show that detecting qubit non-projective measurements is robust under {\it arbitrary} depolarising noise, except in the limiting case. We extend this task for qutrits and demonstrate that some correlations achievable via local non-projective measurements cannot be reproduced by both parties performing the same qutrit {\it projective simulable} measurements on their pre-shared state. We provide numerical evidence for the robustness of this scheme under {\it arbitrary} depolarising noise. For a more generic consideration (bipartite and tripartite scenario), we provide numerical evidence for a projective-simulable bound on the reward function for our task. We also show a violation of this bound by using qutrit POVMs. From a foundational perspective, we extend the notion of non-projective measurements to general probabilistic theories (GPTs) and use a randomness-free test to demonstrate that a class of GPTs, called {\it square-bits or box-world} are unphysical.

quant-ph↗

arXiv2023

Unbounded Quantum Advantage in Communication with Minimal Input Scaling

In communication complexity-like problems, previous studies have shown either an exponential quantum advantage or an unbounded quantum advantage with an exponentially large input set $\Theta(2^{n})$ bits with respect to classical communication $\Theta(n)$ bits. In the former, the quantum and classical separation grows exponentially in input while the latter's quantum communication resource is a constant. Remarkably, it was still open whether an unbounded quantum advantage exists while the inputs do not scale exponentially. Here we answer this question affirmatively using an input size of optimal order. Considering two variants as tasks: 1) distributed computation of relation and 2) {\it relation reconstruction}, we study the one-way zero-error communication complexity of a relation induced by a distributed clique labelling problem for orthogonality graphs. While we prove no quantum advantage in the first task, we show an {\it unbounded quantum advantage} in relation reconstruction without public coins. Specifically, for a class of graphs with order $m$, the quantum complexity is $\Theta(1)$ while the classical complexity is $\Theta(\log_2 m)$. Remarkably, the input size is $\Theta(\log_2 m)$ bits and the order of its scaling with respect to classical communication is {\it minimal}. This is exponentially better compared to previous works. Additionally, we prove a lower bound (linear in the number of maximum cliques) on the amount of classical public coin necessary to overcome the separation in the scenario of restricted communication and connect this to the existence of Orthogonal Arrays. Finally, we highlight some applications of this task to semi-device-independent dimension witnessing and the detection of Mutually Unbiased Bases.

quant-ph↗

arXiv2020

Quantum Advantage for Shared Randomness Generation

Sharing correlated random variables is a resource for a number of information theoretic tasks such as privacy amplification, simultaneous message passing, secret sharing and many more. In this article, we show that to establish such a resource called shared randomness, quantum systems provide an advantage over their classical counterpart. Precisely, we show that appropriate albeit fixed measurements on a shared two-qubit state can generate correlations which cannot be obtained from any possible state on two classical bits. In a resource theoretic set-up, this feature of quantum systems can be interpreted as an advantage in winning a two players co-operative game, which we call the `non-monopolize social subsidy' game. It turns out that the quantum states leading to the desired advantage must possess non-classicality in the form of quantum discord. On the other hand, while distributing such sources of shared randomness between two parties via noisy channels, quantum channels with zero capacity as well as with classical capacity strictly less than unity perform more efficiently than the perfect classical channel. Protocols presented here are noise-robust and hence should be realizable with state-of-the-art quantum devices.

quant-ph↗

arXiv2019

Multiparty orthogonal product states with minimal genuine nonlocality

Nonlocality without entanglement and its subsequent generalizations offer deep information-theoretic insights and subsequently find several useful applications. Concept of genuinely nonlocal set of product states emerges as a natural multipartite generalization of this phenomenon. Existence of such sets eventually motivates the problem concerning their entanglement-assisted discrimination. Here, we construct examples of genuinely nonlocal product states for arbitrary number of parties. Strength of genuine nonlocality of these sets can be considered minimal as their perfect discrimination is possible with entangled resources residing in Hilbert spaces having the smallest possible dimensions. Our constructions lead to fully separable measurements that are impossible to implement even if all but one party come together. Furthermore, they also provide the opportunity to compare different multipartite states that otherwise are incomparable under single copy local manipulation.

quant-ph↗

arXiv2019

Genuinely Nonlocal Product Bases: Classification and Entanglement Assisted Discrimination

An orthogonal product basis of a composite Hilbert space is genuinely nonlocal if the basis states are locally indistinguishable across every bipartition. From an operational point of view such a basis corresponds to a separable measurement that cannot be implemented by local operations and classical communication (LOCC) unless all the parties come together in a single location. In this work we classify genuinely nonlocal product bases into different categories. Our classification is based on state elimination property of the set via orthogonality-preserving measurements when all the parties are spatially separated or different subsets of the parties come together. We then study local state discrimination protocols for several such bases with additional entangled resources shared among the parties. Apart from consuming less entanglement than teleportation based schemes our protocols indicate operational significance of the proposed classification and exhibit nontrivial use of genuine entanglement in local state discrimination problem.

quant-ph↗

arXiv2017

Quantum Locker Using a Novel Verification Algorithm and Its Experimental Realization in IBM Quantum Computer

It is well known that Grover's algorithm asymptotically transforms an equal superposition state into an eigenstate (of a given basis). Here, we demonstrate a verification algorithm based on weak measurement which can achieve the same purpose even if the qubit is not in an equal superposition state. The proposed algorithm highlights the distinguishability between any arbitrary single qubit superposition state and an eigenstate. We apply this algorithm to propose the scheme of a Quantum Locker, a protocol in which any legitimate party can verify his/her authenticity by using a newly developed quantum One-Time Password (OTP) and retrieve the necessary message from the locker. We formally explicate the working of quantum locker in association with the quantum OTP, which theoretically offers a much higher security against any adversary, as compared to any classical security device.

quant-ph↗