arXiv subjects

Jaewan Kim

Publications and source records attributed to Jaewan Kim.

At least 19 recordsLinked to original sources

arXiv2026

Deep Reinforcement Learning for Adaptive Power Allocation in ISAC Systems with Mobile Target

In this paper, we study the power allocation for an integrated sensing and communication (ISAC) system which tracks a mobile target. We first model the problem as a Markov decision process, and then tackle it with a soft actor-critic (SAC) based deep reinforcement learning (DRL) approach. We also combine a Dirichlet policy, which naturally produces normalized continuous actions under random target motion. To exploit different features of sensing and communication operations, we carefully design a reward function such that the system can dynamically control power allocation to conserve resources. The simulation results demonstrate that the proposed scheme enhances tracking performance compared to other baselines while sustaining communication performance.

eess.SP↗

arXiv2026

Extending the Handover-Iterative VQE to Challenging Strongly Correlated Systems: $N_2$ and Fe-S Cluster

Accurately describing strongly correlated electronic systems remains a central challenge in quantum chemistry, as electron-electron interactions give rise to complex many-body wavefunctions that are difficult to capture with conventional approximations. Classical wavefunction-based approaches, such as the Semistochastic Heat-bath Configuration Interaction (SHCI) and the Density Matrix Renormalization Group (DMRG), currently define the state of the art, systematically converging toward the Full Configuration Interaction (FCI) limit, but at a rapidly increasing computational cost. Quantum computing algorithms promise to alleviate this scaling bottleneck by leveraging entanglement and superposition to represent correlated states more compactly. We introduced the Handover-Iterative Variational Quantum Eigensolver (HI-VQE) as a practical quantum computing algorithm with an iterative "handover" mechanism that dynamically exchanges information between quantum and classical computers, even using Noisy Intermediate-Scale Quantum (NISQ) computers. In this work, we extend the HI-VQE to benchmark two prototypical strongly correlated systems, the nitrogen molecule $N_2$ and iron-sulfur (Fe-S) cluster, which serve as stringent tests for both classical and quantum electronic-structure methods. By comparing HI-VQE results against Heat-bath Configuration Interaction (HCI) benchmarks, we assess its accuracy, scalability, and ability to capture multireference correlation effects. Achieving quantitative agreement on these canonical systems demonstrates a viable pathway toward quantum-enhanced simulations of complex bioinorganic molecules, catalytic mechanisms, and correlated materials.

quant-ph↗

arXiv2025

HIVQE: Handover Iterative Variational Quantum Eigensolver for Efficient Quantum Chemistry Calculations

A novel hybrid quantum-classical approach has been developed to efficiently address the multireference quantum chemistry problem. The Handover Iterative Variational Quantum Eigensolver (HiVQE) is designed to accurately estimate ground-state wavefunctions by leveraging both quantum and classical computing resources. In this framework, noisy intermediate-scale quantum (NISQ) hardwares efficiently explore electron configurations, while classical computers compute the corresponding wavefunction without the effect of noise of NISQ computer, ensuring both accuracy and computational efficiency. By generating compact yet chemically accurate wavefunctions, HiVQE advances quantum chemistry simulations and facilitates the discovery of novel materials. This approach demonstrates significant potential for overcoming the limitations of classical methods in strongly correlated electronic systems.

quant-ph↗

arXiv2025

Designing Minimalistic Variational Quantum Ansatz Inspired by Algorithmic Cooling

This study introduces a novel minimalistic variational quantum ansatz inspired by algorithmic cooling principles. The proposed Heat Exchange algorithmic cooling ansatz (HE ansatz) facilitates efficient population redistribution without requiring bath resets, simplifying implementation on noisy intermediate-scale quantum (NISQ) devices. The HE ansatz achieves superior approximation ratios with the complete network \textsc{Maxcut} optimization problem compared to the conventional Hardware efficient and QAOA ansatz. We also proposed a new variational algorithm that utilize HE ansatz to compute the ground state of impure dissipative-system variational quantum eigensolver (dVQE) which achieved a sub-$1\%$ error in ground-state energy calculations of the 1D Heisenberg chain with impurity and successfully simulates the edge effect of impure spin chain, highlighting its potential for applications in quantum many-body physics. These results underscore the compatibility of the ansatz with hardware-efficient implementations, offering a scalable approach for solving complex quantum problems in disordered and open quantum systems.

quant-ph↗

arXiv2024

Non-Gaussian entanglement criteria for atomic homodyne detection

