
dr Anubhav Chaturvedi
Employment
- Assistant professor at Institute Of Physics And Applied Computer Science
Publications
Filters
total: 4
Catalog Publications
Year 2025
-
Self-testing tilted strategies for maximal loophole-free nonlocality
PublicationThe 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...
-
Self-testing tilted strategies for maximal loophole-free nonlocality
PublicationThe 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...
Year 2024
-
Extending loophole-free nonlocal correlations to arbitrarily large distances
PublicationQuantum theory allows spatially separated observers to share nonlocal correlations, which enable them to accomplish classically inconceivable information processing and cryptographic feats. However, the distances over which nonlocal correlations can be realized remain severely limited due to their high fragility to noise and high threshold detection efficiencies. To enable loophole- free nonlocality across large distances, we introduce...
-
Unbounded quantum advantage in communication complexity measured by distinguishability
PublicationCommunication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties. The standard quantification of one-way communication complexity relies on the minimal dimension of the communicated systems. In this paper, we measure the communication complexity of a task by the minimal distinguishability required to accomplish it,...
seen 870 times