arXiv subjects

Geng Chen

Publications and source records attributed to Geng Chen.

At least 55 records · Page 3Linked to original sources

arXiv2025

Experimental Verification of Entangled States in the Adversarial Scenario

Efficient verification of entangled states is crucial to many applications in quantum information processing. However, the effectiveness of standard quantum state verification (QSV) is based on the condition of independent and identical distribution (IID), which impedes its applications in many practical scenarios. Here we demonstrate a defensive QSV protocol, which is effective in all kinds of non-IID scenarios, including the extremely challenging adversarial scenario. To this end, we build a high-speed preparation-and-measurement apparatus controlled by quantum random-number generators. Our experiments clearly show that standard QSV protocols often provide unreliable fidelity certificates in non-IID scenarios. In sharp contrast, the defensive QSV protocol based on a homogeneous strategy can provide reliable and nearly tight fidelity certificates at comparable high efficiency, even under malicious attacks. Moreover, our scheme is robust against the imperfections in a realistic experiment, which is very appealing to practical applications.

quant-ph↗

arXiv2025

Poiseuille flow of hyperbolic Ericksen-Leslie system in dimension two

In this paper, we study the Poiseuille laminar flow in a tube for the full Ericksen-Leslie system. It is a parabolic-hyperbolic coupled system which may develop singularity in finite time. We will prove the global existence of energy weak solution, and the partial regularity of solution to system. We first construct global weak finite energy solutions by the Ginzburg- Landau approximation and the fixed-point arguments. Then we obtain the enhanced regularity of solution. Different from the solution in one space dimension, the finite energy solution of Poiseuille laminar flow in a tube may still form a discontinuity at the origin. We show that at the first possible blowup time, there are blowup sequences which converge to a non-constant time-independent (axisymmetric) harmonic map.

math.AP↗

arXiv2025

Physics-Aware Compilation for Parallel Quantum Circuit Execution on Neutral Atom Arrays

Neutral atom quantum computers are one of the most promising quantum architectures, offering advantages in scalability, dynamic reconfigurability, and potential for large-scale implementations. These characteristics create unique compilation challenges, especially regarding compilation efficiency while adapting to hardware flexibility. However, existing methods encounter significant performance bottlenecks at scale, hindering practical applications. We propose Physics-Aware Compilation (PAC), a method that improves compilation efficiency while preserving the inherent flexibility of neutral atom systems. PAC introduces physics-aware hardware plane partitioning that strategically allocates hardware resources based on physical device characteristics like AOD and SLM trap properties and qubit mobility constraints. Additionally, it implements parallel quantum circuit division with an improved Kernighan-Lin algorithm that enables simultaneous execution across independent regions while maintaining circuit fidelity. Our experimental evaluation compares PAC with state-of-the-art methods across increasingly larger array sizes ranging from 16x16 to 64x64 qubits. Results demonstrate that PAC achieves up to 78.5x speedup on 16x16 arrays while maintaining comparable circuit quality. PAC's compilation efficiency advantage increases with system scale, demonstrating scalability for practical quantum applications on larger arrays. PAC explores a viable path for practical applications of neutral atom quantum computers by effectively addressing the tension between compilation efficiency and hardware flexibility.

quant-ph↗

arXiv2025

Surpassing the Global Heisenberg Limit Using a High-effciency Quantum Switch

Indefinite causal orders have been shown to enable a precision of inverse square N in quantum parameter estimation, where N is the number of independent processes probed in an experiment. This surpasses the widely accepted ultimate quantum precision of the Heisenberg limit, 1/N. While a recent laboratory demonstration highlighted this phenomenon, its validity relies on postselection for it only accounted for a subset of the resources used. Achieving a true violation of the Heisenberg limit-considering photon loss, detection ineffciency, and other imperfections-remains an open challenge. Here, we present an ultrahigh-effciency quantum switch to estimate the geometric phase associated with a pair of conjugate position and momentum displacements embedded in a superposition of causal orders. Our experimental data demonstrate precision surpassing the global Heisenberg limit without artificially correcting for losses or imperfections. This work paves the way for quantum metrology advantages under more general and realistic constraints.

