SearcharxivSearch

arXiv subjects

Si-Yi Chen

Publications and source records attributed to Si-Yi Chen.

7 recordsLinked to original sources

Three-body molecular states composed of $D^{(*)}$ and two nucleons

We study the three-body systems $DNN$ and $D^{*}NN$ within a hadronic molecular framework by combining a realistic nucleon-nucleon interaction with a $D^{(*)}N$ potential constrained by heavy-quark symmetry. The three-body Schrödinger equation is solved with the Gaussian Expansion Method, and the analytic structure of the spectrum is investigated using the Complex Scaling Method. We find that the $DNN$ system supports a robust and compact bound state in the $I(J^{P})=\tfrac{1}{2}(1^-)$ channel over a broad range of cutoff values, even when the corresponding $DN$ subsystem is weakly bound or unbound. For $D^{*}NN$, the spin-$1$ nature of the heavy meson and the associated spin-dependent forces generate a clear spin hierarchy: deeply bound states appear in both $0^-$ and $2^-$ channels, while the $1^-$ channel exhibits a characteristic two-branch pattern with a strongly bound compact branch and a more weakly bound, spatially extended branch. The root-mean-square radii indicate pronounced spatial compression compared with the deuteron scale, highlighting the cooperative roles of realistic $NN$ correlations, the $D^{(*)}N$ interactions, and heavy-quark symmetry in forming compact heavy-flavor few-body bound states. No three-body resonances under complex scaling are found in the explored parameter space. Our results provide quantitative benchmarks for future experimental searches for such charmed-meson-nuclear bound states.

hep-ph

Coupled-channel study of the three-body $DDK$ and $D^{*}D^{*}K$

We investigate the three-body $DDK$ system with quantum numbers $I(J^P) = \frac{1}{2}(0^-)$ within a coupled-channel framework that incorporates both $DDK$ and $D^{*}D^{*}K$ configurations. The $D^{(*)}D^{(*)}$ interactions are described using the one-boson-exchange model constrained by the heavy-quark symmetry and fitted to the pole positions of $X(3872)$, $T_{cc}^+$, and $Z_c(3900)$. The $D^{(*)}K$ interaction is from the chiral effective theory, motivated by the molecular interpretation of $D_{s0}^*(2317)$, and is further constrained by lattice-QCD results for the $DK$ scattering lengths. The resulting three-body problem is solved using the Gaussian expansion method, while the complex scaling method is employed to search for possible resonant states. We find that coupled-channel effects from $D^{*}D^{*}K$ are negligible, and the $DDK$ system supports a deeply bound state across a wide range of parameters. Depending on the long-range behavior of the $DK$ interaction, an additional shallow state may emerge near the particle-dimer ($D$-$DK$) threshold. The deeply bound state exhibits a compact three-body structure, whereas the shallow state displays characteristic features of a three-body halo configuration. No clear resonance poles are identified within the explored parameter region. Similar results are obtained for the $D^{*}D^{*}K$ system. These findings may provide new insight into few-body dynamics in systems involving charmed mesons and kaons.

hep-ph

Quantum Routing Beyond Pathfinding: Multipartite Entanglement Complementation

Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the network functioning. In this paper, we proposed a novel entanglement-driven routing framework that exploits multipartite entanglement complementation for enabling simultaneous 1-hop connectivity among all non-adjacent source-destination pairs. This changes the notion of ``remoteness'' in the entanglement graph, activated by entanglement. We extend this framework to inter-domain quantum networks and design a polynomial-time algorithm. Such an algorithm allows to select and parallelize multiple requests, bypassing NP-complete path discovery. Performance analysis shows the proposed routing strategy achieves up to $60\%$ hop reduction, with the algorithm enabling efficient parallelism and strong scalability in inter-domain quantum networks.

quant-ph

Entanglement-Based Artificial Topology: Neighboring Remote Network Nodes

Entanglement is unanimously recognized as the key communication resource of the Quantum Internet. Yet, the possibility of implementing novel network functionalities by exploiting the marvels of entanglement has been poorly investigated so far, by mainly restricting the attention to bipartite entanglement. Conversely, in this paper, we aim at exploiting multipartite entanglement as inter-network resource. Specifically, we consider the interconnection of different Quantum Local Area Networks (QLANs), and we show that multipartite entanglement allows to dynamically generate an inter-QLAN artificial topology, by means of local operations only, that overcomes the limitations of the physical QLAN topologies. To this aim, we first design the multipartite entangled state to be distributed within each QLAN. Then, we show how such a state can be engineered to: i) interconnect nodes belonging to different QLANs, and ii) dynamically adapt to different inter-QLAN traffic patterns. Our contribution aims at providing the network engineering community with a hands-on guideline towards the concept of artificial topology and artificial neighborhood.

quant-ph

Polynomial-time Extraction of Entanglement Resources

The extraction of EPR pairs and n-qubits GHZ states among remote nodes in quantum networks constitutes the resource primitives for end-to-end and on-demand communications. However, the Bell-VM problem, which determines whether a given graph state can be transformed into a set of Bell pairs on specific vertices (not necessarily remote), is known to be NP-complete. In this paper, we extend this problem, not only by focusing on nodes remote within generic graph states, but also by determining the number of extractable n-qubit remote GHZ states -- beside the number of remote EPR pairs. The rationale for tackling the extraction of GHZ states among remote nodes, rather than solely remote EPR pairs, is that a GHZ state enables the dynamic extraction of an EPR pair between any pair of nodes sharing the state. This, in turn, implies the ability of accommodating the traffic requests on-the-fly. Specially, we propose a polynomial-time algorithm for solving the aforementioned NP-complete problem. Our results demonstrate that the proposed algorithm is able to effectively adapt to generic graph states for extracting entanglement resources across remote nodes.

quant-ph

Beyond Traditional Quantum Routing

Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However, optimal pathfinding is computationally intensive, particularly in complex topologies. In this paper, we propose a novel approach to quantum routing, which avoids the inherent overhead of conventional quantum pathfinding, by establishing directly entanglement between remote nodes. Our approach exploits graph complement strategies. It allows to improve the flexibility and efficiency of quantum networks, by paving the way for more practical quantum communication infrastructures.

quant-ph

On the Efficient Extraction of Entangled Resources

In the Quantum Internet, multipartite entanglement enables a rich and dynamic overlay topology, referred to as artificial topology, upon the physical one, that can be exploited for communication purposes. In fact, the ability to extract $n$-qubits GHZ states and EPR pairs from the original multipartite entangled state constitutes the resource primitives for end-to-end and on-demand quantum communications. Thus, in this paper, we theoretically determine upper and lower bounds for the number of extractable $n$-qubits GHZ states and EPR pairs involving nodes remote in the artificial topology, as well as the achievable size $n$ of remote GHZ states. The theoretical analysis is then complemented by the proposal of a novel algorithm, which provides in polynomial-time a heuristic solution to the above problem. This is remarkable, since the theoretical problem is NP-complete. The performance analysis demonstrates the proposed algorithm is able to effectively manipulate the original and arbitrary graph state for extracting entanglement resources across remote nodes.

quant-ph