Homodyne measurement is a crucial tool widely used to address continuous variables for bosonic quantum systems. While an ideal homodyne detection provides a powerful analysis, e.g. to effectively measure quadrature amplitudes of light in quantum optics, it relies on the use of a strong reference field, the so-called local oscillator typically in a coherent state. Such a strong coherent local oscillator may not be readily available particularly for a massive quantum system like Bose-Einstein condensate (BEC), posing a substantial challenge in dealing with continuous variables appropriately. It is necessary to establish a practical framework that includes the effects of non-ideal local oscillators for a rigorous assessment of various quantum tests and applications. We here develop entanglement criteria beyond Gaussian regime applicable for this realistic homodyne measurement that do not require assumptions on the state of local oscillators. We discuss the working conditions of homodyne detection to effectively detect non-Gaussian quantum entanglement under various states of local oscillators.

quant-ph↗

arXiv2023

A superconducting tensor detector for mid-frequency gravitational waves: its multi-channel nature and main astrophysical targets

Mid-frequency band gravitational-wave detectors will be complementary for the existing Earth-based detectors (sensitive above 10 Hz or so) and the future space-based detectors such as LISA, which will be sensitive below around 10 mHz. A ground-based superconducting omnidirectional gravitational radiation observatory (SOGRO) has recently been proposed along with several design variations for the frequency band of 0.1 to 10 Hz. For three conceptual designs of SOGRO (e.g., pSOGRO, SOGRO and aSOGRO), we examine their multi-channel natures, sensitivities and science cases. One of the key characteristics of the SOGRO concept is its six detection channels. The response functions of each channel are calculated for all possible gravitational wave polarizations including scalar and vector modes. Combining these response functions, we also confirm the omnidirectional nature of SOGRO. Hence, even a single SOGRO detector will be able to determine the position of a source and polarizations of gravitational waves, if detected. Taking into account SOGRO's sensitivity and technical requirements, two main targets are most plausible: gravitational waves from compact binaries and stochastic backgrounds. Based on assumptions we consider in this work, detection rates for intermediate-mass binary black holes (in the mass range of hundreds up to $10^{4}$ $M_\odot$) are expected to be $0.0014-2.5 \,\, {\rm yr}^{-1}$. In order to detect stochastic gravitational wave background, multiple detectors are required. Two aSOGRO detector networks may be able to put limits on the stochastic background beyond the indirect limit from cosmological observations.

gr-qc↗

arXiv2023

$T$-depth-optimized Quantum Search with Quantum Data-access Machine

Quantum search algorithms offer a remarkable advantage of quadratic reduction in query complexity using quantum superposition principle. However, how an actual architecture may access and handle the database in a quantum superposed state has been largely unexplored so far; the quantum state of data was simply assumed to be prepared and accessed by a black-box operation -- so-called oracle, even though this process, if not appropriately designed, may adversely diminish the quantum query advantage. Here, we introduce an efficient quantum data-access process, dubbed as quantum data-access machine (QDAM), and present a general architecture for quantum search algorithm. We analyze the runtime of our algorithm in view of the fault-tolerant quantum computation (FTQC) consisting of logical qubits within an effective quantum error correction code. Specifically, we introduce a measure involving two computational complexities, i.e. quantum query and $T$-depth complexities, which can be critical to assess performance since the logical non-Clifford gates, such as the $T$ (i.e., $π/8$ rotation) gate, are known to be costliest to implement in FTQC. Our analysis shows that for $N$ searching data, a QDAM model exhibiting a logarithmic, i.e., $O(\log{N})$, growth of the $T$-depth complexity can be constructed. Further analysis reveals that our QDAM-embedded quantum search requires $O(\sqrt{N} \times \log{N})$ runtime cost. Our study thus demonstrates that the quantum data search algorithm can truly speed up over classical approaches with the logarithmic $T$-depth QDAM as a key component.

quant-ph↗

arXiv2022

Correlations and energy in mediated dynamics

The minimum time required for a quantum system to evolve to a distinguishable state is set by the quantum speed limit, and consequently influences the change of quantum correlations and other physical properties. Here we study the time required to maximally entangle two principal systems interacting either directly or via a mediating ancillary system, under the same energy constraints. The direct interactions are proved to provide the fastest way to entangle the principal systems, but it turns out that there exist mediated dynamics that are just as fast. We show that this can only happen if the mediator is initially correlated with the principal systems. These correlations can be fully classical and can remain classical during the entangling process. The final message is that correlations save energy: one has to supply extra energy if maximal entanglement across the principal systems is to be obtained as fast as with an initially correlated mediator.

