Physics / Fizik
Permanent URI for this collectionhttps://hdl.handle.net/11147/6
Browse
2 results
Search Results
Article Citation - WoS: 40Citation - Scopus: 42Free-Space Quantum Key Distribution With Single Photons From Defects in Hexagonal Boron Nitride(Wiley, 2022) Samaner, Çağlar; Paçal, Serkan; Mutlu, Görkem; Uyanık, Kıvanç; Ateş, SerkanEfficient single photon generation is an important requirement for several practical applications in quantum technologies, including quantum cryptography. A proof-of-concept demonstration of free-space quantum key distribution (QKD) is presented with single photons generated from an isolated defect in hexagonal boron nitride (hBN). The bright source operating at room temperature is integrated into a QKD system based on B92 protocol and a sifted key rate of 238 bps with a quantum bit error rate of 8.95% are achieved at 1 MHz clock rate. The effect of temporal filtering of detected photons on the performance of QKD parameters is also studied. It is believed that these results will stimulate the research on optically active defects in hBN as well as other 2D-based quantum emitters and their applications within quantum information technologies including practical QKD systems.Article Evaluation of exact quantum query complexities by semidefinite programming(Springer Verlag, 2019) Uyanık, KıvançOne of the difficult tasks in quantum computation is inventing efficient exact quantum algorithms, which are the quantum algorithms that output the correct answer with certainty on any input. We improve and generalize the semidefinite programming (SDP) method of Montanaro et al. (Algorithmica 71:775-796, 2015) in order to evaluate exact quantum query complexities of partial functions. We present a more systematical approach to achieve the inspired result by Montanaro et al. for the function EXACT24, which is the Boolean function of 4 bits that output only when 2 of the input bits are equal to 1. The same approach also allows us to reduce the size of the ancilla space used by the algorithms that evaluate symmetric functions like EXACT36. We employ the generalized SDP to verify the complexities of the earliest and best known quantum algorithms in the literature, namely, Deutsch-Jozsa and Grover algorithms for a small number of input bits. We utilized the method to solve the weight decision problem of bit strings with lengths up to 10 bits and observed that the generalized SDP gives better exact quantum query complexities than the known methods. Finally, we test the method on some selected functions and demonstrate that they all exhibit quantum speedup.