Minjin Choi

Minjin Choi

Auto-generated profile, based on publicly available information

Minjin Choi

Korea Institute of Science and Technology Information

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2025 in New Journal of Physics
Verified
Journal Article
Open access
MCMinjin Choi
Minjin Choi
HRHoon Ryu
Hoon Ryu
We design a variational quantum algorithm (VQA) to solve multi-dimensional Poisson equations with mixed boundary conditions that are typically required in various fields of computational science. Employing an objective function that is formulated with the concept of the minimal potential energy, we not only present in-depth discussion on the cost-efficient & noise-robust design of quantum circuits that are essential for evaluation of the objective function, but, more remarkably, employ the proposed algorithm to calculate bias-dependent spatial distributions of electric fields in semiconductor systems that are described with a two-dimensional domain and up to 10-qubit circuits. Extending the application scope to multi-dimensional problems with mixed boundary conditions for the first time, fairly solid computational results of this work clearly demonstrate the potential of VQAs to tackle Poisson equations derived from physically meaningful problems.

3 June 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MCMinjin Choi
Minjin Choi
JSJeonghyeon Shin
Jeonghyeon Shin
GLGunho Lee
Gunho Lee
EBEunok Bae
Eunok Bae
Quantum teleportation is an essential application of quantum entanglement. The examination of teleportation fidelity in two-party standard teleportation schemes reveals a critical threshold distinguishing separable and entangled states. For separable states, their teleportation fidelities cannot exceed the threshold, emphasizing the significance of entanglement. We extend this analysis to multiparty scenarios known as controlled teleportation. Our study provides thresholds that N-qudit k-separable states cannot exceed in a controlled teleportation scheme, where N≥3 and 2≤k≤N. This not only establishes a standard for utilizing a given quantum state as a resource in controlled teleportation but also enhances our understanding of the influence of the entanglement structure on controlled teleportation performance. In addition, we show that genuine multipartite entanglement is not a prerequisite for achieving a high controlled teleportation capability.

5 November 2026 in Quantum Science and Technology
Verified
Journal Article
Open access
MCMinjin Choi
Minjin Choi
DLDongkeun Lee
Dongkeun Lee
JRJunghee Ryu
Junghee Ryu
The Grover mixer quantum alternating operator ansatz (GM-QAOA) employs the Grover mixer to confine the quantum evolution to the feasible subspace defined by the problem. Its mixing unitary, however, requires a global multi-controlled phase-shift gate acting on all qubits, resulting in substantial circuit overhead on near-term quantum devices. In this work, we propose locally acting Grover mixers with independent variational parameters, tailored to initial states that admit a product structure over disjoint qubit subsystems, which may be obtained by encoding only a subset of problem constraints into the initial state preparation. The proposed method preserves the search space defined by the initial state while reducing the mixing-circuit gate count and depth relative to the global Grover mixer, as the global multi-controlled phase-shift gate is replaced with local operations on disjoint subsystems. Numerical simulations on the exact-cover problem and the traveling salesman problem (TSP) demonstrate that the proposed method achieves solution probabilities comparable to those of the original GM-QAOA, while using shallower circuits with fewer gates. Comparisons with shared-angle local Grover and partitioned XY-ring mixers characterize the trade-offs between solution quality, circuit complexity, and optimization overhead. We further compare two constraint encoding strategies for the TSP, encoding only a subset of constraints versus all constraints into the initial state preparation, and show that the former combined with the proposed mixer can yield markedly more compact circuits at the point where comparable solution quality is achieved.