Searcharxiv⌕ Search

arXiv subjects

Chi-Hang Fred Fung

Publications and source records attributed to Chi-Hang Fred Fung.

At least 19 recordsLinked to original sources

Efficient Secure Federated Learning via Information-Theoretically Secure Key Distribution: A Medical Imaging Case Study

Federated Learning (FL) enables collaborative training of models across institutions without centralizing sensitive data, making it well-suited for privacy-concerned applications, such as medical imaging. To protect FL model updates during secure aggregation, additive masking is commonly employed. However, its underlying classical key establishment is only computationally secure. On the other hand, physics-based Information-Theoretically Secure (ITS) key exchange introduces practical constraints: finite key generation rates and time-limited storage severely limit throughput and sustained training of uncompressed models. In this work, we address this bottleneck by developing an FL framework that integrates frozen backbones, knowledge distillation, and quantization. These techniques reduce communication payload and, consequently, key material consumption. Moving beyond simulation, we benchmark this framework on a real physics-based key distribution testbed involving a chest X-ray classification application. Our results show that key usage can be reduced by $\sim$35$\times$ while maintaining predictive accuracy. This prevents buffer depletion and key expiration, enabling sustainable FL training under physical key generation constraints.

cs.LG↗

Tensor Network Moral Graph Recovery of Discrete Probability Distributions

We present a method for recovering the moral graph of a causal DAG from a probability distribution over discrete variables, using fully connected tensor networks (FCTNs) with nuclear-norm-regularized bond corrections. Each bond matrix is parameterized as a baseline all-ones matrix plus a low-rank correction $C_{ij} = U_{ij}V_{ij}^\top$, and the nuclear norm of the correction implemented via the variational Frobenius norm penalty on the factors drives unnecessary bonds to zero. We prove that under faithfulness, positivity, and a no-implicit-rerouting assumption on the local tensor architecture, \textbf{every} optimal FCTN with zero reconstruction error $\varepsilon = 0$ has effective graph exactly equal to the moral graph. For the approximate regime ($\varepsilon > 0$), we provide explicit recovery bounds using the Fannes-Audenaert continuity of conditional mutual information, and derive a sufficient condition on the regularization parameter $β$. The effective graph is read directly from the optimized bond matrices.

stat.ML↗

Column Generation for the Optimization of Switching in Repeaterless Quantum Networks

Efficient resource allocation and optical switching promise high key rates, network adaptability, and cost reduction in repeaterless quantum communication networks. However, identifying optimal switching configurations remains a significant challenge due to the combinatorial complexity. We introduce a novel graph formulation to model the physical and logical structure of repeaterless quantum networks, enabling the systematic optimization of switching strategies. The problem is posed as a linear program and solved using a column generation approach. This method enables scalable computation despite the exponential number of possible network configurations. Our results not only provide a formal foundation but also a practical algorithm for the optimization of switching. Empirical tests confirm the solver's scalability with network size, demonstrating the framework's effectiveness and laying the groundwork for future optimization of quantum network control.

quant-ph↗

The optical architecture of a heterogenous quantum network deployed in production facilities

Quantum Communications promise advances in cryptography, quantum computing and clock synchronisation, among other emerging applications. However, communication based on quantum phenomena requires an extreme level of isolation from external disturbances, complicating the co-propagation of quantum and classical signals. The challenge is greater when deploying networks that are both heterogeneous (e.g., multiple vendors) and installed in production facilities, given that this type of infrastructure already supports networks loaded with their own requirements. Moreover, to achieve a broad acceptance among network operators, the joint management and operation of quantum and classical resources, compliance with standards, and legal and quality assurance need to be addressed. This article presents solutions to the aforementioned challenges validated in the Madrid quantum network during the implementation of the projects CiViC and OpenQKD. This network was designed to integrate quantum communications in the telecommunications ecosystem by installing quantum-key-distribution modules from multiple providers in production nodes of two different operators. The modules were connected through an optically-switched network with more than 130~km of deployed optical fibre. The tests were done in compliance with strict service level agreements that protected the legacy traffic of the pre-existing classical network. The goal was to ensure full quantum-classical interoperability at all levels, while limiting the modifications to optical transport and encryption and complying with relevant standards. This effort is intended to lay the foundation for large-scale quantum network deployments.

quant-ph↗

Switching Coordinator: An SDN Application for Flexible QKD-Networks

