Search arXivSearch

arXiv subjects

Shang Yu

Publications and source records attributed to Shang Yu.

At least 19 recordsLinked to original sources

Gaussian Boson Sampling for Asset Clustering in Statistical Arbitrage Portfolios

Gaussian Boson Sampling (GBS) provides a native photonic quantum heuristic for sampling dense subgraphs from adjacency matrices, offering a scalable physical approach to combinatorial graph search problems. Simultaneously, correlation matrix clustering algorithms, such as Spectral and SPONGE, have established robust benchmarks for identifying co-moving assets from correlation matrices in statistical arbitrage (StatArb) strategies. In this work, we map S&P 500 residual correlation data into GBS-compatible adjacency matrices. We benchmark those classical clustering algorithms against two quantum clustering algorithms, GBS Boost and our novel GBS Roots, to construct dynamic, market-neutral portfolios over a rolling one-year window. Simulations across distinct macroeconomic regimes reveal that quantum clustering generates superior alpha within large stock universes during periods of high volatility, effectively isolating structural market idiosyncrasies. Crucially, this economic advantage persists under simulated low-loss conditions and extends into high-loss regimes via the application of coherent displacement to compensate for photon loss. Our findings underscore the efficacy of GBS-derived graph clustering in constructing robust StatArb portfolios, establishing a quantum foundation for broader quantitative finance applications.

quant-ph

Improving the loss threshold for quantum advantage in photonic sensors by complete photon counting

Tolerance to imperfections is a defining performance criterion for quantum sensors. The threshold for achieving a quantum advantage depends on the input state, sensor configuration, detection scheme, and, critically for optical platforms, photon loss. We consider a nonlinear interferometer in which two gain-optimized parametric nonlinear optical processes couple the state to the internal sensor and subsequently mix the reference and sensor beams. We demonstrate that measuring the full photon-number output statistics of this setup yields marked improvements in the loss threshold. Using photon-number-resolving detection (PNRD) based on transition-edge sensors (TESs), we experimentally reconstruct the joint photon-number statistics at the interferometer output. Subject to internal and external losses of approximately 25 % and 45 %, respectively -- and without any post-selection or loss correction -- we observe an unconditional violation of the shot-noise limit by $2.37 \pm 0.11$ dB. This translates to a 44 % enhancement in estimation precision over conventional click-detection strategies. We verify this performance by evaluating the classical Fisher information against both an analytical model of the joint photon-number distribution and the raw measured statistics. Ultimately, our results demonstrate that combining nonlinear interferometry with PNRD unlocks metrological information fundamentally inaccessible to click detectors, establishing a clear path toward practical, quantum-enhanced sensing under realistic loss conditions.

quant-ph

Displaced Gaussian Boson Sampling for enhanced max-clique search

Gaussian Boson Sampling (GBS) is capable of solving certain classes of graph problems owing to the samples produced by such a device having a connection to the hafnian matrix function. In particular, a GBS device has been shown to provide an enhancement in the search of cliques -- or complete subgraphs -- in undirected weighted graphs over classical algorithms. A graph can be mapped to a GBS experiment by configuring the squeezing parameters of the input states and programming the linear optical network. In practice, limited squeezing and photon loss degrade the performance of the GBS device for max-clique search. In comparison, coherent states -- often considered a classical resource due to their Poissonian statistics -- can be readily prepared across many modes using an attenuated laser. In this paper, we report an enhancement of the success rate of GBS in finding maximum weighted cliques by adding displacements under lossy conditions or when a limited amount of squeezing is available. Moreover, we report that this enhancement can be scaled up to large graphs with limited resource overheads.

quant-ph

Photonic Quantum-Enhanced Knowledge Distillation

Photonic quantum processors naturally produce intrinsically stochastic measurement outcomes, offering a hardware-native source of structured randomness that can be exploited during machine-learning training. Here we introduce Photonic Quantum-Enhanced Knowledge Distillation (PQKD), a hybrid quantum photonic--classical framework in which a programmable photonic circuit generates a compact conditioning signal that constrains and guides a parameter-efficient student network during distillation from a high-capacity teacher. PQKD replaces fully trainable convolutional kernels with dictionary convolutions: each layer learns only a small set of shared spatial basis filters, while sample-dependent channel-mixing weights are derived from shot-limited photonic features and mapped through a fixed linear transform. Training alternates between standard gradient-based optimisation of the student and sampling-robust, gradient-free updates of photonic parameters, avoiding differentiation through photonic hardware. Across MNIST, Fashion-MNIST and CIFAR-10, PQKD traces a controllable compression--accuracy frontier, remaining close to teacher performance on simpler benchmarks under aggressive convolutional compression. Performance degrades predictably with finite sampling, consistent with shot-noise scaling, and exponential moving-average feature smoothing suppresses high-frequency shot-noise fluctuations, extending the practical operating regime at moderate shot budgets.