quant-ph↗

arXiv2022

Quantum solvability of noisy linear problems by divide-and-conquer strategy

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, a hidden vector or structure involved in $\mathbf{b}$ is obtained by solving a noise-corrupted linear equation $\hat{A}\mathbf{x} \approx \mathbf{b} + \boldsymbolη$, where $\boldsymbolη$ is a noise vector that cannot be identified. For solving such a noisy linear problem, we consider a quantum algorithm based on a divide-and-conquer strategy, wherein a large core process is divided into smaller subprocesses. The algorithm appropriately reduces both the computational complexities and size of a quantum sample. More specifically, if a quantum computer can access a particular reduced form of the quantum samples, polynomial quantum-sample and time complexities are achieved in the main computation. The size of a quantum sample and its executing system can be reduced, e.g., from exponential to sub-exponential with respect to the problem length, which is better than other results we are aware. We analyse the noise model conditions for such a quantum advantage, and show when the divide-and-conquer strategy can be beneficial for quantum noisy linear problems.

quant-ph↗

arXiv2021

Tangible reduction in learning sample complexity with large classical samples and small quantum system

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 noisy intermediate-scale quantum (NISQ) implementation. Accordingly, we consider a classical-quantum hybrid architecture, which allows large classical input data, with a relatively small-scale quantum system. This hybrid architecture is used to implement an oracle. It is shown that in the presence of noise in the hybrid oracle, the effects of internal noise can cancel each other out and thereby improve the query success rate. It is also shown that such an immunity of the hybrid oracle to noise directly and tangibly reduces the sample complexity in the probably-approximately-correct learning framework. This NISQ-compatible learning advantage is attributed to the oracle's ability to handle large input features.

quant-ph↗

arXiv2021

Certifying dimension of quantum systems by sequential projective measurements

This work analyzes correlations arising from quantum systems subject to sequential projective measurements to certify that the system in question has a quantum dimension greater than some $d$. We refine previous known methods and show that dimension greater than two can be certified in scenarios which are considerably simpler than the ones presented before and, for the first time in this sequential projective scenario, we certify quantum systems with dimension strictly greater than three. We also perform a systematic numerical analysis in terms of robustness and conclude that performing random projective measurements on random pure qutrit states allows a robust certification of quantum dimensions with very high probability.

quant-ph↗

arXiv2021

Global triplewise information trade-off in quantum measurement

State disturbance by a quantum measurement is at the core of foundational quantum physics and constitutes a fundamental basis of secure quantum information processing. While quantifying an information-disturbance relation has been a long-standing problem, recently verified reversibility of a quantum measurement requires to refine such a conventional information trade-off toward a complete picture of information conservation in quantum measurement. Here we experimentally demonstrate complete trade-off relations among all information contents, i.e., information gain, disturbance and reversibility in quantum measurement. By exploring various quantum measurements applied on a photonic qutrit, we observe that the information of a quantum state is split into three distinct parts accounting for the extracted, disturbed, and reversible information. We verify that such different parts of information are in trade-off relations not only pairwise but also globally all-at-once, and find that the global trade-off relation is tighter than any of the pairwise relations. Finally, we realize optimal quantum measurements that inherently preserve quantum information without loss of information, which offer wider applications in measurement-based quantum information processing.

quant-ph↗

arXiv2021

Fundamental limits on concentrating and preserving tensorized quantum resources

Quantum technology offers great advantages in many applications by exploiting quantum resources like nonclassicality, coherence, and entanglement. In practice, an environmental noise unavoidably affects a quantum system and it is thus an important issue to protect quantum resources from noise. In this work, we investigate the manipulation of quantum resources possessing the so-called tensorization property and identify the fundamental limitations on concentrating and preserving those quantum resources. We show that if a resource measure satisfies the tensorization property as well as the monotonicity, it is impossible to concentrate multiple noisy copies into a single better resource by free operations. Furthermore, we show that quantum resources cannot be better protected from channel noises by employing correlated input states on joint channels if the channel output resource exhibits the tensorization property. We address several practical resource measures where our theorems apply and manifest their physical meanings in quantum resource manipulation.

quant-ph↗

arXiv2021

