4 citations · 4 across the 3 of their papers we have counts for
7 papers
Learning with Active Quantum Subspaces: Scalable Hybrid Advantage without Full Quantum Data-Encoding
Jeongho Bang, Wooyeong Song, Kyoungho Cho +2
We study whether quantum learning advantage can persist without fully embedding a large classical input into a highly superposed quantum state. To address this question, we introdu…
Nondestructive discrimination of Bell states between distant parties
Bohdan Bilash, Youngrong Lim, Hyukjoon Kwon +4
Identifying Bell states without destroying it is frequently dealt with in nowadays quantum technologies such as quantum communication and quantum computing. In practice, quantum en…
Polynomial T-depth Quantum Solvability of Noisy Binary Linear Problem: From Quantum-Sample Preparation to Main Computation
Wooyeong Song, Youngrong Lim, Kabgyun Jeong +4
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 algo…
Average fidelity and fidelity deviation in noisy quantum teleportation
WooYeong Song, Junghee Ryu, Kyunghyun Baek +1
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 avera…
Quantum secure learning with classical samples
Wooyeong Song, Youngrong Lim, Hyukjoon Kwon +5
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…
Quantum solvability of noisy linear problems by divide-and-conquer strategy
Wooyeong Song, Youngrong Lim, Kabgyun Jeong +5
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…