quant-ph↗

arXiv2025

HAQA: A Hardware-Guided and Fidelity-Aware Strategy for Efficient Qubit Mapping Optimization

Quantum algorithms rely on quantum computers for implementation, but the physical connectivity constraints of modern quantum processors impede the efficient realization of quantum algorithms. Qubit mapping, a critical technology for practical quantum computing applications, directly determines the execution efficiency and feasibility of algorithms on superconducting quantum processors. Existing mapping methods overlook intractable quantum hardware fidelity characteristics, reducing circuit execution quality. They also exhibit prolonged solving times or even failure to complete when handling large-scale quantum architectures, compromising efficiency. To address these challenges, we propose a novel qubit mapping method HAQA. HAQA first introduces a community-based iterative region identification strategy leveraging hardware connection topology, achieving effective dimensionality reduction of mapping space. This strategy avoids global search procedures, with complexity analysis demonstrating quadratic polynomial-level acceleration. Furthermore, HAQA implements a hardware-characteristic-based region evaluation mechanism, enabling quantitative selection of mapping regions based on fidelity metrics. This approach effectively integrates hardware fidelity information into the mapping process, enabling fidelity-aware qubit allocation. Experimental results demonstrate that HAQA significantly improves solving speed and fidelity while ensuring solution quality. When applied to state-of-the-art quantum mapping techniques Qsynth-v2 and TB-OLSQ2, HAQA achieves acceleration ratios of 632.76 and 286.87 respectively, while improving fidelity by up to 52.69% and 238.28%

quant-ph↗

arXiv2025

FP3: A 3D Foundation Policy for Robotic Manipulation

Following its success in natural language processing and computer vision, foundation models that are pre-trained on large-scale multi-task datasets have also shown great potential in robotics. However, most existing robot foundation models rely solely on 2D image observations, ignoring 3D geometric information, which is essential for robots to perceive and reason about the 3D world. In this paper, we introduce FP3, a first large-scale 3D foundation policy model for robotic manipulation. FP3 builds on a scalable diffusion transformer architecture and is pre-trained on 60k trajectories with point cloud observations. With the model design and diverse pre-training data, FP3 can be efficiently fine-tuned for downstream tasks while exhibiting strong generalization capabilities. Experiments on real robots demonstrate that with only 80 demonstrations, FP3 is able to learn a new task with over 90% success rates in novel environments with unseen objects, significantly surpassing existing robot foundation models.

cs.RO↗

arXiv2025

Edge-aware Feature Aggregation Network for Polyp Segmentation

Precise polyp segmentation is vital for the early diagnosis and prevention of colorectal cancer (CRC) in clinical practice. However, due to scale variation and blurry polyp boundaries, it is still a challenging task to achieve satisfactory segmentation performance with different scales and shapes. In this study, we present a novel Edge-aware Feature Aggregation Network (EFA-Net) for polyp segmentation, which can fully make use of cross-level and multi-scale features to enhance the performance of polyp segmentation. Specifically, we first present an Edge-aware Guidance Module (EGM) to combine the low-level features with the high-level features to learn an edge-enhanced feature, which is incorporated into each decoder unit using a layer-by-layer strategy. Besides, a Scale-aware Convolution Module (SCM) is proposed to learn scale-aware features by using dilated convolutions with different ratios, in order to effectively deal with scale variation. Further, a Cross-level Fusion Module (CFM) is proposed to effectively integrate the cross-level features, which can exploit the local and global contextual information. Finally, the outputs of CFMs are adaptively weighted by using the learned edge-aware feature, which are then used to produce multiple side-out segmentation maps. Experimental results on five widely adopted colonoscopy datasets show that our EFA-Net outperforms state-of-the-art polyp segmentation methods in terms of generalization and effectiveness. Our implementation code and segmentation maps will be publicly at https://github.com/taozh2017/EFANet.

cs.CV↗

arXiv2025

