SearcharxivSearch

arXiv subjects

Yuan Hou

Publications and source records attributed to Yuan Hou.

4 recordsLinked to original sources

Near-limit quantum control beyond analytic tractability in many-body spin systems

As quantum control approaches hardware-imposed performance limits, weak effects omitted by reduced models become consequential. Assumptions required for analytic tractability then cease to guide control design and instead constrain further improvement. Here, we relax such assumptions and use simulation-guided stochastic tree search to navigate combinatorially large, discrete pulse-sequence spaces for robust many-body spin control. Experimentally, in a solid-state spin ensemble, the resulting computationally discovered pulse sequences substantially outperform analytically optimized baselines, despite being excluded by construction from analytic design criteria. Importantly, these unconventional sequences expose predictive structural features that enable rapid neural network--based performance evaluation. This efficiency gain makes the combinatorial scaling tractable and expands the control alphabet from 8 symmetry-restricted pulses to over 26,000 hardware-resolved options. The resulting fine-grained design freedom provides the control resolution required to reliably address weak, performance-limiting effects, unlocking qualitatively different spin-control capabilities beyond decades of traditional sequence design. Together, these results show that near performance limits, simplifying assumptions can become a primary constraint on quantum control in realistic hardware, and must be repurposed to guide computational discovery.

quant-ph

Repurpose Open Data to Discover Therapeutics for COVID-19 using Deep Learning

There have been more than 850,000 confirmed cases and over 48,000 deaths from the human coronavirus disease 2019 (COVID-19) pandemic, caused by novel severe acute respiratory syndrome coronavirus (SARS-CoV-2), in the United States alone. However, there are currently no proven effective medications against COVID-19. Drug repurposing offers a promising way for the development of prevention and treatment strategies for COVID-19. This study reports an integrative, network-based deep learning methodology to identify repurposable drugs for COVID-19 (termed CoV-KGE). Specifically, we built a comprehensive knowledge graph that includes 15 million edges across 39 types of relationships connecting drugs, diseases, genes, pathways, and expressions, from a large scientific corpus of 24 million PubMed publications. Using Amazon AWS computing resources, we identified 41 repurposable drugs (including indomethacin, toremifene and niclosamide) whose therapeutic association with COVID-19 were validated by transcriptomic and proteomic data in SARS-CoV-2 infected human cells and data from ongoing clinical trials. While this study, by no means recommends specific drugs, it demonstrates a powerful deep learning methodology to prioritize existing drugs for further investigation, which holds the potential of accelerating therapeutic development for COVID-19.

q-bio.QM

Spectral Extremal Results for Hypergraphs

Let $F$ be a graph. A hypergraph is called Berge $F$ if it can be obtained by replacing each edge in $F$ by a hyperedge containing it. Given a family of graphs $\mathcal{F}$, we say that a hypergraph $H$ is Berge $\mathcal{F}$-free if for every $F \in \mathcal{F}$, the hypergraph $H$ does not contain a Berge $F$ as a subhypergraph. In this paper we investigate the connections between spectral radius of the adjacency tensor and structural properties of a linear hypergraph. In particular, we obtain a spectral version of Turán-type problems over linear $k$-uniform hypergraphs by using spectral methods, including a tight result on Berge $C_4$-free linear $3$-uniform hypergraphs.

math.CO

A homogeneous polynomial associated with general hypergraphs and its applications

In this paper, we define a homogeneous polynomial for a general hypergraph, and establish a remarkable connection between clique number and the homogeneous polynomial of a general hypergraph. For a general hypergraph, we explore some inequality relations among spectral radius, clique number and the homogeneous polynomial. We also give lower and upper bounds on the spectral radius in terms of the clique number.

math.CO