arXiv subjects

Soojoon Lee

Publications and source records attributed to Soojoon Lee.

At least 19 recordsLinked to original sources

arXiv2026

Beyond the Positive Partial Transpose Squared Conjecture: The Qutrit Case

Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is $1$-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of $1$-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any $1$-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.

quant-ph↗

arXiv2026

Quantum Resources and Performance in the Initialization-Free Bernstein-Vazirani Algorithm

Naseri et al. [Phys. Rev. A 106, 062429 (2022); arXiv:2205.13610] studied which quantum resources in initial states are essential for the probabilistic Bernstein-Vazirani (BV) algorithm, defining its performance as the optimal average success probability over all measurements. In this work, we consider a variant of BV algorithm, which is called the initialization-free (IF) BV algorithm, in which an arbitrary ancilla state as the oracle register is allowed, to improve the performance. We derive an explicit formula for the performance of the probabilistic IF-BV algorithm and obtain a necessary and sufficient condition for an initial state to achieve maximal performance. We further prove that, under a suitable ordering assumption on the coefficients of the initial state, the probabilistic IF-BV algorithm outperforms the standard probabilistic BV algorithm.

quant-ph↗

arXiv2026

Quantum teleportation with coherent error in Bell-state measurement

Quantum teleportation is a fundamental protocol in quantum information science, whose performance is conventionally evaluated under the assumption of ideal Bell-state measurements. In realistic implementations, however, joint measurements are often imperfect and can deviate from maximally entangled bases due to coherent errors in entangling operations. In this work, we analytically show how the entanglement of joint measurements determines teleportation performance and propose a strategy to overcome the limitations imposed by partially entangled joint measurements to recover the unit teleportation fidelity. We then derive an exact equation revealing a quantitative relation between measurement entanglement, channel entanglement, and the success probability to realize the unit-fidelity teleportation. We illustrate our results using elegant joint measurements and realistic coherent error models arising from imperfect entangling operations in quantum systems. Our work provides fundamental insight into the role of measurement entanglement in quantum teleportation and establishes a practical framework for achieving faithful teleportation without requiring substantial modifications to existing hardware.

quant-ph↗

arXiv2026

Opposite amplitude phase entropy responses at a non Hermitian avoided crossing

Avoided crossings (A.C.) in open resonators arise from non-Hermitian mode interaction, where leakage produces complex spectra and biorthogonal eigenmodes. Intensity-based entropies are robust markers of mode mixing but discard the phase structure of the complex field. Here we introduce a field-level information-theoretic analysis based on the joint statistics of local amplitude and phase under Born-weighted sampling on the cavity grid. For an open elliptical microcavity in the strong-interaction A.C. regime, we find a distinctive sector-resolved response: amplitude statistics tighten while phase statistics broaden maximally at the mixing point, and conditioning reveals strong amplitude-phase dependence. By introducing a coarse position label and the associated co-information, we further show that the enhancement of global amplitude-phase coupling is strongly shaped by spatial heterogeneity across the cavity.

physics.optics↗

arXiv2025

Chaos-controlled switching between entanglement and coherence

Controlling entanglement and coherence is central to quantum information, yet the two resources often exhibit antagonistic trends and are difficult to optimize within a single platform. Here we show that chaos enables switchable eigenstate resources: avoided crossings in soft- versus strong- chaos windows selectively realize an entanglement-peak mode or a coherence-peak mode within the same system. Crucially, this chaos-controlled inversion is not tied to a particular notion of subsystems, appearing both in single-wave settings and in genuine many-body settings. From the quantum-chaos perspective, conventional diagnostics based on avoided-crossing phenomenology and eigenmode delocalization are insufficient; eigenfunction entanglement and basis coherence provide the missing discriminants. Using two wave-chaotic billiards and a tilted-field Ising chain, we track the information-theoretic response of eigenstates across localized hybridization windows. Even when avoided-crossing phenomenology and delocalization are comparable, the entanglement and coherence responses invert between soft- and strong-chaos regimes. In the Ising chain, a single microscopic knob, the global field tilt, toggles between the two operating modes and reveals a trade-off in which off-diagonal correlations grow as diagonal populations dip. Our diagnostics require only reduced states (or their spectra) and are compatible with mode imaging in wave-chaos resonators and randomized measurements in programmable spin simulators.