A Remote Sensing Image Change Detection Method Integrating Layer Exchange and Channel-Spatial Differences

Change detection in remote sensing imagery is a critical technique for Earth observation, primarily focusing on pixel-level segmentation of change regions between bi-temporal images. The essence of pixel-level change detection lies in determining whether corresponding pixels in bi-temporal images have changed. In deep learning, the spatial and channel dimensions of feature maps represent different information from the original images. In this study, we found that in change detection tasks, difference information can be computed not only from the spatial dimension of bi-temporal features but also from the channel dimension. Therefore, we designed the Channel-Spatial Difference Weighting (CSDW) module as an aggregation-distribution mechanism for bi-temporal features in change detection. This module enhances the sensitivity of the change detection model to difference features. Additionally, bi-temporal images share the same geographic location and exhibit strong inter-image correlations. To construct the correlation between bi-temporal images, we designed a decoding structure based on the Layer-Exchange (LE) method to enhance the interaction of bi-temporal features. Comprehensive experiments on the CLCD, PX-CLCD, LEVIR-CD, and S2Looking datasets demonstrate that the proposed LENet model significantly improves change detection performance. The code and pre-trained models will be available at: https://github.com/dyzy41/lenet.

cs.CV↗

arXiv2024

MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping

Quantum circuit mapping is a critical process in quantum computing that involves adapting logical quantum circuits to adhere to hardware constraints, thereby generating physically executable quantum circuits. Current quantum circuit mapping techniques, such as solver-based methods, often encounter challenges related to slow solving speeds due to factors like redundant search iterations. Regarding this issue, we propose a machine learning approach for accelerating optimal qubit mapping (MLQM). First, the method proposes a global search space pruning scheme based on prior knowledge and machine learning, which in turn improves the solution efficiency. Second, to address the limited availability of effective samples in the learning task, MLQM introduces a novel data augmentation and refinement scheme, this scheme enhances the size and diversity of the quantum circuit dataset by exploiting gate allocation and qubit rearrangement. Finally, MLQM also further improves the solution efficiency by pruning the local search space, which is achieved through an adaptive dynamic adjustment mechanism of the solver variables. Compared to state-of-the-art qubit mapping approaches, MLQM achieves optimal qubit mapping with an average solving speed-up ratio of 1.79 and demonstrates an average advantage of 22% in terms of space complexity.

quant-ph↗

arXiv2024

Untrained Filtering with Trained Focusing for Superior Quantum Architecture Search

Quantum architecture search (QAS) represents a fundamental challenge in quantum machine learning. Unlike previous methods that treat it as a static search process, from a perspective on QAS as an item retrieval task in vast search space, we decompose the search process into dynamic alternating phases of coarse and fine-grained knowledge learning. We propose quantum untrained-explored synergistic trained architecture (QUEST-A),a framework through coarse-grained untrained filtering for rapid search space reduction and fine-grained trained focusing for precise space refinement in progressive QAS. QUEST-A develops an evolutionary mechanism with knowledge accumulation and reuse to enhance multi-level knowledge transfer in architecture searching. Experiments demonstrate QUEST-A's superiority over existing methods: enhancing model expressivity in signal representation, maintaining high performance across varying complexities in image classification, and achieving order-of-magnitude precision improvements in variational quantum eigensolver tasks, providing a transferable methodology for QAS.

quant-ph↗

arXiv2024

A new quantum machine learning algorithm: split hidden quantum Markov model inspired by quantum conditional master equation

The Hidden Quantum Markov Model (HQMM) has significant potential for analyzing time-series data and studying stochastic processes in the quantum domain as an upgrading option with potential advantages over classical Markov models. In this paper, we introduced the split HQMM (SHQMM) for implementing the hidden quantum Markov process, utilizing the conditional master equation with a fine balance condition to demonstrate the interconnections among the internal states of the quantum system. The experimental results suggest that our model outperforms previous models in terms of scope of applications and robustness. Additionally, we establish a new learning algorithm to solve parameters in HQMM by relating the quantum conditional master equation to the HQMM. Finally, our study provides clear evidence that the quantum transport system can be considered a physical representation of HQMM. The SHQMM with accompanying algorithms present a novel method to analyze quantum systems and time series grounded in physical implementation.