quant-ph

Machine learning of quantum data using optimal similarity measurements

Quantum machine learning seeks a computational advantage in data processing by evaluating functions of quantum states, such as their similarity, that can be classically intractable to compute. For quantum advantage to be possible, however, it is essential to bypass costly characterisation of individual data instances in favour of efficient, direct similarity evaluation. Here we demonstrate a sample-optimal, hardware-efficient protocol for estimating quantum similarity -- the state overlap -- using bosonic quantum interference. The sample complexity of this approach is independent of the system dimension and is information-theoretically optimal up to a constant factor. Experimentally, we implement the scheme on \emph{Prakash-1}, a quantum computing platform based on a fully programmable integrated photonic processor. By preparing and interfering qudit states on the chip to directly extract their overlap, we demonstrate classification and online learning of quantum data with high accuracy in realistic noisy experiments. Our results establish joint overlap measurements as a scalable pathway to efficient quantum data analysis and a practical building block for network-integrated quantum machine learning.

quant-ph

Heterogeneous Optically-Detected Spin-Acoustic Resonance in Solid-State Molecular Thin-film

We report an implementation of spin-acoustic resonance in pentacene thin films integrated on a high-quality-factor (high-Q) surface acoustic wave (SAW) resonator on a lithium niobate substrate. Heterogeneous optically detected spin-acoustic resonance (HODSAR) is an optically detected spin-resonance measurement in which the resonant drive is delivered mechanically by a surface acoustic wave (SAW). By leveraging the photo-excited triplet state of pentacene at room temperature, we demonstrate coherent spin manipulation via acoustic driving under zero externally applied magnetic field. The heterogeneously integrated device, referred to as HODSAR, utilizes spin-phonon coupling to achieve mechanically driven, zero-field spin resonance, opening avenues for room-temperature mechanically addressable spin control and device integration. We show that the high-Q multimode response of the SAW resonator enables spectrally selective acoustic addressing of triplet transitions near 105 MHz. Coherent control is evidenced by Rabi oscillations, with a Rabi frequency that increases linearly with the square root of the applied RF input power over the measured drive range, consistent with driven two-level dynamics under acoustic excitation. These results establish spin-acoustic resonance in a heterogeneously integrated molecular thin-film platform and provide a quantitative basis for benchmarking mechanically mediated spin control.

quant-ph

Extensible universal photonic quantum computing with nonlinearity

Universal quantum computing requires an architecture that supports both linear circuits and, crucially, strong nonlinear resources. For quantum photonic systems, integrating such nonlinearities with scalable linear circuitry has been a major bottleneck, leaving most optical experiments without nonlinear operations and, consequently, incapable of achieving universality. Here, we report an extensible photonic computer that supports a universal gate set by seamlessly combining fully programmable, scalable linear optical networks with integrated nonlinear modules. This platform enables a broad range of quantum computing and simulation tasks. We demonstrate the quasi-deterministic generation of optical Gottesman-Kitaev-Preskill states, which are essential resources for bosonic error correction, yet had previously been realized only probabilistically. Furthermore, we simulate complex many-body quantum dynamics, exemplified by the Bose-Hubbard model. Such quantum simulation tasks have long been considered beyond the reach of photonic hardware limited to linear operations. These capabilities, enabled by our extensible architecture, establish a viable route towards photonic quantum simulation and fault-tolerant quantum computing.

quant-ph

Topological network analysis using a programmable photonic quantum processor

Understanding topological features in networks is crucial for unravelling complex phenomena across fields such as neuroscience, condensed matter, and high-energy physics. However, identifying higher-order topological structures -- such as $k$-cliques, fundamental building blocks of complex networks -- remains a significant challenge. Here we develop a universal programmable photonic quantum processor that enables the encoding of arbitrary complex-weight networks, providing a direct pathway to uncovering their topological structures. We demonstrate how this quantum approach can identify weighted $k$-cliques and estimate Betti numbers by leveraging the Gaussian boson sampling algorithm's ability to preferentially select high-weight, dense subgraphs. The unique capabilities of our programmable quantum processor allow us to observe topological phase transitions and identify clique percolation phenomena directly from the entropy of the sampling results. These findings showcase how photonic quantum computing can be applied to analyse the topological characteristics of real-world complex networks, opening new possibilities for quantum-enhanced data analysis.

