SearcharxivSearch

arXiv subjects

Some Sankar Bhattacharya

Publications and source records attributed to Some Sankar Bhattacharya.

At least 19 recordsLinked to original sources

Entanglement-assisted Hamiltonian dynamics learning

Approximating the dynamics given by a complex many-body Hamiltonian with a simpler effective model lies at the interface of quantum Hamiltonian learning and quantum simulation. In this context, quantum generative adversarial networks (QGANs) have been shown to outperform standard Trotter-based approximations. However, their performance is often hindered by training plateaus and local minima that become increasingly severe with system size. To overcome these limitations, we propose an entanglement-assisted learning strategy that couples a single randomly initialized auxiliary qubit to the learning system at an intermediate stage of the training process. The interplay between randomization and entanglement significantly enhances the learning performance of the protocol.

quant-ph

Local Inaccessibility of Random Classical Information and Their Implications in the Change Point Problem

Discrimination of quantum states under local operations and classical communication (LOCC) is an intriguing question in the context of local retrieval of classical information, encoded in the multipartite quantum systems. All the local quantum state discrimination premises, considered so far, mimic a basic communication set-up, where the spatially separated decoding devices are independent of any additional input. Here, exploring a generalized communication scenario, we introduce a framework for input-dependent local quantum state discrimination, which we call local random authentication (LRA). We report that impossibility of LRA certifies the presence of entangled states in the ensemble, a feature absent from erstwhile nonlocality arguments based on local state discrimination. Additionally, we explore the salient features of this state discrimination prototype for arbitrary set of orthogonal quantum states and compare them with the traditional notion of local quantum state discrimination. Finally, our results reveal a fundamental information-theoretic implications in the local estimation of quantum change point problems.