quant-ph↗

arXiv2025

Correlated Entropic Uncertainty as a Signature of Exceptional Points

Non-Hermitian physics has become a fundamental framework for understanding open systems where gain and loss play essential roles, with impact across photonics, quantum science, and condensed matter. While the role of complex eigenvalues is well established, the nature of the corresponding eigenfunctions has remained a long-standing problem. Here we show that it arises from a fundamental entropic uncertainty trade-off between phase entropy and its Fourier representation. This trade-off enforces a correlated behavior of phase and Fourier entropies near avoided crossings and exceptional points, precisely where the Petermann factor diverges and phase rigidity collapses. Our results establish biorthogonality is not as an anomaly but an intrinsic property of eigenfunctions, arising universal manifestation of uncertainty relation in non-Hermitian systems. Beyond resolving this foundational question, our framework provides a unifying and testable principle that advances the fundamentals of non-Hermitian physics and can be directly verified with existing interferometric techniques.

quant-ph↗

arXiv2025

Local Wigner-Mass Maps and Integrated Negativity as Measures of nonclassicality in Quantum Chaotic Billiards

The Wigner function is a phase space quasi-probability distribution whose negative regions provide a direct, local signature of nonclassicality. To identify where phase-sensitive structure concentrates, we introduce local positive- and negative Wigner-mass maps and adopt the integrated Wigner negativity as a compact scalar measure of nonclassical phase space structure. A decomposition of the density operator reveals that off-diagonal coherences between hybridizing components generate oscillatory, sign-alternating patterns, with the negative contribution maximized when component weights are comparable. Non-Gaussian chaotic eigenmodes exhibit a baseline negativity that is further amplified by such hybridization. We validate these diagnostics across two billiard geometries and argue that the framework is transferable to other wave-chaotic platforms, where it can aid mode engineering and coherence control.

physics.optics↗

arXiv2025

Maximal extension on converse monogamy of entanglement for tripartite pure states

Unlike classical correlations, entanglement cannot be freely shared among multiple parties. This unique feature of quantum systems is known as the monogamy of entanglement. While it holds for all multipartite pure states, its converse -- weak entanglement between two parties enforces strong entanglement with a third party -- occurs only under specific conditions. In particular, Hayashi and Chen [Phys. Rev. A \textbf{84}, 012325 (2011)] demonstrated a qualitative version of the converse monogamy of entanglement (CMoE) for tripartite pure states by employing a hierarchy of bipartite entanglement defined through the relations among various separability criteria, and Singh and Datta [IEEE Trans. Inf. Theory \textbf{69}, 6564 (2023)] later extended this notion of the CMoE from the viewpoint of distillability under one-way or two-way classical communication. In this work, we extend their results to the CMoE with broader conditions, and furthermore show that our extensions are maximal with respect to the hierarchies they considered.

quant-ph↗

arXiv2025

Information-theoretic analysis of complex eigenmodes across avoided crossings in open microcavities

Avoided crossings (ACs) are hallmark signatures of mode interaction in quantum and wave systems. Open microcavities whose resonances are naturally described as quasi-normal modes (QNMs) with complex eigenfrequencies offer a convenient platform to observe how openness and loss reorganize modal structure. We introduce a compact \emph{quadrature space} framework that represents a complex QNM by probability weights on its real and imaginary quadratures, and we apply Shannon-type measures to these distributions. This representation separates marginal spreading of each quadrature from inter quadrature correlation and is robust to nodal sets and exterior zero amplitude points. Applying the method to AC regions, we find that delocalization is driven not only by broadening of individual quadratures but also by a pronounced increase in internal correlation near at the AC, revealing an internal reorganization of resonant modes in non-Hermitian settings. The approach is broadly transferable to other open resonator platforms and provides a general information-theoretic diagnostic for openness-driven mode interactions.

