SearcharxivSearch

arXiv subjects

Huihui Zhu

Publications and source records attributed to Huihui Zhu.

At least 19 recordsLinked to original sources

Photonic-Implemented Efficient Deep Quantum Neural Network via Virtual-Driven Hilbert Space Expansion

The growing computational demands of classical neural networks have intensified the search for energy-efficient and powerful computational alternatives. Quantum neural networks (QNNs) implemented on integrated photonic platforms offer a compelling avenue, offering exceptional computational power enhancements, with inherent programmability and scalability of integrated architectures. A critical challenge, however, is implementing the fundamental non-unitary and nonlinear activation function of QNNs within a linear quantum photonic system. Existing strategies, such as the adding ancillary qubits and measurement-based feedback or forward are constrained by high qubit resource costs, overhead devices, and poor cascadability. Here, we propose a novel deep photonic QNN with an expanded computational Hilbert space via input replication and mode expansion, which enables the realization of effective non-unitary and nonlinear activation on a linear programmable quantum photonic chip. This approach eliminates the need for physical ancillary qubits, measurement-induced qubit consumption and the measurement device burden, thereby significantly reduce resource costs. The fabricated chip integrates four high-quality entanglement sources and a programmable high-dimensional interferometric network, enabling a two-hidden-layer QNN that exhibits dimension-enhanced expressivity over the existing QNN architectures. We demonstrate its capabilities across diverse tasks, including nonlinear classification, image generation, and quantum Gibbs state preparation. This work establishes a scalable and efficient architecture toward practical quantum deep learning systems capable of tackling problems beyond the reach of classical computation.

quant-ph

2.5D co-packaged optical I/O chipsets on a SiON/Si interposer for 4 $\times$ 100G optical interconnection

Optical I/O technologies have emerged as a potential industrial solution for high-performance data interconnection in AI/ML computing acceleration. While optical I/Os are deployed at the edge of computational chips by co-packaged optics (CPO), flexible and high-performance integration architectures need to be explored to address system-level challenges. In this work, we present and experimentally demonstrate a SiON/Si-based optical interposer that integrates high-bandwidth and energy-efficient optical I/O chipsets. High-performance photonic and electronic components are co-packaged on the interposer, leading to low-loss, signal-integrity-friendly, and thermally efficient characteristics. The optical interposer incorporates low-loss SiON photonic circuits to realize scalable waveguide routing and wavelength-division multiplexing (WDM) with polarization-insensitive operation and high fabrication tolerance, while supporting flip-chip integration with InP-based active devices, including electro-absorption modulated lasers (EMLs) and photodetectors (PDs). Based on this architecture, a 400-Gb/s single-fiber optical transceiver is implemented and experimentally evaluated. Clear eye diagrams and high receiver sensitivity demonstrate reliable high-speed data transmission, which offers scalable, high-bandwidth optical I/Os in future high-performance computational clusters.

physics.optics

Bringing Private Reads to Hyperledger Fabric via Private Information Retrieval

Permissioned blockchains ensure integrity and auditability of shared data but expose query parameters to peers during read operations, creating privacy risks for organizations querying sensitive records. This paper proposes a Private Information Retrieval (PIR) mechanism to enable private reads from Hyperledger Fabric's world state, allowing endorsing peers to process encrypted queries without learning which record is accessed. We implement and benchmark a PIR-enabled chaincode that performs ciphertext-plaintext (ct-pt) homomorphic multiplication directly within evaluate transactions, preserving Fabric's endorsement and audit semantics. The prototype achieves an average end-to-end latency of 113 ms and a peer-side execution time below 42 ms, with approximately 2 MB of peer network traffic per private read in development mode--reducible by half under in-process deployment. Storage profiling across three channel configurations shows near-linear growth: block size increases from 77 kilobytes to 294 kilobytes and world-state from 112 kilobytes to 332 kilobytes as the ring dimension scales from 8,192 to 32,768 coefficients. Parameter analysis further indicates that ring size and record length jointly constrain packing capacity, supporting up to 512 records of 64 bytes each under the largest configuration. These results confirm the practicality of PIR-based private reads in Fabric for smaller, sensitive datasets and highlight future directions to optimize performance and scalability.

