Searcharxiv⌕ Search

arXiv subjects

Ekta Panwar

Publications and source records attributed to Ekta Panwar.

8 recordsLinked to original sources

The speed limit of gravitational entanglement and the cost of noise

Is gravity quantum? A proposed test lets two small masses, each in a superposition of two places, become entangled through their mutual gravity. Gravity is weak, so the masses must stay coherent for seconds while random forces disturb them. Here we ask how fast gravity can entangle two masses, and what noise costs. Without noise we find the maximum rate exactly: it falls as the inverse cube of the separation, and two positions per mass achieve it. Above a noise level set by the masses and their separation, gravity's leading pull can be imitated by classical signals, and every strategy is limited to a rate falling at least as the inverse fourth power. Exact, continuous error correction shields the masses from noise but hides them from each other: the best rate falls as the inverse seventh power, and six positions on a hexagon come within 10% of it at large separation.

quant-ph↗

A deployed four-city entanglement-based QKD network with real-time key delivery, benchmarked against finite-key security bounds

Quantum key distribution (QKD) generates shared secret keys whose security rests on the laws of physics rather than on computational assumptions. We report the entanglement-based segment of the Slovak national quantum communication infrastructure, connecting four cities in western Slovakia over deployed telecommunication fiber. Polarization-entangled photons generated at a central node are passively routed by wavelength to form a trusted-node-free, fully meshed sub-network of three cities, with the fourth connected through the central node and all links operated simultaneously. We also introduce a matrix formalism for passive wavelength routing that enables the algorithmic construction of uniquely and fully connected topologies. Unlike most previous demonstrations, which estimate key rates from raw coincidences, all rates reported here are obtained after the complete post-processing chain, with keys delivered in real time via ETSI GS QKD 014. With partial non-local chromatic dispersion compensation, we obtain 13.5 bit/s over 109 km, and 4.3 bit/s over 32.1 dB of accumulated loss between two cities without a direct fiber link. Benchmarking against finite-key security bounds shows that the implemented heuristic privacy amplification can exceed the finite-key bound, and that replacing detect-and-discard with error correction would increase the finite-key rate by a factor of 4.1-6.6, and yield a positive finite-key rate on the 142.9 km link where the implemented scheme yields none.

quant-ph↗

Exact Resource Laws for Passive Wavelength Routing in Entanglement Networks

Entanglement-based networks provide a scalable framework for multiuser quantum communication by passively routing spectrally correlated photon pairs across interconnected nodes. Several wavelength-allocation schemes have already been demonstrated experimentally, but these designs do not yet provide a general way to determine how spectral use, receiver load, repeated connections, fan-out, and optical loss constrain one another. Motivated by a field-deployed four-node network, we formulate wavelength assignment as an exact resource-optimization problem on the network connectivity graph. We consider uniquely paired wavelength channels and require that no user receive both channels of a pair. For one-sided fan-out, we obtain an exact optimization for arbitrary networks, and closed-form resource laws for complete networks and for networks with one excluded partner per user. Allowing both conjugate wavelengths to fan out changes the resource landscape. In complete networks, a balanced binary hierarchy uses the minimum number of spectral layers among nonredundant assignments while reducing the maximum receiver wavelength load to a quantity that grows logarithmically with the number of users. For eight users, the source-cost ordering depends on splitter transmission: changing the transmission can change which architecture requires less pair generation. We formulate a BBM92 rate model for evaluating the corresponding architectures. For a single continuous-wave broadband source, the occupied wavelength pairs are generated with fixed relative weights, while detector singles and accidental coincidences couple the link rates. The same resource laws can therefore be evaluated using the measured parameters of the hardware that implements the network.

quant-ph↗

Semi-Device-Independent Quantum Key Distribution from Operational Assumptions

Semi-device-independent quantum key distribution leaves the measurement devices uncharacterized while placing a trusted assumption on Alice's source. We formulate this source assumption operationally on Alice's four-preparation ensemble as a scalar bound on one of four physically motivated source tasks: full-label guessing, parity guessing, or their normalized composites with label exclusion. For the two-bit random-access code, we derive the exact classical frontier for each of the four source assumptions. Numerically, the BB84 strategy attains the maximal quantum deviation from all four frontiers, while the preparation-depolarized BB84 family and the direct-sum label-leakage family trace complementary branches of the arbitrary-dimensional quantum boundary for the two exclusion-assisted assumptions. Because all four task values are monotone under input-independent quantum channels, the same scalar source bound constrains every Bob--Eve extension compatible with the complete observed behavior. Using a three-setting extension that separates RAC testing from key generation, we obtain two dimension-independent security certificates over this feasible set: lower bounds on the conditional min-entropy and conditional von Neumann entropy, obtained respectively by direct optimization of Eve's key-guessing probability and by prepare-and-measure semidefinite relaxations based on the Brown--Fawzi--Fawzi variational bound. The exclusion-assisted assumptions certify positive key rates down to nearly vanishing preparation visibility, far beyond full-label or parity guessing alone. Under direct-sum label leakage, all four independently optimized rate bounds remain positive at every sampled incomplete-leakage point and vanish only at complete label revelation. These results show that robust semi-device-independent security depends not only on what Eve can identify, but also on what she can exclude.

