Searcharxiv⌕ Search

arXiv subjects

Yiting Liu

Publications and source records attributed to Yiting Liu.

31 records · Page 2Linked to original sources

Transient Chirality in the Gelation of Adhesive Spinner Monolayers

Active systems of self-rotating elements inherently exhibit chirality, making them of fundamental interest due to parity violation. Using large-scale hydrodynamic simulations, we investigate the gelation of adhesive spinners confined to quasi-2D monolayers at low Reynolds numbers. Unlike the coarsening dynamics of passive colloids, spinner gelation follows a different pathway, displaying structural chirality during the early stages of aggregation. However, this chirality dissipates upon dynamical arrest, resulting in a final gel structure that resembles a conventional colloidal gel. As a result, we find no sign of odd mechanical responses. Nonetheless, the elastic modulus and gelation time remain tunable through spinning activity, providing a new avenue for the bottom-up design of programmable soft materials.

cond-mat.soft↗

Logical multi-qubit entanglement with dual-rail superconducting qubits

Recent advances in quantum error correction (QEC) across hardware platforms have demonstrated operation near and beyond the fault-tolerance threshold, yet achieving exponential suppression of logical errors through code scaling remains a critical challenge. Erasure qubits, which enable hardware-level detection of dominant error types, offer a promising path toward resource-efficient QEC by exploiting error bias. Single erasure qubits with dual-rail encoding in superconducting cavities and transmons have demonstrated high coherence and low single-qubit gate errors with mid-circuit erasure detection, but the generation of multi-qubit entanglement--a fundamental requirement for quantum computation and error correction--has remained an outstanding milestone. Here, we demonstrate a superconducting processor integrating four dual-rail erasure qubits that achieves the logical multi-qubit entanglement with error-biased protection. Each dual-rail qubit, encoded in pairs of tunable transmons, preserves millisecond-scale coherence times and single-qubit gate errors at the level of $10^{-5}$. By engineering tunable couplings between logical qubits, we generate high-fidelity entangled states resilient to physical qubit noise, including logical Bell states (98.8% fidelity) and a three-logical-qubit Greenberger-Horne-Zeilinger (GHZ) state (93.5% fidelity). A universal gate set is realized through a calibrated logical controlled-NOT (CNOT) gate with 96.2% process fidelity, enabled by coupler-activated $XX$ interactions in the protected logical subspace. This work advances dual-rail architectures beyond single-qubit demonstrations, providing a blueprint for concatenated quantum error correction with erasure qubits.

quant-ph↗

MEET: A Million-Scale Dataset for Fine-Grained Geospatial Scene Classification with Zoom-Free Remote Sensing Imagery

Accurate fine-grained geospatial scene classification using remote sensing imagery is essential for a wide range of applications. However, existing approaches often rely on manually zooming remote sensing images at different scales to create typical scene samples. This approach fails to adequately support the fixed-resolution image interpretation requirements in real-world scenarios. To address this limitation, we introduce the Million-scale finE-grained geospatial scEne classification dataseT (MEET), which contains over 1.03 million zoom-free remote sensing scene samples, manually annotated into 80 fine-grained categories. In MEET, each scene sample follows a scene-inscene layout, where the central scene serves as the reference, and auxiliary scenes provide crucial spatial context for finegrained classification. Moreover, to tackle the emerging challenge of scene-in-scene classification, we present the Context-Aware Transformer (CAT), a model specifically designed for this task, which adaptively fuses spatial context to accurately classify the scene samples. CAT adaptively fuses spatial context to accurately classify the scene samples by learning attentional features that capture the relationships between the center and auxiliary scenes. Based on MEET, we establish a comprehensive benchmark for fine-grained geospatial scene classification, evaluating CAT against 11 competitive baselines. The results demonstrate that CAT significantly outperforms these baselines, achieving a 1.88% higher balanced accuracy (BA) with the Swin-Large backbone, and a notable 7.87% improvement with the Swin-Huge backbone. Further experiments validate the effectiveness of each module in CAT and show the practical applicability of CAT in the urban functional zone mapping. The source code and dataset will be publicly available at https://jerrywyn.github.io/project/MEET.html.

cs.CV↗

The Power of Graph Signal Processing for Chip Placement Acceleration

