Gotowa bibliografia na temat „Quantum Computational Timelock, QCT”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Quantum Computational Timelock, QCT”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Quantum Computational Timelock, QCT"
LIPING, JU, i LU RUIFENG. "COMPARATIVE STUDY OF REACTION RATE CONSTANTS FOR THE NH3 + H → NH2 + H2 REACTION WITH GLOBE DYNAMICS AND TRANSITION STATE THEORIES". Journal of Theoretical and Computational Chemistry 08, nr 06 (grudzień 2009): 1227–33. http://dx.doi.org/10.1142/s0219633609005325.
Pełny tekst źródłaDEFAZIO, PAOLO, i CARLO PETRONGOLO. "DYNAMICS OF THE N(2D)+H2 REACTION ON THE $\tilde{X}^2 A^{\prime\prime}$ SURFACE, PROPAGATING REAL WAVE PACKETS WITH AN ARCCOS MAPPING OF THE HAMILTONIAN". Journal of Theoretical and Computational Chemistry 02, nr 04 (grudzień 2003): 547–51. http://dx.doi.org/10.1142/s0219633603000732.
Pełny tekst źródłaJI, LIN-BO, TING-XIAN XIE i HONG-YAN WANG. "INVESTIGATION OF THE EXCHANGE REACTION H + H′S → HS + H′ ON THE 1A′ STATE POTENTIAL ENERGY SURFACE". Journal of Theoretical and Computational Chemistry 12, nr 04 (czerwiec 2013): 1350030. http://dx.doi.org/10.1142/s0219633613500302.
Pełny tekst źródłaYUE, XIAN-FANG, JIE CHENG i HONG ZHANG. "QUASI-CLASSICAL TRAJECTORY STUDY OF THE REACTIONS N(2D) WITH H2, D2, AND HD". Journal of Theoretical and Computational Chemistry 09, nr 05 (październik 2010): 919–24. http://dx.doi.org/10.1142/s0219633610006080.
Pełny tekst źródłaVarandas, A. J. C. "Extrapolation in quantum chemistry: Insights on energetics and reaction dynamics". Journal of Theoretical and Computational Chemistry 19, nr 07 (2.09.2020): 2030001. http://dx.doi.org/10.1142/s0219633620300013.
Pełny tekst źródłaYANG, HERUN, ZUOYE LIU, SHAOHUA SUN, LU LI, HONGCHUAN DU i BITAO HU. "QUASI-CLASSICAL STUDY OF STEREO-DYNAMICS FOR THE REACTION C + CH → C2 + H ON THE 12A′ POTENTIAL ENERGY SURFACE". Journal of Theoretical and Computational Chemistry 10, nr 01 (luty 2011): 75–91. http://dx.doi.org/10.1142/s0219633611006323.
Pełny tekst źródłaMokhtari, Majid, Samane Khoshbakht, Kobra Ziyaei, Mohammad Esmaeil Akbari i Sayyed Sajjad Moravveji. "New classifications for quantum bioinformatics: Q-bioinformatics, QCt-bioinformatics, QCg-bioinformatics, and QCr-bioinformatics". Briefings in Bioinformatics 25, nr 2 (22.01.2024). http://dx.doi.org/10.1093/bib/bbae074.
Pełny tekst źródłaPopelier, Paul L. A. "Non-covalent interactions from a Quantum Chemical Topology perspective". Journal of Molecular Modeling 28, nr 9 (25.08.2022). http://dx.doi.org/10.1007/s00894-022-05188-7.
Pełny tekst źródłaRozprawy doktorskie na temat "Quantum Computational Timelock, QCT"
Vyas, Nilesh. "Quantum cryptography in a hybrid security model". Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT049.
Pełny tekst źródłaExtending the functionality and overcoming the performance limitation of QKD requires either quantum repeaters or new security models. Investigating the latter option, we introduce the Quantum Computational Timelock (QCT) security model, assuming that computationally secure encryption may only be broken after time much longer than the coherence time of available quantum memories. These two assumptions, namely short-term computational security and noisy quantum storage, have so far already been considered in quantum cryptography, yet only disjointly. A practical lower bound on time, for which encryption is computationally secure, can be inferred from assumed long-term security of the AES256 encryption scheme (30 years) and the value of coherence time in experimental demonstrations of storage and then retrieval of optically encoded quantum information, at single-photon level range from a few nanoseconds to microseconds. Given the large gap between the upper bound on coherence time and lower bound on computational security time of an encryption scheme, the validity of the QCT security model can be assumed with a very high confidence today and also leaves a considerable margin for its validity in the future. Using the QCT security model, we propose an explicit d-dimensional key agreement protocol that we call MUB-Quantum Computational Timelock (MUB-QCT), where a bit is encoded on a qudit state using a full set of mutually unbiased bases (MUBs) and a family of pair-wise independent permutations. Security is proved by showing that upper bound on Eve's information scales as O(1=d). We show MUB-QCT offers: high resilience to error (up to 50% for large d) with fixed hardware requirements; MDI security as security is independent of channel monitoring and does not require to trust measurement devices. We also prove the security of the MUB-QCT protocol, with multiple photons per channel use, against non-adaptive attacks, in particular, proactive MUB measurement where eve measures each copy in a different MUB followed by post-measurement decoding. We prove that the MUB-QCT protocol allows secure key distribution with input states containing up to O(d) photons which implies a significant performance boost, characterized by an O(d) multiplication of key rate and a significant increase in the reachable distance. These results illustrate the power of the QCT security model to boost the performance of quantum cryptography while keeping a clear security advantage over classical cryptography