quant-ph↗

Self-testing tilted strategies for maximal loophole-free nonlocality

The degree of experimentally attainable nonlocality, as gauged by the loophole-free or effective violation of Bell inequalities, remains severely limited due to inefficient detectors. We address an experimentally motivated question: Which quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors? For any Bell inequality and any specification of detection efficiencies, the optimal strategies are those that maximally violate a tilted version of the Bell inequality in ideal conditions. In the simplest scenario, we demonstrate that the quantum strategies that maximally violate the doubly-tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries. We utilize a Jordan's lemma and Gröbner basis-based proof technique to analytically derive self-testing statements for the entire family of doubly-tilted CHSH inequalities and numerically demonstrate their robustness. These results enable us to reveal the insufficiency of even high levels of the Navascués--Pironio--Acín hierarchy to saturate the maximum quantum violation of these inequalities.

quant-ph↗

Quantitative non-classicality of mediated interactions

In plethora of physical situations one can distinguish a mediator -- a system that couples other, non-interacting systems. Often the mediator itself is not directly accessible to experimentation, yet it is interesting and sometimes crucial to understand if it admits non-classical properties. An example of this sort that recently enjoys considerable attention are two quantum masses coupled via gravitational field. It has been argued that the gain of quantum entanglement between the masses indicates non-classicality of the states of the whole tripartite system. Here, we focus on non-classical properties of the involved interactions rather than the states. We derive inequalities whose violation indicates non-commutativity and non-decomposability (open system generalisation of non-commuting unitaries) of interactions through the mediators. The derivations are based on properties of general quantum formalism and make minimalistic assumptions about the studied systems, in particular the interactions can remain uncharacterised throughout the assessment. Furthermore, we also present conditions that solely use correlations between the coupled systems, excluding the need to measure the mediator. Next, we show that the amount of violation places a lower bound on suitably defined degree of non-decomposability. This makes the methods quantitative and at the same time experiment ready. We give applications of these techniques in two different fields: for detecting non-classicality of gravitational interaction and in bounding the Trotter error in quantum simulations.

quant-ph↗

Hierarchy of quantum correlations under non-Markovian dynamics

We investigate the dynamics of quantum correlations (QC) under the effects of reservoir memory, as a resource for quantum information and computation tasks. Quantum correlations of two-qubit systems are used for implementing quantum teleportation successfully, and for investigating how teleportation fidelity, violation of Bell-CHSH inequality, quantum steering and entanglement are connected with each other under the influence of noisy environments. Both Markovian and non-Markovian channels are considered, and it is shown that the decay and revival of correlations follow the hierarchy of quantum correlations in the state space. Noise tolerance of quantum correlations are checked for different types of unital and non-unital quantum channels, with and without memory. The quantum speed limit time $(τ_{QSL})$ is investigated from the perspective of memory of quantum noise, and the corresponding dynamics is used to analyze the evolution of quantum correlations. We establish the connection between information backflow, quantum speed limit time and dynamics of quantum correlations for non-Markovian quantum channels.

quant-ph↗

An elegant proof of self-testing for multipartite Bell inequalities

The predictions of quantum theory are incompatible with local-causal explanations. This phenomenon is called Bell non-locality and is witnessed by violation of Bell-inequalities. The maximal violation of certain Bell-inequalities can only be attained in an essentially unique manner. This feature is referred to as self-testing and constitutes the most accurate form of certification of quantum devices. While self-testing in bipartite Bell scenarios has been thoroughly studied, self-testing in the more complex multipartite Bell scenarios remains largely unexplored. This work presents a simple and broadly applicable self-testing argument for N-partite correlation Bell inequalities with two binary outcome observables per party. Our proof technique forms a generalization of the Mayer-Yao formulation and is not restricted to linear Bell-inequalities, unlike the usual sum of squares method. To showcase the versatility of our proof technique, we obtain self-testing statements for N party Mermin-Ardehali-Belinskii-Klyshko (MABK) and Werner-Wolf-Weinfurter-Żukowski-Brukner (WWWŻB) family of linear Bell inequalities, and Uffink's family of N party quadratic Bell-inequalities.

quant-ph↗