dnf model counting 1klee's measure problem 1set coverage 1streaming algorithms 1union size estimation 1
From the 1 of 21 papers with an AI index.
6 citations
- Ben-Gurion University of the NegevIL2 papers
- Jamia Millia IslamiaIN2 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
- S.N. Bose National Centre for Basic SciencesIN2 papers
- University of LeedsGB2 papers
- Centre for Research in Astrophysics of QuébecCA1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Design Science (United Kingdom)GB1 paper
- Durban University of TechnologyZA1 paper
- Harish-Chandra Research InstituteIN1 paper
- Indian Institute of Technology GoaIN1 paper
- Indian Institute of Technology JammuIN1 paper
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026★ 1 cited
Multipartite Hardy paradox unlocks device-independent key sharing
Ranendu Adhikary, Mriganka Mandal
We introduce a device-independent quantum key distribution protocol for N parties, using the multipartite Hardy paradox to certify genuine multipartite nonlocality. Unlike traditio…
quant-ph2026
Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
Snehasish Roy Chowdhury, Sahil Gopalkrishna Naik, Ananya Chakraborty +5
Quantum systems are known to offer advantages over their classical counterpart in communication complexity protocols, where the aim is to minimize the amount of information exchang…