Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Gangopadhyay, Sayan"'
Autor:
Gao, Jun, Krishna, Govind, Yeung, Edith, Yu, Lingxi, Gangopadhyay, Sayan, Chan, Kai-Sum, Huang, Chiao-Tzu, Descamps, Thomas, Reimer, Michael E., Poole, Philip J., Dalacu, Dan, Zwiller, Val, Elshaari, Ali W.
Coherent control of single photon sources is a key requirement for the advancement of photonic quantum technologies. Among them, nanowire-based quantum dot sources are popular due to their potential for on-chip hybrid integration. Here we demonstrate
Externí odkaz:
http://arxiv.org/abs/2409.14964
Autor:
Pennacchietti, Matteo, Cunard, Brady, Nahar, Shlok, Zeeshan, Mohd, Gangopadhyay, Sayan, Poole, Philip J., Dalacu, Dan, Fognini, Andreas, Jöns, Klaus D., Zwiller, Val, Jennewein, Thomas, Lütkenhaus, Norbert, Reimer, Michael E.
An on-demand source of bright entangled photon pairs is desirable for quantum key distribution (QKD) and quantum repeaters. The leading candidate to generate entangled photon pairs is based on spontaneous parametric down-conversion (SPDC) in a non-li
Externí odkaz:
http://arxiv.org/abs/2307.06473
We present a device independent analysis of controlled quantum teleportation where the receiver is not trusted. We show that the notion of genuine tripartite nonlocality allows us to certify control power in such a scenario. By considering a specific
Externí odkaz:
http://arxiv.org/abs/2208.05554
We show that currently available noisy intermediate-scale quantum (NISQ) computers can be used for versatile quantum simulations of chaotic systems. We introduce a novel classical-quantum hybrid approachfor exploring the dynamics of the chaotic quant
Externí odkaz:
http://arxiv.org/abs/2107.09809
A comprehensive treatment of the quantification of randomness certified device-independently by using the Hardy and Cabello-Liang-Li (CLL) nonlocality relations is provided in the two parties - two measurements per party - two outcomes per measuremen
Externí odkaz:
http://arxiv.org/abs/2011.12518
Publikováno v:
Quantum Inf. Process. 17, 160 (2018)
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and show that
Externí odkaz:
http://arxiv.org/abs/1708.06375
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Anand A; Department of Mechanical Engineering, Indian Institute of Engineering Science And Technology, Shibpur, Howrah, West Bengal, 711103, India. a63anand@uwaterloo.ca.; Department of Physics and Astronomy, University of Waterloo, Waterloo, N2L 3G1, ON, Canada. a63anand@uwaterloo.ca.; Institute for Quantum Computing, University of Waterloo, Waterloo, N2L 3G1, ON, Canada. a63anand@uwaterloo.ca., Srivastava S; School of Physics, Indian Institute of Science Education and Research, Thiruvananthapuram, Kerala, 695551, India. s49sriva@uwaterloo.ca.; Department of Physics and Astronomy, University of Waterloo, Waterloo, N2L 3G1, ON, Canada. s49sriva@uwaterloo.ca.; Institute for Quantum Computing, University of Waterloo, Waterloo, N2L 3G1, ON, Canada. s49sriva@uwaterloo.ca., Gangopadhyay S; Department of Physics and Astronomy, University of Waterloo, Waterloo, N2L 3G1, ON, Canada.; Institute for Quantum Computing, University of Waterloo, Waterloo, N2L 3G1, ON, Canada., Ghose S; Institute for Quantum Computing, University of Waterloo, Waterloo, N2L 3G1, ON, Canada.; Department of Physics and Computer Science, Wilfrid Laurier University, Waterloo, N2L 3C5, ON, Canada.
Publikováno v:
Scientific reports [Sci Rep] 2024 Nov 06; Vol. 14 (1), pp. 26890. Date of Electronic Publication: 2024 Nov 06.