Quantum secure learning with classical samples

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 hybrid sampling protocol and define a security condition that allows only legitimate learners to prepare a finite set of samples that guarantees the success of the learning; the security condition excludes intruders. We do this by combining our security concept with the bound of the so-called probably approximately correct (PAC) learning. We show that while the lower bound on the learning samples guarantees PAC learning, an upper bound can be derived to rule out adversarial learners. Such a secure learning condition is appealing, because it is defined only by the size of samples required for the successful learning and is independent of the algorithm employed. Notably, the security stems from the fundamental quantum no-broadcasting principle. No such condition can thus occur in any classical regime, where learning samples can be copied. Owing to the hybrid architecture, our scheme also offers a practical advantage for implementation in noisy intermediate-scale quantum devices.

quant-ph↗

arXiv2021

Robust entanglement detection in arbitrary two-mode Gaussian state: a Stokes-like operator-based approach

Detection of entanglement in quantum states is one of the most important problems in quantum information processing. However, it is one of the most challenging tasks to find a universal scheme which is also desired to be optimal to detect entanglement for all states of a specific class--as always preferred by experimentalists. Although, the topic is well studied at least in case of lower dimensional compound systems, e.g., two-qubit systems, but in the case of continuous variable systems, this remains as an open problem. Even in the case of two-mode Gaussian states, the problem is not fully solved. In our work, we have tried to address this issue. At first, a limited number of Hermitian operators is given to test the necessary and sufficient criterion on the covariance matrix of separable two-mode Gaussian states. Thereafter, we present an interferometric scheme to test the same separability criterion in which the measurements are being done via Stokes-like operators. In such case, we consider only single-copy measurements on a two-mode Gaussian state at a time and the scheme amounts to the full state tomography. We further analyze the robustness of the proposed detection method against experimentally relevant imperfections and demonstrate that the separability test remains reliable under moderate levels of detection inefficiency. Although this latter approach is a linear optics-based one, nevertheless it is not an economic scheme. Resource-wise a more economical scheme than the full state tomography is obtained if we consider measurements on two copies of the state at a time. However, optimality of the scheme is not yet known.

quant-ph↗

arXiv2021

Complete Information Balance in Quantum Measurement

Quantum measurement is a basic tool to manifest intrinsic quantum effects from fundamental tests to quantum information applications. While a measurement is typically performed to gain information on a quantum state, its role in quantum technology is indeed manifold. For instance, quantum measurement is a crucial process element in measurement-based quantum computation. It is also used to detect and correct errors thereby protecting quantum information in error-correcting frameworks. It is therefore important to fully characterize the roles of quantum measurement encompassing information gain, state disturbance and reversibility, together with their fundamental relations. Numerous efforts have been made to obtain the trade-off between information gain and state disturbance, which becomes a practical basis for secure information processing. However, a complete information balance is necessary to include the reversibility of quantum measurement, which constitutes an integral part of practical quantum information processing. We here establish all pairs of trade-off relations involving information gain, disturbance, and reversibility, and crucially the one among all of them together. By doing so, we show that the reversibility plays a vital role in completing the information balance. Remarkably, our result can be interpreted as an information-conservation law of quantum measurement in a nontrivial form. We completely identify the conditions for optimal measurements that satisfy the conservation for each tradeoff relation with their potential applications. Our work can provide a useful guideline for designing a quantum measurement in accordance with the aims of quantum information processors.

quant-ph↗

arXiv2020

Effects of white noise on Bell theorem for qudits

We introduce two types of statistical quasi-separation between local observables to construct two-party Bell-type inequalities for an arbitrary dimensional systems and arbitrary number of measurement settings per site. Note that, the main difference between statistical quasi-separations and the usual statistical separations is that the former are not symmetric under exchange of the two local observables, whereas latter preserve the symmetry. We show that a variety of Bell inequalities can be derived by sequentially applying triangle inequalities which statistical quasi-separations satisfy. A sufficient condition is presented to show quantum violations of the Bell-type inequalities with infinitesimal values of critical visibility $v_c$.

quant-ph↗

arXiv2020

Quantum-Ising Hamiltonian programming in trio, quartet, and sextet qubit systems

Rydberg-atom quantum simulators are of keen interest because of their possibilities towards high-dimensional qubit architectures. Here we report three-dimensional conformation spectra of quantum-Ising Hamiltonian systems with programmed qubit connections. With a Rydberg-atom quantum simulator, various connected graphs, in which vertices and edges represent atoms and blockaded couplings, respectively, are constructed in two or three-dimensional space and their eigenenergies are probed during their topological transformations. Star, complete, cyclic, and diamond graphs, and their geometric intermediates, are tested for four atoms and antiprism structures for six atoms. Spectroscopic resolution (dE/E) less than 10% is achieved and the observed energy level shifts and merges through structural transformations are in good agreement with the model few-body quantum-Ising Hamiltonian.

quant-ph↗