quant-ph↗

arXiv2024

The robustness of skyrmion numbers of structured optical fields in atmospheric turbulence

The development of vector optical fields has brought forth numerous applications. Among these optical fields, a particular class of vector vortex beams has emerged, leading to the emergence of intriguing optical skyrmion fields characterized by skyrmion numbers. The optical skyrmion fields are well-defined by their effective magnetization and possess topologically protected configurations. It is anticipated that this type of optical structure can be exploited for encoding information in optical communication, even under perturbations such as turbulent air, optical fibers, and even general random media. In this study, we numerically demonstrate that the skyrmion numbers of optical skyrmion fields exhibit a certain degree of robustness to atmospheric turbulence, even though their intensity, phase and polarization patterns are distorted. Intriguingly, it is also observed that a larger difference between the absolute values of two azimuthal indices of the vectorial structured light field can lead to a superior level of resilience. These properties not only enhance the versatility of skyrmion fields and their numbers, but also open up new possibilities for their use in various applications across noisy channels.

physics.optics↗

arXiv2024

SimTxtSeg: Weakly-Supervised Medical Image Segmentation with Simple Text Cues

Weakly-supervised medical image segmentation is a challenging task that aims to reduce the annotation cost while keep the segmentation performance. In this paper, we present a novel framework, SimTxtSeg, that leverages simple text cues to generate high-quality pseudo-labels and study the cross-modal fusion in training segmentation models, simultaneously. Our contribution consists of two key components: an effective Textual-to-Visual Cue Converter that produces visual prompts from text prompts on medical images, and a text-guided segmentation model with Text-Vision Hybrid Attention that fuses text and image features. We evaluate our framework on two medical image segmentation tasks: colonic polyp segmentation and MRI brain tumor segmentation, and achieve consistent state-of-the-art performance. Source code is available at: https://github.com/xyx1024/SimTxtSeg.

cs.CV↗

arXiv2024

Identifying Influential nodes in Brain Networks via Self-Supervised Graph-Transformer

Studying influential nodes (I-nodes) in brain networks is of great significance in the field of brain imaging. Most existing studies consider brain connectivity hubs as I-nodes. However, this approach relies heavily on prior knowledge from graph theory, which may overlook the intrinsic characteristics of the brain network, especially when its architecture is not fully understood. In contrast, self-supervised deep learning can learn meaningful representations directly from the data. This approach enables the exploration of I-nodes for brain networks, which is also lacking in current studies. This paper proposes a Self-Supervised Graph Reconstruction framework based on Graph-Transformer (SSGR-GT) to identify I-nodes, which has three main characteristics. First, as a self-supervised model, SSGR-GT extracts the importance of brain nodes to the reconstruction. Second, SSGR-GT uses Graph-Transformer, which is well-suited for extracting features from brain graphs, combining both local and global characteristics. Third, multimodal analysis of I-nodes uses graph-based fusion technology, combining functional and structural brain information. The I-nodes we obtained are distributed in critical areas such as the superior frontal lobe, lateral parietal lobe, and lateral occipital lobe, with a total of 56 identified across different experiments. These I-nodes are involved in more brain networks than other regions, have longer fiber connections, and occupy more central positions in structural connectivity. They also exhibit strong connectivity and high node efficiency in both functional and structural networks. Furthermore, there is a significant overlap between the I-nodes and both the structural and functional rich-club. These findings enhance our understanding of the I-nodes within the brain network, and provide new insights for future research in further understanding the brain working mechanisms.

q-bio.NC↗

arXiv2024

QUSL: Quantum Unsupervised Image Similarity Learning with Enhanced Performance