cs.CR

A class of core inverses associated with Green's relations in semigroups

Let $S$ be a $*$-monoid and let $a,b,c$ be elements of $S$. We say that $a$ is $(b,c)$-core-EP invertible if there exist some $x$ in $S$ and some nonnegative integer $k$ such that $cax(ca)^{k}c=(ca)^{k}c$, $x{\mathcal R}(ca)^{k}b$ and $x{\mathcal L}((ca)^{k}c)^{*}$. This terminology can be seen as an extension of the $w$-core-EP inverse and the $(b,c)$-core inverse. It is explored when $(b,c)$-core-EP invertibility implies $w$-core-EP invertibility. Another accomplishment of our work is to establish the criteria for the $(b,c)$-core-EP inverse of $a$ and to clarify the relations between the $(b,c)$-inverse, the core inverse, the core-EP inverse, the $w$-core inverse, the $(b,c)$-core inverse and the $(b,c)$-core-EP inverse. As an application, we improve a result in the literature focused on $(b,c)$-core inverses. We then establish the criterion for the $(B,C)$-core-EP inverse of $A$ in complex matrices, and give the solution to the system of matrix equations.

math.RA

Variational quantum classifiers via a programmable photonic microprocessor

Quantum computing holds promise across various fields, particularly with the advent of Noisy Intermediate-Scale Quantum (NISQ) devices, which can outperform classical supercomputers in specific tasks. However, challenges such as noise and limited qubit capabilities hinder its practical applications. Variational Quantum Algorithms (VQAs) offer a viable strategy to achieve quantum advantage by combining quantum and classical computing. Leveraging on VQAs, the performance of Variational Quantum Classifiers (VQCs) is competitive with many classical classifiers. This work implements a VQC using a silicon-based quantum photonic microprocessor and a classical computer, demonstrating its effectiveness in nonlinear binary and multi-classification tasks. An efficient gradient free genetic algorithm is employed for training. The VQC's performance was evaluated on three synthetic binary classification tasks with square-, circular-, and sine-shape decision boundaries and a real-world multiclass Iris dataset. The accuracies on the three binary classification tasks were 87.5%, 92.5%, and 85.0%, respectively, and 98.8% on the real world Iris dataset, highlighting the platform's potential to handle complex data patterns.

quant-ph

Towards Quantum Federated Learning

Quantum Federated Learning (QFL) is an emerging interdisciplinary field that merges the principles of Quantum Computing (QC) and Federated Learning (FL), with the goal of leveraging quantum technologies to enhance privacy, security, and efficiency in the learning process. Currently, there is no comprehensive survey for this interdisciplinary field. This review offers a thorough, holistic examination of QFL. We aim to provide a comprehensive understanding of the principles, techniques, and emerging applications of QFL. We discuss the current state of research in this rapidly evolving field, identify challenges and opportunities associated with integrating these technologies, and outline future directions and open research questions. We propose a unique taxonomy of QFL techniques, categorized according to their characteristics and the quantum techniques employed. As the field of QFL continues to progress, we can anticipate further breakthroughs and applications across various industries, driving innovation and addressing challenges related to data privacy, security, and resource optimization. This review serves as a first-of-its-kind comprehensive guide for researchers and practitioners interested in understanding and advancing the field of QFL.

cs.LG

SEMv2: Table Separation Line Detection Based on Instance Segmentation

Table structure recognition is an indispensable element for enabling machines to comprehend tables. Its primary purpose is to identify the internal structure of a table. Nevertheless, due to the complexity and diversity of their structure and style, it is highly challenging to parse the tabular data into a structured format that machines can comprehend. In this work, we adhere to the principle of the split-and-merge based methods and propose an accurate table structure recognizer, termed SEMv2 (SEM: Split, Embed and Merge). Unlike the previous works in the ``split'' stage, we aim to address the table separation line instance-level discrimination problem and introduce a table separation line detection strategy based on conditional convolution. Specifically, we design the ``split'' in a top-down manner that detects the table separation line instance first and then dynamically predicts the table separation line mask for each instance. The final table separation line shape can be accurately obtained by processing the table separation line mask in a row-wise/column-wise manner. To comprehensively evaluate the SEMv2, we also present a more challenging dataset for table structure recognition, dubbed iFLYTAB, which encompasses multiple style tables in various scenarios such as photos, scanned documents, etc. Extensive experiments on publicly available datasets (e.g. SciTSR, PubTabNet and iFLYTAB) demonstrate the efficacy of our proposed approach. The code and iFLYTAB dataset are available at https://github.com/ZZR8066/SEMv2.