quant-ph

A Tractable Protocol for Detection-Loophole-Free Bell Tests over Long Distances

Certifying genuine nonclassical correlations over long distances is crucial for device-independent (DI) quantum information protocols. However, in photonic platforms this remains technologically challenging due to photon loss, which opens the detection-loophole, rendering violations increasingly difficult for less efficient detectors. A well-known strategy to mitigate this involves using non-maximally entangled states, which Eberhard showed can tolerate lower detection efficiencies. However, existing proposals and demonstrations have been limited to short distances, as their success rates scale linearly with channel transmittance. Here, we propose a protocol to herald a tunable entangled state between distant users that achieves a post-selection-free Bell inequality violation at the Eberhard limit. We identify the loss independence of the vacuum component amplitude of the prepared state as the source of this enhancement. Notably, our scheme requires only quantum interference at a central station, followed by the detection of a single photon, preserving the optimal square-root scaling with channel transmittance. Our approach provides greater loss-tolerance in entanglement distribution, bringing long-distance DI applications closer to practical implementation.

quant-ph

Robust Decentralized Quantum Kernel Learning for Noisy and Adversarial Environment

This paper proposes a general decentralized framework for quantum kernel learning (QKL). It has robustness against quantum noise and can also be designed to defend adversarial information attacks forming a robust approach named RDQKL. We analyze the impact of noise on QKL and study the robustness of decentralized QKL to the noise. By integrating robust decentralized optimization techniques, our method is able to mitigate the impact of malicious data injections across multiple nodes. Experimental results demonstrate that our approach maintains high accuracy under noisy quantum operations and effectively counter adversarial modifications, offering a promising pathway towards the future practical, scalable and secure quantum machine learning (QML).

quant-ph

Adaptive Non-Gaussian Quantum State Engineering

Non-Gaussian quantum states of bosons are a key resource in quantum information science with applications ranging from quantum metrology to fault-tolerant quantum computation. Generation of photonic non-Gaussian resource states, such as Schr\"odinger's cat and Gottesman-Kitaev-Preskill states, is challenging. In this work, we extend on existing passive architectures and explore a broad set of adaptive schemes. Our numerical results demonstrate a consistent improvement in the probability of success and fidelity of generating these non-Gaussian quantum states with equivalent resources. We also explore the effect of loss as the primary limiting factor and observe that adaptive schemes lead to more desirable outcomes in terms of overall probability of success and loss tolerance. Our work offers a versatile framework for non-Gaussian resource state generation with the potential to guide future experimental implementations.

quant-ph

Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems

Optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime. This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems. Leveraging a hybrid classical-quantum framework, we employ spectral clustering for network partitioning and the Quantum Approximate Optimization Algorithm (QAOA) for optimizing routing within manageable subgraphs. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, providing comprehensive mathematical formulations and complexity analyses. Comparative evaluations against traditional classical algorithms demonstrate significant energy savings and enhanced scalability. Our approach underscores the potential of integrating quantum computing techniques into wireless communication networks, offering a scalable and efficient solution for future network optimization challenges

quant-ph

Boosting Photon-Number-Resolved Detection Rates of Transition-Edge Sensors by Machine Learning

Transition-Edge Sensors (TESs) are very effective photon-number-resolving (PNR) detectors that have enabled many photonic quantum technologies. However, their relatively slow thermal recovery time severely limits their operation rate in experimental scenarios compared to leading non-PNR detectors. In this work, we develop an algorithmic approach that enables TESs to detect and accurately classify photon pulses without waiting for a full recovery time between detection events. We propose two machine-learning-based signal processing methods: one supervised learning method and one unsupervised clustering method. By benchmarking against data obtained using coherent states and squeezed states, we show that the methods extend the TES operation rate to 800 kHz, achieving at least a four-fold improvement, whilst maintaining accurate photon-number assignment up to at least five photons. Our algorithms will find utility in applications where high rates of PNR detection are required and in technologies which demand fast active feed-forward of PNR detection outcomes.

quant-ph

Shedding Light on the Future: Exploring Quantum Neural Networks through Optics