Leveraging quantum properties to enhance complex learning tasks has been proven feasible, with excellent recent achievements in the field of unsupervised learning. However, current quantum schemes neglect adaptive adjustments for unsupervised task scenarios. This work proposes a novel quantum unsupervised similarity learning method, QUSL. Firstly, QUSL uses similarity triplets for unsupervised learning, generating positive samples by perturbing anchor images, achieving a learning process independent of classical algorithms. Subsequently, combining the feature interweaving of triplets, QUSL employs metaheuristic algorithms to systematically explore high-performance mapping processes, obtaining quantum circuit architectures more suitable for unsupervised image similarity tasks. Ultimately, QUSL realizes feature learning with lower quantum resource costs. Comprehensive numerical simulations and experiments on quantum computers demonstrate that QUSL outperforms state-of-the-art quantum methods. QUSL achieves over 50% reduction in critical quantum resource utilization. QUSL improves similarity detection correlation by up to 19.5% across multiple datasets, exhibiting robustness in NISQ environments. While using fewer quantum resources, QUSL shows potential for large-scale unsupervised tasks.

quant-ph↗

arXiv2024

The Initial Stages of a Generic Singularity for a 2D Pressureless Gas

We consider the Cauchy problem for the equations of pressureless gases in two space dimensions. For a generic set of smooth initial data (density and velocity), it is known that the solution loses regularity at a finite time $t_0$, where both the the density and the velocity gradient become unbounded. Aim of this paper is to provide an asymptotic description of the solution beyond the time of singularity formation. For $t>t_0$ we show that a singular curve is formed, where the mass has positive density w.r.t.1-dimensional Hausdorff measure. The system of equations describing the behavior of the singular curve is not hyperbolic. Working within a class of analytic data, local solutions can be constructed using a version of the Cauchy-Kovalevskaya theorem. For this purpose, by a suitable change of variables we rewrite the evolution equations as a first order system of Briot-Bouquet type, to which a general existence-uniqueness theorem can then be applied.

math.AP↗

arXiv2024

A Broadband Algorithm for Adiabatic Mode Evolution and its Application on Polarization Splitter-Rotator on LNOI Platform

Adiabatic mode evolution waveguides (AMEWs) are widely utilized in integrated photonics, including tapered waveguides, edge couplers, mode converters, splitters, etc. An analytical theory and a novel AMEW design algorithm are developed to create shortcuts to adiabaticity (STA). This new algorithm is effective in shortening the total length of the AMEW while maintaining the desired wavelength range. Moreover, this analytical algorithm requires much fewer computing resources than traditional numerical algorithms. With the new algorithm, we demonstrate a broadband and highly efficient polarization splitter-rotator (PSR) on a lithium-niobate-on-insulator (LNOI) platform with an LN thickness of 500 nm. According to our simulation, the length of the PSR is shortened by 3.5 times compared to the linear design. The fabricated PSR, with a total length of 2 mm, exhibits an insertion loss (IL) of 0.8 dB and a polarization extinction ratio (ER) of 12.2 dB over a wavelength range exceeding 76 nm.

physics.optics↗

arXiv2024

EfficientCD: A New Strategy For Change Detection Based With Bi-temporal Layers Exchanged

With the widespread application of remote sensing technology in environmental monitoring, the demand for efficient and accurate remote sensing image change detection (CD) for natural environments is growing. We propose a novel deep learning framework named EfficientCD, specifically designed for remote sensing image change detection. The framework employs EfficientNet as its backbone network for feature extraction. To enhance the information exchange between bi-temporal image feature maps, we have designed a new Feature Pyramid Network module targeted at remote sensing change detection, named ChangeFPN. Additionally, to make full use of the multi-level feature maps in the decoding stage, we have developed a layer-by-layer feature upsampling module combined with Euclidean distance to improve feature fusion and reconstruction during the decoding stage. The EfficientCD has been experimentally validated on four remote sensing datasets: LEVIR-CD, SYSU-CD, CLCD, and WHUCD. The experimental results demonstrate that EfficientCD exhibits outstanding performance in change detection accuracy. The code and pretrained models will be released at https://github.com/dyzy41/mmrscd.

cs.CV↗