A monitor and control framework for quantum-key-distribution (QKD) networks equipped with switching capabilities was developed. On the one hand, this framework provides real-time visibility into operational metrics. Specifically, it extracts essential data, such as the switching capabilities of QKD modules, the number of keys stored in buffer queues of the QKD links, and the respective key generation and consumption rates along these links. On the other hand, this framework allows software-defined networking (SDN) applications to operate on the collected information and address the cryptographic needs of the network. The SDN applications dynamically adapt the configuration of the switched network to align with its changing demands, e.g.,~prioritizing key availability on critical paths, responding to link failures, or reallocating generation capacity to prevent bottlenecks. This contribution demonstrates that the combination of switched QKD, centralized control, and global optimization strategies enables efficient, policy-driven operation of QKD networks. The cryptographic resources are allocated to maximize performance and resilience while remaining aligned with the specific policies set by network administrators.

cs.CR↗

Tight bounds of quantum speed limit for noisy dynamics via maximum rotation angles

The laws of quantum physics place a limit on the speed of computation. In particular, the evolution time of a system from an initial state to a final state cannot be arbitrarily short. Bounds on the speed of evolution for unitary dynamics have long been studied. A few bounds on the speed of evolution for noisy dynamics have also been obtained recently, which are, however, not tight. In this paper, we present a new framework for quantum speed limit concerning noisy dynamics. Within this framework, we obtain the exact maximum rotation angle that noisy dynamics can achieve at any given time, which gives rise to a tight bound on the evolution time for noisy dynamics. The bound obtained through semi-definite programming highlights the fundamental differences between noisy dynamics and unitary dynamics. Furthermore, we show that the \textit{orthogonalization} time, defined as the minimum time required to evolve any initial state to a state with zero fidelity with respect to the initial state, is generally not applicable to noisy dynamics.

quant-ph↗

Pilot-assisted intradyne reception for high-speed continuous-variable quantum key distribution with true local oscillator

We present a pilot-assisted coherent intradyne reception methodology for CV-QKD with true local oscillator. An optically phase-locked reference tone, prepared using carrier-suppressed optical single-sideband modulation, is multiplexed in polarisation and frequency to the 250 Mbaud quantum signal in order to provide optical frequency- and phase matching between quantum signal and local oscillator. Our concept allows for high symbol rates and can be operated at an extremely low excess-noise level, as validated by experimental measurements.

quant-ph↗

Continuous-Variable Quantum Key Distribution with Gaussian Modulation -- The Theory of Practical Implementations

Quantum key distribution using weak coherent states and homodyne detection is a promising candidate for practical quantum-cryptographic implementations due to its compatibility with existing telecom equipment and high detection efficiencies. However, despite the actual simplicity of the protocol, the security analysis of this method is rather involved compared to discrete-variable QKD. In this article we review the theoretical foundations of continuous-variable quantum key distribution (CV-QKD) with Gaussian modulation and rederive the essential relations from scratch in a pedagogical way. The aim of this paper is to be as comprehensive and self-contained as possible in order to be well intelligible even for readers with little pre-knowledge on the subject. Although the present article is a theoretical discussion of CV-QKD, its focus lies on practical implementations, taking into account various kinds of hardware imperfections and suggesting practical methods to perform the security analysis subsequent to the key exchange. Apart from a review of well known results, this manuscript presents a set of new original noise models which are helpful to get an estimate of how well a given set of hardware will perform in practice.

quant-ph↗

Fidelity and Fisher information on quantum channels

The fidelity function of quantum states have been widely used in quantum information science and frequently arises in the quantification of optimal performances for the estimation and distinguish of quantum states. A fidelity function on quantum channel is expected to have same wide applications in quantum information science. In this paper we propose a fidelity function on quantum channels and show that various distance measures on quantum channels can be obtained from this fidelity function, for example the Bures angle and the Bures distance can be extended to quantum channels via this fidelity function. We then show that the distances between quantum channels lead naturally to a new Fisher information which quantifies the ultimate precision limit in quantum metrology, the ultimate precision limit can thus be seen as a manifestation of the distances between quantum channels. We also show that the fidelity on quantum channels provides a unified framework for perfect quantum channel discrimination and quantum metrology, in particular we show that the minimum number of uses needed for perfect channel discrimination is exactly the counterpart of the precision limit in quantum metrology, and various useful lower bounds for the minimum number of uses needed for perfect channel discrimination can be obtained via this connection.

quant-ph↗

Quantum parameter estimation with general dynamics

One of the main quests in quantum metrology, and quantum parameter estimation in general, is to find out the highest achievable precision with given resources and design schemes that attain that precision. In this article we present a general framework for quantum parameter estimation which relates the ultimate precision limit directly to the underlying dynamics. With this framework we present systematical methods for computing the ultimate precision limit and optimal probe states. We further demonstrate the power of the framework by deriving a sufficient condition on when ancillary systems are not useful for improving the precision limit.

quant-ph↗

Universal time scaling for Hamiltonian parameter estimation