At the dynamic nexus of artificial intelligence and quantum technology, quantum neural networks (QNNs) play an important role as an emerging technology in the rapidly developing field of quantum machine learning. This development is set to revolutionize the applications of quantum computing. This article reviews the concept of QNNs and their physical realizations, particularly implementations based on quantum optics . We first examine the integration of quantum principles with classical neural network architectures to create QNNs. Some specific examples, such as the quantum perceptron, quantum convolutional neural networks, and quantum Boltzmann machines are discussed. Subsequently, we analyze the feasibility of implementing QNNs through photonics. The key challenge here lies in achieving the required non-linear gates, and measurement-induced approaches, among others, seem promising. To unlock the computational potential of QNNs, addressing the challenge of scaling their complexity through quantum optics is crucial. Progress in controlling quantum states of light is continuously advancing the field. Additionally, we have discovered that different QNN architectures can be unified through non-Gaussian operations. This insight will aid in better understanding and developing more complex QNN circuits.

quant-ph

Unlocking the Potential of Photoexcited Molecular Electron Spins for Room Temperature Quantum Information Processing

Future information processing technologies like quantum memory devices have the potential to store and transfer quantum states to enable quantum computing and networking. A central consideration in practical applications for such devices is the nature of the light-matter interface which determines the storage state density and efficiency. Here, we employ an organic radical, $\alpha$,$\gamma$-bisdiphenylene-$\beta$-phenylallyl (BDPA) doped into an o-terphenyl host to explore the potential for using tuneable and high-performance molecular media in microwave-based quantum applications. We demonstrate that this radical system exhibits millisecond-long spin-lattice relaxation and microsecond-long phase memory times at room temperature, while also having the capability to generate an oscillating spin-polarized state using a co-dissolved photo-activated tetraphenylporphyrin moiety, all enabled by using a viscous liquid host. This latest system builds upon collective wisdom from previous molecules-for-quantum literature by combining careful host matrix selection, with dynamical decoupling, and photoexcited triplet-radical spin polarisation to realise a versatile and robust quantum spin medium.

cond-mat.mtrl-sci

Noise-Aware Distributed Quantum Approximate Optimization Algorithm on Near-term Quantum Hardware

This paper introduces a noise-aware distributed Quantum Approximate Optimization Algorithm (QAOA) tailored for execution on near-term quantum hardware. Leveraging a distributed framework, we address the limitations of current Noisy Intermediate-Scale Quantum (NISQ) devices, which are hindered by limited qubit counts and high error rates. Our approach decomposes large QAOA problems into smaller subproblems, distributing them across multiple Quantum Processing Units (QPUs) to enhance scalability and performance. The noise-aware strategy incorporates error mitigation techniques to optimize qubit fidelity and gate operations, ensuring reliable quantum computations. We evaluate the efficacy of our framework using the HamilToniQ Benchmarking Toolkit, which quantifies the performance across various quantum hardware configurations. The results demonstrate that our distributed QAOA framework achieves significant improvements in computational speed and accuracy, showcasing its potential to solve complex optimization problems efficiently in the NISQ era. This work sets the stage for advanced algorithmic strategies and practical quantum system enhancements, contributing to the broader goal of achieving quantum advantage.

quant-ph

Quantum Computing for Climate Resilience and Sustainability Challenges

The escalating impacts of climate change and the increasing demand for sustainable development and natural resource management necessitate innovative technological solutions. Quantum computing (QC) has emerged as a promising tool with the potential to revolutionize these critical areas. This review explores the application of quantum machine learning and optimization techniques for climate change prediction and enhancing sustainable development. Traditional computational methods often fall short in handling the scale and complexity of climate models and natural resource management. Quantum advancements, however, offer significant improvements in computational efficiency and problem-solving capabilities. By synthesizing the latest research and developments, this paper highlights how QC and quantum machine learning can optimize multi-infrastructure systems towards climate neutrality. The paper also evaluates the performance of current quantum algorithms and hardware in practical applications and presents realistic cases, i.e., waste-to-energy in anaerobic digestion, disaster prevention in flooding prediction, and new material development for carbon capture. The integration of these quantum technologies promises to drive significant advancements in achieving climate resilience and sustainable development.

quant-ph

Realization of algorithmic identification of cause and effect in quantum correlations

Causal inference revealing causal dependencies between variables from empirical data has found applications in multiple sub-fields of scientific research. A quantum perspective of correlations holds the promise of overcoming the limitation by Reichenbach's principle and enabling causal inference with only the observational data. However, it is still not clear how quantum causal inference can provide operational advantages in general cases. Here, we have devised a photonic setup and experimentally realized an algorithm capable of identifying any two-qubit statistical correlations generated by the two basic causal structures under an observational scenario, thus revealing a universal quantum advantage in causal inference over its classical counterpart. We further demonstrate the explainability and stability of our causal discovery method which is widely sought in data processing algorithms. Employing a fully observational approach, our result paves the way for studying quantum causality in general settings.

quant-ph