cs.CV

A new class of generalized inverses in semigroups and rings with involution

Let $S$ be a $*$-semigroup and let $a,w,v\in S$. The initial goal of this work is to introduce two new classes of generalized inverses, called the $w$-core inverse and the dual $v$-core inverse in $S$. An element $a\in S$ is $w$-core invertible if there exists some $x\in S$ such that $awx^2=x$, $xawa=a$ and $(awx)^*=awx$. Such an $x$ is called a $w$-core inverse of $a$. It is shown that the core inverse and the pseudo core inverse can be characterized in terms of the $w$-core inverse. Several characterizations of the $w$-core inverse of $a$ are derived, and the expression is given by the inverse of $w$ along $a$ and $\{1,3\}$-inverses of $a$ in $S$. Also, the connections between the $w$-core inverse and other generalized inverses are given. In particular, when $S$ is a $*$-ring, the existence criterion for the $w$-core inverse is given by units. The dual $v$-core inverse of $a$ is defined by the existence of $y\in S$ satisfying $y^2va=y$, $avay=a$ and $(yva)^*=yva$. Dual results for the dual $v$-core inverse also hold.

math.RA

A new class of partial orders

Let $R$ be a unital $*$-ring. For any $a,w,b\in R$, we apply the defined $w$-core inverse to define a new class of partial orders in $R$, called the $w$-core partial order. Suppose $a,b\in R$ are $w$-core invertible. We say that $a$ is below $b$ under the $w$-core partial order, denoted by $a\overset{\tiny{\textcircled{\#}}}\leq_w b$, if $a_w^{\tiny{\textcircled{\#}}} a=a_w^{\tiny{\textcircled{\#}}} b$ and $awa_w^{\tiny{\textcircled{\#}}} =bwa_w^{\tiny{\textcircled{\#}}}$, where $a_w^{\tiny{\textcircled{\#}}}$ denotes the $w$-core inverse of $a$. Characterizations of the $w$-core partial order are given. Also, the relationships with several types of partial orders are considered. In particular, we show that the core partial order coincides with the $a$-core partial order, and the star partial order coincides with the $a^*$-core partial order.

math.RA

HRDoc: Dataset and Baseline Method Toward Hierarchical Reconstruction of Document Structures

The problem of document structure reconstruction refers to converting digital or scanned documents into corresponding semantic structures. Most existing works mainly focus on splitting the boundary of each element in a single document page, neglecting the reconstruction of semantic structure in multi-page documents. This paper introduces hierarchical reconstruction of document structures as a novel task suitable for NLP and CV fields. To better evaluate the system performance on the new task, we built a large-scale dataset named HRDoc, which consists of 2,500 multi-page documents with nearly 2 million semantic units. Every document in HRDoc has line-level annotations including categories and relations obtained from rule-based extractors and human annotators. Moreover, we proposed an encoder-decoder-based hierarchical document structure parsing system (DSPS) to tackle this problem. By adopting a multi-modal bidirectional encoder and a structure-aware GRU decoder with soft-mask operation, the DSPS model surpass the baseline method by a large margin. All scripts and datasets will be made publicly available at https://github.com/jfma-USTC/HRDoc.

cs.CL

Abnormal Behavior Detection Based on Target Analysis

Abnormal behavior detection in surveillance video is a pivotal part of the intelligent city. Most existing methods only consider how to detect anomalies, with less considering to explain the reason of the anomalies. We investigate an orthogonal perspective based on the reason of these abnormal behaviors. To this end, we propose a multivariate fusion method that analyzes each target through three branches: object, action and motion. The object branch focuses on the appearance information, the motion branch focuses on the distribution of the motion features, and the action branch focuses on the action category of the target. The information that these branches focus on is different, and they can complement each other and jointly detect abnormal behavior. The final abnormal score can then be obtained by combining the abnormal scores of the three branches.

cs.CV

A Large Scale Urban Surveillance Video Dataset for Multiple-Object Tracking and Behavior Analysis

Multiple-object tracking and behavior analysis have been the essential parts of surveillance video analysis for public security and urban management. With billions of surveillance video captured all over the world, multiple-object tracking and behavior analysis by manual labor are cumbersome and cost expensive. Due to the rapid development of deep learning algorithms in recent years, automatic object tracking and behavior analysis put forward an urgent demand on a large scale well-annotated surveillance video dataset that can reflect the diverse, congested, and complicated scenarios in real applications. This paper introduces an urban surveillance video dataset (USVD) which is by far the largest and most comprehensive. The dataset consists of 16 scenes captured in 7 typical outdoor scenarios: street, crossroads, hospital entrance, school gate, park, pedestrian mall, and public square. Over 200k video frames are annotated carefully, resulting in more than 3:7 million object bounding boxes and about 7:1 thousand trajectories. We further use this dataset to evaluate the performance of typical algorithms for multiple-object tracking and anomaly behavior analysis and explore the robustness of these methods in urban congested scenarios.

cs.CV

Characterizations of annihilator $(b,c)$-inverses in arbitrary rings

In this paper, we investigate some properties of annihilator $(b,c)$-inverses in an arbitrary ring. We demonstrate that one-sided annihilator $(b,c)$-inverses of elements in arbitrary rings may behave differently in contrast to one-sided $(b,c)$-inverses. Also, we discuss intertwining property, absorption law, reverse order law, and Cline's formula for annihilator $(b,c)$-inverses. As applications, we improve and extend some known results to $(b,c)$-inverses. In particular, we derive an equivalent condition of intertwining property for $(b,c)$-inverses in semigroups.

math.RA

Real-Time Anomaly Detection With HMOF Feature

Anomaly detection is a challenging problem in intelligent video surveillance. Most existing methods are computation consuming, which cannot satisfy the real-time requirement. In this paper, we propose a real-time anomaly detection framework with low computational complexity and high efficiency. A new feature, named Histogram of Magnitude Optical Flow (HMOF), is proposed to capture the motion of video patches. Compared with existing feature descriptors, HMOF is more sensitive to motion magnitude and more efficient to distinguish anomaly information. The HMOF features are computed for foreground patches, and are reconstructed by the auto-encoder for better clustering. Then, we use Gaussian Mixture Model (GMM) Classifiers to distinguish anomalies from normal activities in videos. Experimental results show that our framework outperforms state-of-the-art methods, and can reliably detect anomalies in real-time.

cs.CV

Characterizations and representations of core and dual core inverses

In this paper, double commutativity and the reverse order law for the core inverse are considered. Then, new characterizations of the Moore-Penrose inverse of a regular element are given by one-sided invertibilities in a ring. Furthermore, the characterizations and representations of the core and dual core inverses of a regular element are considered.

math.RA

Centralizer's applications to the inverse along an element

In this paper, we first prove that the absorption law for one-sided inverses along an element holds, deriving the absorption law for the inverse along an element. We then apply this result to obtain the absorption law for the inverse along different elements. Also, the reverse order law and the existence criterion for the inverse along an element are given by centralizers in a ring. Finally, we characterize the Moore-Penrose inverse by one-sided invertibilities in a ring with involution.

math.RA

Reverse order law for the inverse along an element

In this paper, we introduce a new concept called left (right) g-MP inverse in a $*$-monoid. The relations of this type of generalized inverse with left inverse along an element are investigated. Also, the reverse order law for the inverse along an element is studied. Then, the existence criteria and formulae of the inverse of the product of triple elements along an element are investigated in a monoid. Finally, we further study left and right g-MP inverses, the inverse along an element in the context of rings.

math.RA