Time is a valuable resource and it seems intuitive that longer time should lead to better precision in Hamiltonian parameter estimation. However recent studies have put this intuition into question, showing longer time may even lead to worse estimation in certain cases. Here we show that the intuition can be restored if coherent feedback controls are included. By deriving asymptotically optimal feedback controls we present a quantification of the maximal improvement feedback controls can provide in Hamiltonian parameter estimation and show a universal time scaling for the precision limit of Hamiltonian parameter estimation under the optimal feedback scheme.

quant-ph↗

Solution to time-energy costs of quantum channels

We derive a formula for the time-energy costs of general quantum channels proposed in [Phys. Rev. A 88, 012307 (2013)]. This formula allows us to numerically find the time-energy cost of any quantum channel using positive semidefinite programming. We also derive a lower bound to the time-energy cost for any channels and the exact the time-energy cost for a class of channels which includes the qudit depolarizing channels and projector channels as special cases.

quant-ph↗

Mismatched-basis statistics enable quantum key distribution with uncharacterized qubit sources

In the postprocessing of quantum key distribution, the raw key bits from the mismatched-basis measurements, where two parties use different bases, are normally discarded. Here, we propose a postprocessing method that exploits measurement statistics from mismatched-basis cases, and prove that incorporating these statistics enables uncharacterized qubit sources to be used in the measurement-device-independent quantum key distribution protocol and the Bennett-Brassard 1984 protocol, a case which is otherwise impossible.

quant-ph↗

Physical time-energy cost of a quantum process determines its information fidelity

A quantum system can be described and characterized by at least two different concepts, namely, its physical and informational properties. Here, we explicitly connect these two concepts, by equating the time-energy cost which is the product of the largest energy of a Hamiltonian of quantum dynamics and the evolution time, and the entanglement fidelity which is the informational difference between an input state and the corresponding output state produced by a quantum channel characterized by the Hamiltonian. Specifically, the worst-case entanglement fidelity between the input and output states is exactly the cosine of the channel's time-energy cost (except when the fidelity is zero). The exactness of our relation makes a strong statement about the intimate connection between information and physics. Our exact result may also be regarded as a time-energy uncertainty relation for the fastest state that achieves a certain fidelity.

quant-ph↗

Time-Energy Costs of Quantum Measurements

Time and energy of quantum processes are a tradeoff against each other. We propose to ascribe to any given quantum process a time-energy cost to quantify how much computation it performs. Here, we analyze the time-energy costs for general quantum measurements, along a similar line as our previous work for quantum channels, and prove exact and lower bound formulae for the costs. We use these formulae to evaluate the efficiencies of actual measurement implementations. We find that one implementation for a Bell measurement is optimal in time-energy. We also analyze the time-energy cost for unambiguous state discrimination and find evidence that only a finite time-energy cost is needed to distinguish any number of states.

quant-ph↗

Disguising quantum channels by mixing and channel distance trade-off

We consider the reverse problem to the distinguishability of two quantum channels, which we call the disguising problem. Given two quantum channels, the goal here is to make the two channels identical by mixing with some other channels with minimal mixing probabilities. This quantifies how much one channel can disguise as the other. In addition, the possibility to trade off between the two mixing probabilities allows one channel to be more preserved (less mixed) at the expense of the other. We derive lower- and upper-bounds of the trade-off curve and apply them to a few example channels. Optimal trade-off is obtained in one example. We relate the disguising problem and the distinguishability problem by showing the the former can lower and upper bound the diamond norm. We also show that the disguising problem gives an upper bound on the key generation rate in quantum cryptography.

quant-ph↗

Conditions for degradability of tripartite quantum states

Alice, Bob, and Eve share a pure quantum state. We introduce the notion of state degradability by asking whether the joint density of Alice and Eve can be transformed to the joint density of Alice and Bob by processing Eve's part through a quantum channel, in order words, degrading Eve. We prove necessary and sufficient conditions for state degradability and provide an efficient method to quickly rule out degradability for a given state. The problem of determining degradability of states is different from that of quantum channels, although the notion is similar. One application of state degradability is that it can be used to test channel degradability. In particular, the degradability of the output state of a channel obtained from the maximally entangled input state gives information about the degradability of the channel.

quant-ph↗

Measurement-device-independent quantum key distribution with uncharacterized qubit sources

Measurement-device-independent quantum key distribution (MDIQKD) is proposed to be secure against any possible detection attacks. The security of the original proposal relies on the assumption that the legitimate users can fully characterize the encoding systems including sources. Here, we propose a MDIQKD protocol where we allow uncharacterized encoding systems as long as qubit sources are used. A security proof of the MDIQKD protocol is presented that does not need the knowledge of the encoding states. Simulation results show that the scheme is practical.

quant-ph↗