Daniel K. Park
연세대학교 컴퓨터학과 · 컴퓨터과학
Daniel K. Park 교수의 연구실은 양자 정보 처리에서 실용적 응용을 가능하게 하기 위한 핵심 기술인 양자 오류 보정 및 측정 오류 보정 기법을 중심으로 연구를 전개하고 있습니다. 특히, 양자 하드웨어의 제한된 성능을 고려한 비용 효율적인 오류 보정 기법, 예를 들어 딥러닝 기반 측정 오류 보정과 조건부 독립 기반 스케일러블 기법을 개발하며, NISQ(노이즈가 있는 중간 규모 양자) 환경에서도 효과적으로 작동하는 양자 알고리즘 설계에 초점을 맞추고 있습니다. 또한, 양자 랜덤 액세스 메모리, 상태 구분, 이상 탐지 등 실제 데이터 기반의 양자 머신러닝 응용까지 연구를 확장하고 있습니다.
표시된 성과는 수집된 데이터 기준으로 산출되며, 일부 차이가 있을 수 있습니다.
A prerequisite for many quantum information processing tasks to truly surpass classical approaches is an efficient procedure to encode classical data in quantum superposition states. In this work, we present a circuit-based flip-flop quantum random access memory to construct a quantum database of classical information in a systematic and flexible way. For registering or updating classical data consisting of M entries, each represented by n bits, the method requires O(n) qubits and O(Mn) steps. W
Abstract Quantum computing devices are inevitably subject to errors. To leverage quantum technologies for computational benefits in practical applications, quantum algorithms and protocols must be implemented reliably under noise and imperfections. Since noise and imperfections limit the size of quantum circuits that can be realized on a quantum device, developing quantum error mitigation techniques that do not require extra qubits and gates is of critical importance. In this work, we present a
Abstract Quantum state discrimination (QSD) is a fundamental task in quantum information processing with numerous applications. We present a variational quantum algorithm that performs the minimum-error QSD, called the variational quantum state discriminator (VQSD). The VQSD uses a parameterized quantum circuit that is trained by minimizing a cost function derived from the QSD, and finds the optimal positive-operator valued measure (POVM) for distinguishing target quantum states. The VQSD is cap
Demonstrating quantum advantage with less powerful but more realistic devices is of great importance in modern quantum information science. Recently, a significant quantum speedup was achieved in the problem of learning a hidden parity function with noise. However, if all data qubits at the query output are completely depolarized, the algorithm fails. In this work, we present a quantum parity learning algorithm that exhibits quantum advantage as long as one qubit is provided with nonzero polariz
Abstract Anomaly detection is a critical problem in data analysis and pattern recognition, finding applications in various domains. We introduce quantum support vector data description (QSVDD), an unsupervised learning algorithm designed for anomaly detection. QSVDD utilizes a shallow-depth quantum circuit to learn a minimum-volume hypersphere that tightly encloses normal data, tailored for the constraints of noisy intermediate-scale quantum (NISQ) computing. Simulation results on the MNIST and
Abstract Mitigating measurement errors in quantum systems without relying on quantum error correction is of critical importance for the practical development of quantum technology. Deep learning-based quantum measurement error mitigation (QMEM) has exhibited advantages over the linear inversion method due to its capability to correct non-linear noise. However, scalability remains a challenge for both methods. In this study, we propose a scalable QMEM method that leverages the conditional indepen
Quantum convolutional neural networks (QCNNs) represent a promising approach in quantum machine learning, paving new directions for both quantum and classical data analysis. This approach is particularly attractive due to the absence of the barren plateau problem, a fundamental challenge in training quantum neural networks (QNNs), and its feasibility. However, a limitation arises when applying QCNNs to classical data. The network architecture is most natural when the number of input qubits is a
Abstract Classification is at the core of data‐driven prediction and decision‐making, representing a fundamental task in supervised machine learning. Recently, several quantum machine learning algorithms that use quantum kernels as a measure of similarities between data have emerged to perform binary classification on datasets encoded as quantum states. The potential advantages of quantum kernels arise from the ability of quantum computers to construct kernels that are more effective than their