quant-ph↗

arXiv2025

Hidden quantum-classical correspondence in chaotic billiards revealed by mutual information

Avoided level crossings, commonly associated with quantum chaos, are typically interpreted as signatures of eigenstate hybridization and spatial delocalization, often viewed as ergodic spreading. We show that, contrary to this expectation, increasing chaos in quantum billiards enhances mutual information between conjugate phase space variables, revealing nontrivial correlations. Using an information-theoretic decomposition of eigenstate entropy, we demonstrate that spatial delocalization may coincide with increased mutual information between position and momentum. These correlations track classical invariant structures in phase space and persist beyond the semiclassical regime, suggesting a robust information-theoretic manifestation of quantum-classical correspondence.

nlin.CD↗

arXiv2024

Maneuvering measurement-coherence into measurement-entanglement

Quantum dynamics governs the transformation of static quantum resources, such as coherence and entanglement, in both quantum states and measurements. Prior studies have established that a quantum channel's state-cohering power can be converted into the state-entangling power without additional coherence. Here, we complete this coherence-to-entanglement paradigm by demonstrating that a channel's measurement-cohering power can likewise be converted into the measurement-entangling power. This result reinforces, on the dynamical level, the intuition that entanglement emerges as a manifestation of coherence. To formalize this picture, we develop resource theories for measurement-cohering and measurement-entangling powers and characterize the structure of incoherent measurements to analyze measurement-coherence generation. Furthermore, we show that the state-cohering power of a quantum channel is equivalent to the measurement-cohering power of its adjoint map, and a corresponding equivalence also exists between the state-entangling power and the measurement-entangling power.

quant-ph↗

arXiv2024

Modified Recursive QAOA for Exact Max-Cut Solutions on Bipartite Graphs: Closing the Gap Beyond QAOA Limit

Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm proposed with the goal of approximately solving combinatorial optimization problems such as the MAX-CUT problem. It has been considered a potential candidate for achieving quantum advantage in the Noisy Intermediate-Scale Quantum era and has been extensively studied. However, the performance limitations of low-level QAOA have also been demonstrated across various instances. In this work, we first analytically prove the performance limitations of level-1 QAOA in solving the MAX-CUT problem on bipartite graphs. To this end, we derive an upper bound for the approximation ratio based on the average degree of bipartite graphs. Second, we demonstrate that Recursive QAOA (RQAOA), which recursively reduces graph size using QAOA as a subroutine, outperforms the level-1 QAOA. However, the performance of RQAOA exhibits limitations as the graph size increases. Finally, we show that RQAOA with a restricted parameter regime can fully address these limitations. Surprisingly, this modified RQAOA always finds the exact maximum cut for any bipartite graphs and even for a more general graph with parity-signed weights.

quant-ph↗

arXiv2024

Improved bounds on quantum uncommon information

In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed uncommon information, represents the number of messages required to be exchanged to completely share all information in common. However, this equivalence does not extend to quantum information theory. Specifically, quantum uncommon information is operationally defined as the minimal amount of entanglement required for the quantum communication task of quantum state exchange, where two parties exchange quantum states to share all quantum messages in common. Currently, an analytical closed-form expression for the quantum uncommon information remains undetermined. In this work, by investigating underlying characterization of the quantum uncommon information, we derive improved bounds on it. To obtain these bounds, we develop a subspace exchange strategy that leverages a common subspace of two parties to identify the unnecessary qubits for exchange. We also consider a referee-assisted exchange, wherein a referee aids two parties in efficiently performing the quantum state exchange. Our bounds provide more precise estimations for the quantum uncommon information. Furthermore, we demonstrate that the subspace technique is a versatile tool for characterizing uncommon information not only in the bipartite scenario but also in various multi-partite ones.

quant-ph↗

arXiv2023

