Sanghyeon Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sanghyeon Lee has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Youngsun Han
Pukyong National University
3 shared publications - Leanghok Hour
Pukyong National University
2 shared publications - Yongtae Kim
School of Computer Science and Engineering, Kyungpook National University, Daegu, Republic of Korea
2 shared publications - Byung Wook Kim
Department of Information and Communication Engineering, Changwon National University, Changwon 51140, Republic of Korea
1 shared publication - Kimchhor Chiv
Department of AI Convergence, Pukyong National University, Nam-gu, Busan, South Korea
1 shared publication - Tae-Kyung Kim
Department of Management Information Systems, Chungbuk National University, Seowon-gu, Cheongju-si, Chungcheongbuk-do, South Korea
1 shared publication
Latest Publications
- Open Access
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 216916-216936
Strategies for Noise-Resilient Quantum Approximate Optimization Algorithms: A Review and Classification of Error Mitigation
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for solving combinatorial optimization problems on near-term quantum hardware. However, its practical deployment remains severely limited by hardware-induced noise and decoherence. In the absence of full fault tolerance, Quantum Error Mitigation (QEM) techniques offer a viable approach to enhance QAOA performance on noisy intermediate-scale quantum (NISQ) devices. In this work, we present a unified classification of QEM strategies specifically tailored for QAOA, systematically categorized into preprocessing, during execution, and post-processing phases. We further classify QAOA deployment settings—such as hardware-constrained devices, stochastic noise-dominated environments, and dense graphs problem—and recommend appropriate QEM techniques for each. A comparative analysis highlights the trade-offs among mitigation accuracy, resource overhead, and robustness to different noise types. By synthesizing recent advances and identifying open challenges, our paper provides both a comprehensive survey and a practical framework for designing robust, noise-resilient QAOA pipelines on near-term quantum platforms.
- 24 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 216916-216936
Open AccessStrategies for Noise-Resilient Quantum Approximate Optimization Algorithms: A Review and Classification of Error Mitigation
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for solving combinatorial optimization problems on near-term quantum hardware. However, its practical deployment remains severely limited by hardware-induced noise and decoherence. In the absence of full fault tolerance, Quantum Error Mitigation (QEM) techniques offer a viable approach to enhance QAOA performance on noisy intermediate-scale quantum (NISQ) devices. In this work, we present a unified classification of QEM strategies specifically tailored for QAOA, systematically categorized into preprocessing, during execution, and post-processing phases. We further classify QAOA deployment settings—such as hardware-constrained devices, stochastic noise-dominated environments, and dense graphs problem—and recommend appropriate QEM techniques for each. A comparative analysis highlights the trade-offs among mitigation accuracy, resource overhead, and robustness to different noise types. By synthesizing recent advances and identifying open challenges, our paper provides both a comprehensive survey and a practical framework for designing robust, noise-resilient QAOA pipelines on near-term quantum platforms.
- 26 February 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (3) , 035033
ReQUSA: a novel ReRAM-based hardware accelerator architecture for high-speed quantum computer simulation
Quantum computers are currently regarded as an emerging computing technology that can solve problems more quickly than classical computers. However, since constructing a general quantum computer is technically difficult, quantum computer simulation has been used instead of real quantum computers. Simulating quantum computers on classical computers is challenging because the time and resources required for the vectormatrix multiplication (VMM) increase exponentially with the number of qubits. This paper proposes a new accelerator architecture called ReQUSA that leverages resistive random access memory (ReRAM) to accelerate the quantum computer simulation. The ReQUSA employs a ReRAM crossbar array structure, which is specialized for implementing the VMM, and a realized state method for reduced VMM operation. To the best of our knowledge, ReRAM-based accelerators for quantum computer simulators has not been previously reported. Here, we describe the hardware design of the architecture and compare the performances (hardware resource, simulation time, and accuracy) of our accelerator with those of current quantum computer simulators (QuEST, QPlayer, and Qiskit). On average, our proposed architecture reduced the simulation times by factors of ×104 and ×103 (×102) on average from those of QuEST and QPlayer (also Qiskit), respectively. In addition, our architecture achieved 99% accuracy in 16-bit fixed-point data representation.
- 26 February 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (3) , 035033
ReQUSA: a novel ReRAM-based hardware accelerator architecture for high-speed quantum computer simulation
Quantum computers are currently regarded as an emerging computing technology that can solve problems more quickly than classical computers. However, since constructing a general quantum computer is technically difficult, quantum computer simulation has been used instead of real quantum computers. Simulating quantum computers on classical computers is challenging because the time and resources required for the vectormatrix multiplication (VMM) increase exponentially with the number of qubits. This paper proposes a new accelerator architecture called ReQUSA that leverages resistive random access memory (ReRAM) to accelerate the quantum computer simulation. The ReQUSA employs a ReRAM crossbar array structure, which is specialized for implementing the VMM, and a realized state method for reduced VMM operation. To the best of our knowledge, ReRAM-based accelerators for quantum computer simulators has not been previously reported. Here, we describe the hardware design of the architecture and compare the performances (hardware resource, simulation time, and accuracy) of our accelerator with those of current quantum computer simulators (QuEST, QPlayer, and Qiskit). On average, our proposed architecture reduced the simulation times by factors of ×104 and ×103 (×102) on average from those of QuEST and QPlayer (also Qiskit), respectively. In addition, our architecture achieved 99% accuracy in 16-bit fixed-point data representation.
- Open Access
- 8 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 97675-97685
Resource-Optimized Design of Bit-Shuffle Block Coding for MIMO-VLC
Designing a run-length-limited (RLL) code for a visible light communication (VLC) system requires consideration of several performance factors including hardware overhead, transmission efficiency, and direct current (DC) balance. This paper proposes a novel RLL code called bit-shuffle block codes for high-rate multiple-input multiple-output (MIMO)-VLC systems that can offer excellent constant illumination and transmission efficiency with extensively-optimized hardware resources. Due to the structure of the Omega network, the proposed bit-shuffle block coding method can increase transmission efficiency and significantly reduce hardware overhead. In addition, it can generate codewords dynamically, which guarantees DC balance with multiple LEDs to serve the dual purpose of illumination and communication. Experimental results confirm that the proposed bit-shuffle block coding demonstrate excellent performance in resource optimization, and can be a viable solution for MIMO-VLC applications that can send large volumes data with limited hardware resources.
- 8 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 97675-97685
Open AccessResource-Optimized Design of Bit-Shuffle Block Coding for MIMO-VLC
Designing a run-length-limited (RLL) code for a visible light communication (VLC) system requires consideration of several performance factors including hardware overhead, transmission efficiency, and direct current (DC) balance. This paper proposes a novel RLL code called bit-shuffle block codes for high-rate multiple-input multiple-output (MIMO)-VLC systems that can offer excellent constant illumination and transmission efficiency with extensively-optimized hardware resources. Due to the structure of the Omega network, the proposed bit-shuffle block coding method can increase transmission efficiency and significantly reduce hardware overhead. In addition, it can generate codewords dynamically, which guarantees DC balance with multiple LEDs to serve the dual purpose of illumination and communication. Experimental results confirm that the proposed bit-shuffle block coding demonstrate excellent performance in resource optimization, and can be a viable solution for MIMO-VLC applications that can send large volumes data with limited hardware resources.