Placement is a critical task with high computation complexity in VLSI physical design. Modern analytical placers formulate the placement objective as a nonlinear optimization task, which suffers a long iteration time. To accelerate and enhance the placement process, recent studies have turned to deep learning-based approaches, particularly leveraging graph convolution networks (GCNs). However, learning-based placers require time- and data-consuming model training due to the complexity of circuit placement that involves large-scale cells and design-specific graph statistics. This paper proposes GiFt, a parameter-free technique for accelerating placement, rooted in graph signal processing. GiFt excels at capturing multi-resolution smooth signals of circuit graphs to generate optimized placement solutions without the need for time-consuming model training, and meanwhile significantly reduces the number of iterations required by analytical placers. Experimental results show that GiFt significantly improving placement efficiency, while achieving competitive or superior performance compared to state-of-the-art placers. In particular, compared to DREAMPlace, the recently proposed GPU-accelerated analytical placer, GF-Placer improves total runtime over 45%.

cs.LG↗

PAM: A Propagation-Based Model for Segmenting Any 3D Objects across Multi-Modal Medical Images

Volumetric segmentation is important in medical imaging, but current methods face challenges like requiring lots of manual annotations and being tailored to specific tasks, which limits their versatility. General segmentation models used for natural images don't perform well with the unique features of medical images. There's a strong need for an adaptable approach that can effectively handle different 3D medical structures and imaging modalities. In this study, we present PAM (Propagating Anything Model), a segmentation approach that uses a 2D prompt, like a bounding box or sketch, to create a complete 3D segmentation of medical image volumes. PAM works by modeling relationships between slices, maintaining information flow across the 3D structure. It combines a CNN-based UNet for processing within slices and a Transformer-based attention module for propagating information between slices, leading to better generalizability across various imaging modalities. PAM significantly outperformed existing models like MedSAM and SegVol, with an average improvement of over 18.1% in dice similarity coefficient (DSC) across 44 medical datasets and various object types. It also showed stable performance despite prompt deviations and different propagation setups, and faster inference speeds compared to other models. PAM's one-view prompt design made it more efficient, reducing interaction time by about 63.6% compared to two-view prompts. Thanks to its focus on structural relationships, PAM handled unseen and complex objects well, showing a unique ability to generalize to new situations. PAM represents an advancement in medical image segmentation, effectively reducing the need for extensive manual work and specialized training. Its adaptability makes it a promising tool for more automated and reliable analysis in clinical settings.

cs.CV↗

Physically Aware Synthesis Revisited: Guiding Technology Mapping with Primitive Logic Gate Placement

A typical VLSI design flow is divided into separated front-end logic synthesis and back-end physical design (PD) stages, which often require costly iterations between these stages to achieve design closure. Existing approaches face significant challenges, notably in utilizing feedback from physical metrics to better adapt and refine synthesis operations, and in establishing a unified and comprehensive metric. This paper introduces a new Primitive logic gate placement guided technology MAPping (PigMAP) framework to address these challenges. With approximating technology-independent spatial information, we develop a novel wirelength (WL) driven mapping algorithm to produce PD-friendly netlists. PigMAP is equipped with two schemes: a performance mode that focuses on optimizing the critical path WL to achieve high performance, and a power mode that aims to minimize the total WL, resulting in balanced power and performance outcomes. We evaluate our framework using the EPFL benchmark suites with ASAP7 technology, using the OpenROAD tool for place-and-route. Compared with OpenROAD flow scripts, performance mode reduces delay by 14% while increasing power consumption by only 6%. Meanwhile, power mode achieves a 3% improvement in delay and a 9% reduction in power consumption.

cs.LO↗

Some quaternary additive codes outperform linear counterparts

The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of the same lengths and dimensions. This paper focuses on constructing additive codes that outperform linear codes based on quasi-cyclic codes and combinatorial methods. Firstly, we propose a lower bound on the symplectic distance of 1-generator quasi-cyclic codes of index even. Secondly, we get many binary quasi-cyclic codes with large symplectic distances utilizing computer-supported combination and search methods, all of which correspond to good quaternary additive codes. Notably, some additive codes have greater distances than best-known quaternary linear codes in Grassl's code table (bounds on the minimum distance of quaternary linear codes http://www.codetables.de) for the same lengths and dimensions. Moreover, employing a combinatorial approach, we partially determine the parameters of optimal quaternary additive 3.5-dimensional codes with lengths from $28$ to $254$. Finally, as an extension, we also construct some good additive complementary dual codes with larger distances than the best-known quaternary linear complementary dual codes in the literature.

cs.IT↗

Thickness-dependent, tunable anomalous Hall effect in hydrogen-reduced PdCoO$_2$ thin films