quant-ph

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

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 $Θ(2^{n})$ bits with respect to classical communication $Θ(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 $Θ(1)$ while the classical complexity is $Θ(\log_2 m)$. Remarkably, the input size is $Θ(\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

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

Classical analogue of quantum superdense coding and communication advantage of a single quantum system

We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games cannot be won given a noiseless $1$-bit classical channel from the sender to the receiver. Interestingly, the goal can be perfectly achieved if the channel is assisted with classical shared randomness. This resembles an advantage similar to the quantum superdense coding phenomenon where pre-shared entanglement can enhance the communication utility of a perfect quantum communication line. Quite surprisingly, we show that a qubit communication without any assistance of classical shared randomness can achieve the goal, and hence establishes a novel quantum advantage in the simplest communication scenario. In pursuit of a deeper origin of this advantage, we show that an advantageous quantum strategy must invoke quantum interference both at the encoding step by the sender and at the decoding step by the receiver. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces. We come up with communication tasks that can be achieved neither with $1$-bit of classical communication nor by communicating a polygon system, whereas $1$-qubit communication yields a perfect strategy, establishing quantum advantage over them. To this end, we show that the quantum advantages are robust against imperfect encodings-decodings, making the protocols implementable with presently available quantum technologies.

quant-ph

Randomness-free Test of Non-classicality: a Proof of Concept

Quantum correlations and non-projective measurements underlie a plethora of information-theoretic tasks, otherwise impossible in the classical world. Existing schemes to certify such non-classical resources in a device-independent manner require seed randomness, which is often costly and vulnerable to loopholes, for choosing the local measurements performed on different parts of a multipartite quantum system. In this letter, we propose and experimentally implement a semi-device independent certification technique for both quantum correlations and non-projective measurements without seed randomness. Our test is semi-device independent in the sense that it requires only prior knowledge of the dimensions of the parts. We experimentally show a novel quantum advantage in correlated coin tossing by producing specific correlated coins from pairs of photons entangled in their transverse spatial modes. We establish the advantage by showing that the correlated coin obtained from the entangled photons cannot be obtained from two 2-level classical correlated coins. The quantum advantage requires performing qubit trine positive operator-valued measures (POVMs) on each part of the entangled pair, thus also certifying such POVMs in a semi-device-independent manner. This proof of concept firmly establishes a new cost-effective certification technique for both generating non-classical shared randomness and implementing non-classical measurements, which will be important for future multi-party quantum communications.

quant-ph

Quantum theory is exclusive: a distributed computing setup

The framework of distributed computing, consisting of several spatially separated input-output servers, has immense importance in distant data manipulation. One of the most challenging parts of this setting is to optimize the use of information transmission lines among distant servers. In this work, we have modeled such a physically motivated distributed computing setup for which quantum communication outperforms its classical counterpart, in terms of a limited usage of noiseless transmission lines. Moreover, a broader class of communication entities, that allow state-effect description more exotic than quantum and are described within the framework of generalized probabilistic theory, also fail to meet the strength of quantum theory. The computational strength of quantum communication has further been justified in terms of a stronger version of this task, namely the delayed-choice distributed computation. The proposed task thus provides a new approach to operationally single out quantum theory in the theory-space and hence promises a novel perspective towards the axiomatic derivation of Hilbert space quantum mechanics.

quant-ph

Indefinite causal order enables perfect quantum communication with zero capacity channels

Quantum mechanics is compatible with scenarios where the relative order between two events can be indefinite. Here we show that two independent instances of a noisy process can behave as a perfect quantum communication channel when used in a coherent superposition of two alternative orders. This phenomenon occurs even if the original process has zero capacity to transmit quantum information. In contrast, perfect quantum communication does not occur when the message is sent directly from the sender to the receiver through a superposition of alternative paths, with an independent noise process acting on each path. The possibility of perfect quantum communication through independent noisy channels highlights a fundamental difference between the superposition of orders in time and the superposition of paths in space.

quant-ph

Composition of multipartite quantum systems: perspective from time-like paradigm

Figuring out the physical rationale behind natural selection of quantum theory is one of the most acclaimed quests in quantum foundational research. This pursuit has inspired several axiomatic initiatives to derive mathematical formulation of the theory by identifying general structure of state and effect space of individual systems as well as specifying their composition rules. This generic framework can allow several consistent composition rules for a multipartite system even when state and effect cones of individual subsystems are assumed to be quantum. Nevertheless, for any bipartite system, none of these compositions allows beyond quantum space-like correlations. In this letter we show that such bipartite compositions can admit stronger than quantum correlations in the time-like domain and, hence, indicates pragmatically distinct roles carried out by state and effect cones. We discuss consequences of such correlations in a communication task, which accordingly opens up a possibility of testing the actual composition between elementary quanta.

quant-ph

Local Quantum State Marking

We propose the task of local state marking (LSM), where some multipartite quantum states chosen randomly from a known set of states are distributed among spatially separated parties without revealing the identities of the individual states. The collaborative aim of the parties is to correctly mark the identities of states under the restriction that they can perform only local quantum operations (LO) on their respective subsystems and can communicate with each other classically (CC) -- popularly known as the operational paradigm of LOCC. While mutually orthogonal states can always be marked exactly under global operations, this is in general not the case under LOCC. We show that the LSM task is distinct from the vastly explored task of local state distinguishability (LSD) -- perfect LSD always implies perfect LSM, whereas we establish that the converse does not hold in general. We also explore entanglement assisted marking of states that are otherwise locally unmarkable and report intriguing entanglement assisted catalytic LSM phenomenon.

quant-ph

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

Multi-copy adaptive local discrimination: Strongest possible two-qubit nonlocal bases

Ensembles of composite quantum states can exhibit nonlocal behaviour in the sense that their optimal discrimination may require global operations. Such an ensemble containing N pairwise orthogonal pure states, however, can always be perfectly distinguished under adaptive local scheme if (N-1) copies of the state are available. In this letter, we provide examples of orthonormal bases in two-qubit Hilbert space whose adaptive discrimination require 3 copies of the state. For this composite system we analyze multi-copy adaptive local distinguishability of orthogonal ensembles in full generality which in turn assigns varying nonlocal strength to different such ensembles. We also come up with ensembles whose discrimination under adaptive separable scheme require less number of copies than adaptive local schemes. Our construction finds important application in multipartite secret sharing tasks and indicates towards an intriguing super-additivity phenomenon for locally accessible information.

quant-ph

Random-Receiver Quantum Communication

We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver chosen from a list of n spatially separated parties. The choice of receiver is unknown to the sender, but is known by the n parties, who coordinate their actions by exchanging classical messages. In normal conditions, random-receiver quantum communication requires a noiseless quantum communication channel from the sender to each of the n receivers. In contrast, we show that random-receiver quantum communication can take place through entanglement-breaking channels if the order of such channels is controlled by a quantum bit that is accessible through quantum measurements. Notably, this phenomenon cannot be mimicked by allowing free quantum communication between the sender and any subset of k<n parties.

quant-ph

Advantage of Quantum Theory Over Non-classical Models of Communication

Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of these tasks by allowing supra-quantum correlations in `space-like' and/or `time-like' paradigms. In this letter we propose a communication task involving three spatially separated parties where one party (verifier) aims to verify whether the bit strings possessed by the other two parties (terminals) are equal or not. We call this task {\it authentication with limited communication}, the restrictions on communication being: (i) the terminals cannot communicate with each other, but (ii) each of them can communicate with the verifier through single use of channels with limited capacity. Manifestly, classical resources are not sufficient for perfect success of this task. Moreover, it is also not possible to perform this task with certainty in several non-classical theories although they might possess stronger `space-like' and/or `time-like' correlations. Surprisingly quantum resources can achieve the perfect winning strategy. The proposed task thus stands apart from all previously known communication tasks as it exhibits quantum advantage over other non-classical strategies.

quant-ph

The principle of information symmetry constrains the state-space in any physical theory

Symmetry shares an entwined history with the structure of physical theory. We propose a consequence of symmetry towards the axiomatic derivation of Hilbert space quantum theory. We introduce the notion of information symmetry (IS) and show that it constraints the state-space structure in any physical theory. To this end, we study the minimal error binary state discrimination problem in the framework of generalized probabilistic theories. A theory is said to satisfy IS if the probability of incorrectly identifying each of two randomly prepared states is same for both the states. It is found that this simple principle rules out several classes of theories while being perfectly compatible with quantum theory.

quant-ph

Environmental effects on nonlocal correlations

Environmental interactions are ubiquitous in practical instances of any quantum information processing protocol. The interaction results in depletion of various quantum resources and even complete loss in numerous situations. Nonlocality, which is one particular quantum resource marking a significant departure of quantum mechanics from classical mechanics, meets the same fate. In the present work we study the decay in nonlocality to the extent of the output state admitting a local hidden state model. Using some fundamental quantum channels we also demonstrate the complete decay in the resources in the purview of the Bell-CHSH inequality and a 3-settings steering inequality. We also obtain bounds on the parameter of the depolarizing map for which it becomes steerability breaking pertaining to a general class of two qubit states.

quant-ph

Two-Qubit Pure Entanglement as Optimal Social Welfare Resource in Bayesian Game

Entanglement is of paramount importance in quantum information theory. Its supremacy over classical correlations has been demonstrated in numerous information theoretic protocols. Here we study possible adequacy of quantum entanglement in Bayesian game theory, particularly in social welfare solution (SWS), a strategy which the players follow to maximize the sum of their payoffs. Given a multi-partite quantum state as an advice, players can come up with several correlated strategies by performing local measurements on their parts of the quantum state. A quantum strategy is called quantum-SWS if it is advantageous over a classical equilibrium (CE) strategy in the sense that none of the players has to sacrifice their CE-payoff rather some have incentive and at the same time it maximizes the sum of all players' payoffs over all possible quantum advantageous strategies. Quantum state yielding such a quantum-SWS is called a quantum social welfare advice (SWA). We show that any two-qubit pure entangled state, even if it is arbitrarily close to a product state, can serve as quantum-SWA in some Bayesian game. Our result, thus, gives cognizance to the fact that every two-qubit pure entanglement is the best resource for some operational task.

quant-ph