Source author record

Li-Yi Hsu

Li-Yi Hsu appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

9works
4topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

Quantum Transfer Learning Shows Improved Robustness in Low-Data Regimes

Transfer learning under limited data is a challenging setting, where models must adapt to new tasks with minimal supervision. Prior work has primarily focused on improving absolute accuracy in transfer learning. However, empirical evidence comparing quantum and classical models in realistic transfer learning settings remains limited, especially in low-data regimes. In this work, we systematically study the robustness of quantum models under reduced training data. We evaluate multiple quantum and classical architectures across diverse transfer tasks and retraining configurations, and quantify robustness using accuracy degradation and relative performance retention (RPR). Our results show that, although classical models often achieve higher peak performance, they exhibit significantly larger degradation when training data is limited. In contrast, quantum models maintain more stable performance across data regimes, indicating improved robustness and data efficiency. These findings provide empirical evidence that quantum models can offer improved robustness in low-resource transfer learning scenarios.

preprint2020arXiv

Carrying an arbitrarily large amount of information using a single quantum particle

Theoretically speaking, a photon can travel arbitrarily long before it enters into a detector, resulting a click. How much information can a photon carry? We study a bipartite asymmetric "two-way signaling" protocol as an extension of that proposed by Del Santo and Dakić. Suppose that Alice and Bob are distant from each other and each of them has an $n$-bit string. They are tasked to exchange the information of their local n-bit strings with each other, using only a single photon during the communication. It has been shown that the superposition of different spatial locations in a Mach-Zehnder (MZ) interferometer enables bipartite local encodings. We show that, after the travel of a photon through a cascade of $n$-level MZ interferometers in our protocol, the one of Alice or Bob whose detector clicks can access the other's full information of $n$-bit string, while the other can gain one-bit of information. That is, the wave-particle duality makes two-way signaling possible, and a single photon can carry arbitrarily large (but finite) information.

preprint2014arXiv

Informatic error-disturbance relation in the qubit case

In 1927, Heisenberg heuristically disclosed the tradeoff between the error in the measurement and the caused disturbance on another complementary observable. In the quantum theory, most of uncertainty relations are proposed to reveal the amount of unavoidable uncertainty in the measuring process. In this paper, we study the error-disturbance relation from the information viewpoint. We ask how much information, rather than how much uncertainty, can be obtained during the two sequential measurements. To achieve optimal information gain, we argue that the strategy for the "intelligent" prior apparatus is to clone the unknown state, and for the posterior one is to perform the swapping operation. We propose the coarse-grained random access code, and therein information causality as a physical principle can be exploited for deriving the upper-bound of information gain. Finally, we conjecture the information gain of measuring the position and momentum of a quantum object in the coarse-grained way.

preprint2011arXiv

High performance entanglement-assisted quantum LDPC codes need little entanglement

Though the entanglement-assisted formalism provides a universal connection between a classical linear code and an entanglement-assisted quantum error-correcting code (EAQECC), the issue of maintaining large amount of pure maximally entangled states in constructing EAQECCs is a practical obstacle to its use. It is also conjectured that the power of entanglement-assisted formalism to convert those good classical codes comes from massive consumption of maximally entangled states. We show that the above conjecture is wrong by providing families of EAQECCs with an entanglement consumption rate that diminishes linearly as a function of the code length. Notably, two families of EAQECCs constructed in the paper require only one copy of maximally entangled state no matter how large the code length is. These families of EAQECCs that are constructed from classical finite geometric LDPC codes perform very well according to our numerical simulations. Our work indicates that EAQECCs are not only theoretically interesting, but also physically implementable. Finally, these high performance entanglement-assisted LDPC codes with low entanglement consumption rates allow one to construct high-performance standard QECCs with very similar parameters.

preprint2011arXiv

Information Causality and Noisy Computations

We reformulate the information causality in a more general framework by adopting the results of signal propagation and computation in a noisy circuit. In our framework, the information causality leads to a broad class of Tsirelson inequalities. This fact allows us to subject information causality to experimental scrutiny. A no-go theorem for reliable nonlocal computation is also derived. Information causality prevents any physical circuit from performing reliable computations.

preprint2011arXiv

Monogamy of Information Causality

We consider the information causality in the multi-receiver random access codes. Therein, no receiver can gain any information only from classical communication. We claim the following statement. Information causality still holds even with the help of the multi-partite physical non-local resource. That is, the summation of all revivers' information gain cannot be greater than the amount of classical communication. The distributive multi-party physical nonlocal resource can be exploited only for information splitting. It is proved that such trade-off leads to the monogamy of entanglement. Finally the connection between information causality and spin-glass Bethe lattice is discussed.

preprint2010arXiv

Information causality and non-locality swapping are equivalent from emergence of quantum correlations

Is information causality a new physical principle? To answer this question, we first analytically derive the criteria of emergence of quantum correlations from information causality. Then it is shown that, as emergence criteria of quantum correlations, information causality and uselessness of coupler-based non-locality swapping can be regarded equivalent. Therefore, incapability of non-locality swapping using a coupler is as powerful as information causality in the single-out of quantum physics from generalized non-signalling models.

preprint2010arXiv

Undetermined states: how to find them and their applications

We investigate the undetermined sets consisting of two-level, multi-partite pure quantum states, whose reduced density matrices give absolutely no information of their original states. Two approached of finding these quantum states are proposed. One is to establish the relation between codewords of the stabilizer quantum error correction codes (SQECCs) and the undetermined states. The other is to study the local complementation rules of the graph states. As an application, the undetermined states can be exploited in the quantum secret sharing scheme. The security is guaranteed by their undetermineness.

preprint2008arXiv

Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States

We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.