It was recently reported that hydrogen-reduced PdCoO$_2$ films exhibit strong perpendicular magnetic anisotropy (PMA) with sign tunable anomalous Hall effect (AHE). Here, we provide extensive thickness-dependent study of this system, and show that the electronic and magnetic properties are strongly dependent on the thickness and annealing conditions. Below a critical thickness of 25 nm, AHE shows clear PMA with hysteresis, and its sign changes from positive to negative, and back to positive as the annealing temperature increases from 100 $^\circ$C to 400 $^\circ$C. Beyond the critical thickness, both PMA and AHE hysteresis disappear and the AHE sign remains positive regardless of the annealing parameters. Our results show that PMA may have a large role on AHE sign-tunability and that below the critical thickness, competition between different AHE mechanisms drives this sign change.

cond-mat.mtrl-sci↗

propnet: Propagating 2D Annotation to 3D Segmentation for Gastric Tumors on CT Scans

**Background:** Accurate 3D CT scan segmentation of gastric tumors is pivotal for diagnosis and treatment. The challenges lie in the irregular shapes, blurred boundaries of tumors, and the inefficiency of existing methods. **Purpose:** We conducted a study to introduce a model, utilizing human-guided knowledge and unique modules, to address the challenges of 3D tumor segmentation. **Methods:** We developed the PropNet framework, propagating radiologists' knowledge from 2D annotations to the entire 3D space. This model consists of a proposing stage for coarse segmentation and a refining stage for improved segmentation, using two-way branches for enhanced performance and an up-down strategy for efficiency. **Results:** With 98 patient scans for training and 30 for validation, our method achieves a significant agreement with manual annotation (Dice of 0.803) and improves efficiency. The performance is comparable in different scenarios and with various radiologists' annotations (Dice between 0.785 and 0.803). Moreover, the model shows improved prognostic prediction performance (C-index of 0.620 vs. 0.576) on an independent validation set of 42 patients with advanced gastric cancer. **Conclusions:** Our model generates accurate tumor segmentation efficiently and stably, improving prognostic performance and reducing high-throughput image reading workload. This model can accelerate the quantitative analysis of gastric tumors and enhance downstream task performance.

eess.IV↗

Factoring integers with sublinear resources on a superconducting quantum processor

Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstrate the algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm. Our study shows great promise in expediting the application of current noisy quantum computers, and paves the way to factor large integers of realistic cryptographic significance.

quant-ph↗

Anomalous Hall effect in electrolytically reduced PdCoO$_2$ thin films

PdCoO$_2$, being highly conductive and anisotropic, is a promising material for fundamental and technological applications. Recently, reduced PdCoO$_2$ thin films were shown to exhibit ferromagnetism after hydrogen annealing. Here, we demonstrate that when PdCoO$_2$ film is used as a cathode for dissociation of water, hydrogen generated around the film reduces the material and leads to the emergence of anomalous Hall effect (AHE). Moreover, we demonstrate that the sign of the AHE signal can also be changed with the electrolytic process. Electrolytically-modified PdCoO$_2$ films may open a door to applications in spintronics.

cond-mat.mtrl-sci↗

Effective reduction of PdCoO2 thin films via hydrogenation and sign tunable anomalous Hall effect

PdCoO2 , belonging to a family of triangular oxides called delafossite, is one of the most conducting oxides. Its in-plane conductivity is comparable to those of the best metals, and exhibits hydrodynamic electronic transport with extremely long mean free path at cryogenic temperatures. Nonetheless, it is nonmagnetic despite the presence of the cobalt ion. Here, we show that a mild hydrogenation process reduces PdCoO2 thin films to an atomically-mixed alloy of PdCo with strong out-of-plane ferromagnetism and sign-tunable anomalous Hall effect. Considering that many other compounds remain little affected under a similar hydrogenation condition, this discovery may provide a route to creating novel spintronic heterostructures combining strong ferromagnetism, involving oxides and other functional materials.

cond-mat.mtrl-sci↗

Learning to Check Contract Inconsistencies

Contract consistency is important in ensuring the legal validity of the contract. In many scenarios, a contract is written by filling the blanks in a precompiled form. Due to carelessness, two blanks that should be filled with the same (or different)content may be incorrectly filled with different (or same) content. This will result in the issue of contract inconsistencies, which may severely impair the legal validity of the contract. Traditional methods to address this issue mainly rely on manual contract review, which is labor-intensive and costly. In this work, we formulate a novel Contract Inconsistency Checking (CIC) problem, and design an end-to-end framework, called Pair-wise Blank Resolution (PBR), to solve the CIC problem with high accuracy. Our PBR model contains a novel BlankCoder to address the challenge of modeling meaningless blanks. BlankCoder adopts a two-stage attention mechanism that adequately associates a meaningless blank with its relevant descriptions while avoiding the incorporation of irrelevant context words. Experiments conducted on real-world datasets show the promising performance of our method with a balanced accuracy of 94.05% and an F1 score of 90.90% in the CIC problem.

cs.CL↗