Gotowa bibliografia na temat „Delegated quantum computing”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Delegated quantum computing”.
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 "Delegated quantum computing"
Morimae, Tomoyuki, i Takeshi Koshiba. "Impossibility of perfectly-secure one-round delegated quantum computing for classical client". Quantum Information and Computation 19, nr 3&4 (marzec 2019): 214–21. http://dx.doi.org/10.26421/qic19.3-4-2.
Pełny tekst źródłaKashefi, Elham, i Anna Pappa. "Multiparty Delegated Quantum Computing". Cryptography 1, nr 2 (30.07.2017): 12. http://dx.doi.org/10.3390/cryptography1020012.
Pełny tekst źródłaLiu, Zhixin, Qiaoling Xie, Yongfu Zha i Yumin Dong. "Quantum delegated computing ciphertext retrieval scheme". Journal of Applied Physics 131, nr 4 (31.01.2022): 044401. http://dx.doi.org/10.1063/5.0080097.
Pełny tekst źródłaMorimae, Tomoyuki, i Harumichi Harumichi Nishimura. "Rational proofs for quantum computing". Quantum Information and Computation 20, nr 3&4 (marzec 2020): 181–93. http://dx.doi.org/10.26421/qic20.3-4-1.
Pełny tekst źródłaSun, Wenli, Yan Chang, Danchen Wang, Shibin Zhang i Lili Yan. "Delegated quantum neural networks for encrypted data". Physica Scripta 99, nr 5 (29.03.2024): 055102. http://dx.doi.org/10.1088/1402-4896/ad348f.
Pełny tekst źródłaDoosti, Mina, Niraj Kumar, Mahshid Delavar i Elham Kashefi. "Client-server Identification Protocols with Quantum PUF". ACM Transactions on Quantum Computing 2, nr 3 (30.09.2021): 1–40. http://dx.doi.org/10.1145/3484197.
Pełny tekst źródłaMorimae, Tomoyuki, Harumichi Nishimura, Yuki Takeuch i Seiichiro Tani. "Impossibility of blind quantum sampling for classical client". quantum Information and Computation 19, nr 9&10 (wrzesień 2019): 793–806. http://dx.doi.org/10.26421/qic19.9-10-3.
Pełny tekst źródłaMorimae, Tomoyuki. "Secure Cloud Quantum Computing with Verification Based on Quantum Interactive Proof". Impact 2019, nr 10 (30.12.2019): 30–32. http://dx.doi.org/10.21820/23987073.2019.10.30.
Pełny tekst źródłaEfthymiou, Stavros, Alvaro Orgaz-Fuertes, Rodolfo Carobene, Juan Cereijo, Andrea Pasquale, Sergi Ramos-Calderer, Simone Bordoni i in. "Qibolab: an open-source hybrid quantum operating system". Quantum 8 (12.02.2024): 1247. http://dx.doi.org/10.22331/q-2024-02-12-1247.
Pełny tekst źródłaMorimae, Tomoyuki, Vedran Dunjko i Elham Kashefi. "Ground state blind quantum computation on AKLT state". Quantum Information and Computation 15, nr 3&4 (marzec 2015): 200–234. http://dx.doi.org/10.26421/qic15.3-4-2.
Pełny tekst źródłaRozprawy doktorskie na temat "Delegated quantum computing"
Colisson, Léo. "Study of Protocols Between Classical Clients and a Quantum Server". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS105.
Pełny tekst źródłaQuantum computers promise surprising powers of computation by exploiting the stunning physical properties of infinitesimally small particles. I focused on designing and proving the security of protocols that allow a purely classical client to use the computational resources of a quantum server, so that the performed computation is never revealed to the server. To this end, I develop a modular tool to generate on a remote server a quantum state that only the client is able to describe, and I show how multi-qubits quantum states can be generated more efficiently. I also prove that there is no such protocol that is secure in a generally composable model of security, including when our module is used in the UBQC protocol. In addition to delegated computation, this tool also proves to be useful for performing a task that might seem impossible to achieve at first sight: proving advanced properties on a quantum state in a non-interactive and non-destructive way, including when this state is generated collaboratively by several participants. This can be seen as a quantum analogue of the classical Non-Interactive Zero-Knowledge proofs. This property is particularly useful to filter the participants of a protocol without revealing their identity, and may have applications in other domains, for example to transmit a quantum state over a network while hiding the source and destination of the message. Finally, I discuss my ongoing independent work on One-Time Programs, mixing quantum cryptography, error correcting codes and information theory
Części książek na temat "Delegated quantum computing"
Badertscher, Christian, Alexandru Cojocaru, Léo Colisson, Elham Kashefi, Dominik Leichtle, Atul Mantri i Petros Wallden. "Security Limitations of Classical-Client Delegated Quantum Computing". W Advances in Cryptology – ASIACRYPT 2020, 667–96. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64834-3_23.
Pełny tekst źródłaStreszczenia konferencji na temat "Delegated quantum computing"
Ma, Shuquan, Xuchao Liu, Huagui Li i Heliang Song. "Multiparty Secure Delegated Quantum Computation". W 2023 International Conference on Networks, Communications and Intelligent Computing (NCIC). IEEE, 2023. http://dx.doi.org/10.1109/ncic61838.2023.00024.
Pełny tekst źródłaAmoretti, Michele. "Private Set Intersection with Delegated Blind Quantum Computing". W GLOBECOM 2021 - 2021 IEEE Global Communications Conference. IEEE, 2021. http://dx.doi.org/10.1109/globecom46510.2021.9685125.
Pełny tekst źródłaKim, Bong Gon, Dennis Wong i Yoon Seok Yang. "Private and Secure Post-quantum Verifiable Random Function with NIZK Proof and Ring-LWE Encryption in Blockchain". W 3rd International Conference on Cryptography and Blockchain. Academy & Industry Research Collaboration Center, 2023. http://dx.doi.org/10.5121/csit.2023.132104.
Pełny tekst źródła