Genuine multipartite entanglement measures based on multi-party teleportation capability

Quantifying entanglement is vital to understand entanglement as a resource in quantum information processing, and many entanglement measures have been suggested for this purpose. When mathematically defining an entanglement measure, we should consider the distinguishability between entangled and separable states, the invariance under local transformation, the monotonicity under local operations and classical communication, and the convexity. These are reasonable requirements but may be insufficient, in particular when taking into account the usefulness of quantum states in multi-party quantum information processing. Therefore, if we want to investigate multipartite entanglement as a resource, then it can be necessary to consider the usefulness of quantum states in multi-party quantum information processing when we define a multipartite entanglement measure. In this paper, we define new multipartite entanglement measures for three-qubit systems based on the three-party teleportation capability, and show that these entanglement measures satisfy the requirements for being genuine multipartite entanglement measures. We also generalize our entanglement measures for $N$-qubit systems, where $N \ge 4$, and discuss that these quantities may be good candidates to measure genuine multipartite entanglement.

quant-ph↗

arXiv2023

Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs

Quantum approximate optimization algorithms are hybrid quantum-classical variational algorithms designed to approximately solve combinatorial optimization problems such as the MAX-CUT problem. In spite of its potential for near-term quantum applications, it has been known that quantum approximate optimization algorithms have limitations for certain instances to solve the MAX-CUT problem, at any constant level $p$. Recently, the recursive quantum approximate optimization algorithm, which is a non-local version of quantum approximate optimization algorithm, has been proposed to overcome these limitations. However, it has been shown by mostly numerical evidences that the recursive quantum approximate optimization algorithm outperforms the original quantum approximate optimization algorithm for specific instances. In this paper, we analytically prove that the recursive quantum approximate optimization algorithm is more competitive than the original one to solve the MAX-CUT problem for complete graphs with respect to the approximation ratio.

quant-ph↗

arXiv2022

Quantum advantage through the magic pentagram problem

Through the two specific problems, the 2D hidden linear function problem and the 1D magic square problem, Bravyi et al. have recently shown that there exists a separation between $\mathbf{QNC^0}$ and $\mathbf{NC^0}$, where $\mathbf{QNC^0}$ and $\mathbf{NC^0}$ are the classes of polynomial-size and constant-depth quantum and classical circuits with bounded fan-in gates, respectively. In this paper, we present another problem with the same property, the magic pentagram problem based on the magic pentagram game, which is a nonlocal game. In other words, we show that the problem can be solved with certainty by a $\mathbf{QNC^0}$ circuit but not by any $\mathbf{NC^0}$ circuits.

quant-ph↗

arXiv2022

Relation between Quantum Coherence and Quantum Entanglement in Quantum Measurements

Quantum measurement is a class of quantum channels that sends quantum states to classical states. We set up resource theories of quantum coherence and quantum entanglement for quantum measurements and find relations between them. For this, we conceive a relative entropy type quantity to account for the quantum resources of quantum measurements. The quantum coherence of a quantum measurement can be converted into the entanglement in a bipartite quantum measurement through coherence-non generating transformations. Conversely, a quantum entanglement monotone of quantum measurements induces a quantum coherence monotone of quantum measurement. Our results confirm that the understanding on the link between quantum coherence and quantum entanglement is valid even for quantum measurements which do not generate any quantum resource.

quant-ph↗

arXiv2021

Quantum algorithm based on the $\varepsilon$-random linear disequations for the continuous hidden shift problem

There have been several research works on the hidden shift problem, quantum algorithms for the problem, and their applications. However, all the results have focused on discrete groups with discrete oracle functions. In this paper, we define the continuous hidden shift problem on $\mathbb{R}^n$ with a continuous oracle function as an extension of the hidden shift problem, and also define the $\varepsilon$-random linear disequations which is a generalization of the random linear disequations. By employing the newly defined concepts, we show that there exists a quantum computational algorithm which solves this problem in time polynomial in $n$.

quant-ph↗