Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Song, WooYeong"'
Publikováno v:
Phys. Rev. Lett. 133, 050605 (2024)
We propose a fault-tolerant quantum computation scheme in a measurement-based manner with finite-sized entangled resource states and encoded fusion scheme with linear optics. The encoded-fusion is an entangled measurement devised to enhance the fusio
Externí odkaz:
http://arxiv.org/abs/2408.01041
Autor:
Lee, Jinil, Song, Wooyeong, Lee, Donghwa, Kim, Yosep, Lee, Seung-Woo, Lim, Hyang-Tag, Jung, Hojoong, Han, Sang-Wook, Kim, Yong-Su
Publikováno v:
Quantum Sci. Technol. 9 045028 (2024)
Variational quantum eigensolver (VQE), which combines quantum systems with classical computational power, has been arisen as a promising candidate for near-term quantum computing applications. However, the experimental resources such as the number of
Externí odkaz:
http://arxiv.org/abs/2404.15579
Autor:
Bilash, Bohdan, Lim, Youngrong, Kwon, Hyukjoon, Kim, Yosep, Lim, Hyang-Tag, Song, Wooyeong, Kim, Yong-Su
Publikováno v:
Phys. Rev. A 110, 042407 (2024)
Identifying Bell states without destroying it is frequently dealt with in nowadays quantum technologies such as quantum communication and quantum computing. In practice, quantum entangled states are often distributed among distant parties, and it mig
Externí odkaz:
http://arxiv.org/abs/2309.00869
Autor:
Song, Wooyeong, Lim, Youngrong, Jeong, Kabgyun, Lee, Jinhyoung, Park, Jung Jun, Kim, M. S., Bang, Jeongho
Publikováno v:
New J. Phys. 24 103014 (2022)
The noisy binary linear problem (NBLP) is known as a computationally hard problem, and therefore, it offers primitives for post-quantum cryptography. An efficient quantum NBLP algorithm that exhibits a polynomial quantum sample and time complexities
Externí odkaz:
http://arxiv.org/abs/2109.11186
Publikováno v:
Journal of the Korean Physical Society, 78(6), 496-503 (2021)
We analyze the average fidelity (say, F) and the fidelity deviation (say, D) in noisy-channel quantum teleportation. Here, F represents how well teleportation is performed on average and D quantifies whether the teleportation is performed impartially
Externí odkaz:
http://arxiv.org/abs/2102.05396
Autor:
Song, Wooyeong, Lim, Youngrong, Kwon, Hyukjoon, Adesso, Gerardo, Wieśniak, Marcin, Pawłowski, Marcin, Kim, Jaewan, Bang, Jeongho
Publikováno v:
Phys. Rev. A 103, 042409 (2021)
Studies addressing the question "Can a learner complete the learning securely?" have recently been spurred from the standpoints of fundamental theory and potential applications. In the relevant context of this question, we present a classical-quantum
Externí odkaz:
http://arxiv.org/abs/1912.10594
Autor:
Song, Wooyeong, Lim, Youngrong, Jeong, Kabgyun, Ji, Yun-Seong, Lee, Jinhyoung, Kim, Jaewan, Kim, M. S., Bang, Jeongho
Publikováno v:
Quantum Sci. Technol. 7 025009 (2022)
Noisy linear problems have been studied in various science and engineering disciplines. A class of "hard" noisy linear problems can be formulated as follows: Given a matrix $\hat{A}$ and a vector $\mathbf{b}$ constructed using a finite set of samples
Externí odkaz:
http://arxiv.org/abs/1908.06229
Autor:
Song, Wooyeong, Wieśniak, Marcin, Liu, Nana, Pawłowski, Marcin, Lee, Jinhyoung, Kim, Jaewan, Bang, Jeongho
Publikováno v:
Quantum Information Processing (2021) 20:275
Quantum computation requires large classical datasets to be embedded into quantum states in order to exploit quantum parallelism. However, this embedding requires considerable resources. It would therefore be desirable to avoid it, if possible, for n
Externí odkaz:
http://arxiv.org/abs/1905.05751
Autor:
Song, Wooyeong1,2 (AUTHOR), Wieśniak, Marcin3,4 (AUTHOR), Liu, Nana5,6,7 (AUTHOR), Pawłowski, Marcin4 (AUTHOR), Lee, Jinhyoung1 (AUTHOR) hyoung@hanyang.ac.kr, Kim, Jaewan8 (AUTHOR) jaewan@kias.re.kr, Bang, Jeongho9 (AUTHOR) jbang@etri.re.kr
Publikováno v:
Quantum Information Processing. Aug2021, Vol. 20 Issue 8, p1-18. 18p.
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.