Traditional approaches to semantic segmentation have treated the problem primarily as one of region classification, assigning a label to every pixel based on its appearance and context. Convolutional neural networks, and later transformer-based architectures, have become remarkably adept at recognizing what objects are present in a scene, but their ability to precisely delineate where one object ends and another begins has lagged behind. This is partly because standard cross-entropy loss functions, which dominate training procedures, treat all pixels equally regardless of their proximity to a boundary. A pixel deep inside a building rooftop contributes the same loss signal as a pixel sitting right at the edge between the roof and the adjacent street. As a result, networks can achieve high overall accuracy while systematically underperforming on the thin, structurally critical boundary regions that human observers use to judge segmentation quality.

The BTSR-Net framework addresses this imbalance by explicitly directing the network’s attention toward boundary neighborhoods and the spatial relationships between structures. Rather than treating boundaries as an afterthought to be cleaned up in post-processing, the architecture integrates boundary awareness into the core representation learning process. The Geometric Boundary-Distance Branch provides the network with a continuous spatial field that encodes how far each pixel lies from the nearest class transition, giving the model a geometric prior that helps it reason about where boundaries should fall even when local appearance cues are ambiguous. This kind of distance-based supervision has parallels in other areas of computer vision, where signed distance functions and boundary-aware losses have been used to sharpen edge predictions in medical imaging and natural scene understanding.

The multi-scale topology-guided structural fusion module tackles a complementary but equally important problem: maintaining the connectivity of elongated structures such as roads, rivers, and linear vegetation corridors. In remote sensing applications, a road that is correctly classified for 95 percent of its length but broken at a few critical junction points is far less useful than one that remains topologically connected throughout. Standard segmentation metrics like overall accuracy or even mean intersection-over-union do not fully capture this kind of topological failure, because a few disconnected pixels along a thin structure represent a vanishingly small fraction of total image area. The centerline Dice coefficient, or clDice, was developed specifically to measure how well tubular or elongated structures preserve their connectivity through segmentation, and its use in this study reflects a growing recognition within the remote sensing community that structural integrity matters as much as pixel-level accuracy for many downstream applications.

The dual-stream structural refinement mechanism represents a further layer of sophistication in the architecture. By confining residual corrections to a narrow band defined by the boundary-distance field, the refinement process avoids the risk of degrading already well-classified interior regions while focusing computational capacity precisely where errors are most likely and most consequential. This targeted approach echoes broader trends in deep learning toward sparse or attention-guided computation, where resources are concentrated on the most informative parts of the input rather than distributed uniformly. In the context of remote sensing, where images can be extremely large and computational efficiency is a practical concern, such selective refinement offers both accuracy and efficiency benefits.

The choice of HRNet-OCR as the backbone architecture is noteworthy in itself. HRNet maintains high-resolution representations throughout the network rather than progressively downsampling and then upsampling as many earlier architectures did, which helps preserve fine spatial detail that is essential for boundary delineation. The object-contextual representation component, originally proposed to model the semantic context of pixels by relating them to object regions rather than just local neighborhoods, adds a layer of global reasoning that helps disambiguate visually similar but semantically distinct areas. Combining these established components with the novel boundary and topology modules allows BTSR-Net to build on proven foundations while introducing targeted innovations where they are most needed.

The ISPRS Potsdam and Vaihingen datasets on which the method was evaluated are among the most widely used benchmarks in the remote sensing segmentation community, which makes the reported improvements directly comparable to a large body of prior work. Potsdam, with its dense historic urban fabric, red-roofed buildings, and complex road networks, presents particular challenges for boundary delineation because many structures share similar spectral signatures with their surroundings. Vaihingen, while also urban, features a somewhat different mix of building types, vegetation patterns, and impervious surfaces, providing a complementary test of generalization. The fact that BTSR-Net shows consistent gains across both datasets, rather than overfitting to the characteristics of one scene type, strengthens the case that the underlying design principles are broadly applicable.

The magnitude of the improvement in boundary-specific metrics deserves particular attention. On Vaihingen, the boundary intersection-over-union improved by 9.39 percentage points over the baseline, which is a substantial margin in a field where incremental gains of one or two points are often considered meaningful. This suggests that the explicit boundary-distance supervision is not merely a marginal refinement but addresses a genuine weakness in how standard architectures handle class transitions. Similarly, the connectivity improvements measured by clDice indicate that the topology-guided fusion module successfully preserves the structural relationships that matter for applications such as road network extraction, where a segmented road map must be navigable and topologically sound to be useful.

Looking at the broader context of remote sensing research, the emphasis on structure-aware segmentation reflects a maturation of the field. Early deep learning approaches to remote sensing largely imported architectures designed for natural images, achieving impressive but sometimes brittle results when applied to the unique characteristics of overhead imagery. Over time, researchers have developed increasingly specialized components that account for the particular challenges of aerial perspectives: the absence of a canonical viewing direction, the prevalence of repetitive textures, the importance of geometric relationships between objects, and the need to reason about structures that span large spatial extents. BTSR-Net’s combination of boundary awareness, topological guidance, and targeted refinement fits squarely within this trend toward domain-specific architectural innovation.

The practical implications of improved boundary and topology segmentation extend across numerous domains. In urban planning, accurate delineation of building footprints and road networks supports infrastructure assessment, property valuation, and growth modeling. In disaster response, rapidly generated and structurally reliable maps of damaged areas can guide emergency operations, where a road network that is incorrectly segmented as connected when it is actually severed could have serious consequences. In environmental monitoring, the connectivity of vegetation corridors and water bodies affects ecological assessments of habitat fragmentation and hydrological flow. In each of these cases, the quality of the segmentation output directly conditions the quality of decisions made downstream, making boundary fidelity and topological correctness not merely aesthetic concerns but functional requirements.

The computational architecture of BTSR-Net also raises interesting questions about the relationship between model complexity and interpretability. By introducing explicit geometric quantities such as boundary distance into the training objective, the method creates intermediate representations that have clear physical meaning, which can aid in understanding why the network makes particular predictions. This contrasts with purely end-to-end approaches where the internal representations remain opaque. For practitioners who need to diagnose failure cases or justify model outputs to stakeholders, having a network component that explicitly encodes distance-to-boundary provides a useful handle for interpretation and debugging.

Training such a model effectively requires careful consideration of how the different loss terms interact. The joint boundary-distance supervision must be balanced against the primary segmentation loss so that the network learns to prioritize boundary accuracy without sacrificing overall region classification. The refinement narrow-band must be wide enough to capture the full extent of boundary ambiguity but narrow enough to avoid unnecessary computation on well-classified areas. These hyperparameter choices, while not always highlighted in architectural descriptions, often determine whether a theoretically sound design translates into practical performance gains. The reported results suggest that the authors navigated these trade-offs successfully, though the sensitivity of performance to these choices remains an area where further ablation studies could provide additional insight.

The broader research community’s growing interest in boundary-aware and topology-aware segmentation is evident across multiple subfields. In medical imaging, where delineating organ boundaries and vascular networks is critical for diagnosis and treatment planning, similar principles of distance-based supervision and connectivity preservation have been developed in parallel. In autonomous driving, lane detection and road segmentation face analogous challenges in maintaining the continuity of thin structures under occlusion and lighting variation. The cross-pollination of ideas between these domains suggests that methods like BTSR-Net, which draw on concepts from multiple areas, may point toward increasingly unified approaches to structure-sensitive segmentation that transcend any single application domain.

As remote sensing data continues to grow in volume, resolution, and availability, the demand for segmentation methods that produce not just accurate but structurally meaningful outputs will only intensify. High-resolution imagery from commercial satellite constellations, drone surveys, and aerial campaigns is being generated at rates that far exceed manual annotation capacity, making automated segmentation the only scalable path to extracting actionable information. In this context, improvements in boundary quality and structural connectivity translate directly into reduced manual correction effort and more reliable downstream analysis. The work represented by BTSR-Net contributes to this broader effort by demonstrating that explicit geometric and topological reasoning, integrated into the architecture and training process, can yield measurable and meaningful improvements on standard benchmarks while remaining grounded in the practical realities of urban scene understanding.

Future directions for this line of research may include extending the boundary-distance framework to handle more complex topological structures such as intersections, loops, and branching networks, where simple connectivity metrics may not fully capture the structural relationships that matter. The integration of temporal information, using multi-date imagery to track how boundaries and structures change over time, could further enhance the utility of structure-aware segmentation for monitoring applications. Additionally, exploring how these refinement mechanisms perform across different sensor modalities, including synthetic aperture radar and hyperspectral imagery, would test the generality of the underlying principles. As the field continues to evolve, the combination of geometric priors, topological constraints, and targeted refinement exemplified by this work is likely to remain a productive direction for advancing the state of the art in remote sensing image analysis.

Subject of Research: Boundary and topology guided structural refinement for high-resolution remote sensing image segmentation

Article Title: BTSR-Net: Boundary–topology guided structural refinement for high-resolution remote sensing image segmentation

Article References: Wang, Z., Wang, W., Hu, Z., Li, Y., & Ma, K. (2026). BTSR-Net: Boundary–topology guided structural refinement for high-resolution remote sensing image segmentation. PLOS One, 21(10), e0360524. https://doi.org/10.1371/journal.pone.0360524

Image Credits: AI Generated

DOI: 10.1371/journal.pone.0360524

Keywords: remote sensing, semantic segmentation, deep learning, BTSR-Net, boundary detection, topology, HRNet-OCR, ISPRS Potsdam, ISPRS Vaihingen, urban mapping, clDice, structural connectivity

The central challenge the researchers set out to solve is a familiar one in battery materials science. Graphite, the standard anode in commercial lithium-ion batteries, stores lithium ions between flat sheets of carbon, and its performance at very high charge rates is limited by how quickly ions can diffuse into the bulk of the material. Three-dimensional graphene — a porous, interconnected network of graphene sheets — has long been considered a promising alternative because it combines high electrical conductivity with an open framework that ions can access from many directions. But making 3D graphene is only half the battle. Its macroscopic shape, whether it forms granules, plates, or a continuous honeycomb, and its microscopic surface texture, particularly the abundance of tiny micropores, both strongly influence how fast lithium ions can reach the storage sites and how efficiently electrons can travel through the electrode. Until now, tuning these two features at different length scales has required multiple, often incompatible, processing steps.

The team’s solution is a metallothermic reduction strategy, in which a reactive metal strips the oxygen from CO2, leaving elemental carbon behind. The trick is that the choice of metal reductant — sodium, potassium, or magnesium — does more than simply liberate the carbon. It dictates the entire architecture of the resulting graphene. With magnesium as the reductant, the carbon condenses into a granulated structure. With potassium, it forms plate-like sheets. But with sodium, the reaction produces something far more interesting: a three-dimensional interconnected honeycomb framework, in which graphene walls branch and merge into a continuous conductive skeleton riddled with pores at the nanometre scale. In other words, simply swapping one alkali metal for another transforms the final material from a collection of particles into a fully connected, sponge-like network.

The sodium-derived honeycomb graphene, which the authors call Na-3DG, is the star of the study. It has a specific surface area of 765.5 square metres per gram — a vast internal area packed into a small mass — and, remarkably, 84.9 percent of its pore volume is in the micropore range, the smallest class of pores. This is unusual because most porous carbons distribute their pore sizes across a broad spectrum, mixing micropores with larger mesopores and macropores. Here, the micropores dominate, and that dominance turns out to be the key to the material’s ultrafast lithium storage. Micropores act as short-range windows through which lithium ions can penetrate the electrode surface directly, rather than having to snake their way through long, tortuous channels. The result is a dramatic reduction in the distance ions must travel and, consequently, in the time it takes to charge and discharge the cell.

But porosity alone is not enough. If the carbon network were interrupted — if the graphene sheets were broken, poorly connected, or contaminated with defects — electrons could not move quickly enough to keep up with the incoming ions, and the electrode would fail at high rates. To verify that the sodium route produces a truly continuous conductive network, the researchers turned to X-ray photoelectron spectroscopy, which probes the chemical bonding of the carbon atoms, and to four-probe conductivity measurements, which directly measure how well the material conducts electricity. The spectroscopy showed that Na-3DG retains a highly continuous network of sp2-hybridized carbon — the same bonding motif that gives pristine graphene its exceptional electron mobility. The conductivity measurements confirmed this: the intrinsic electrical conductivity of the material is 16.4 siemens per centimetre, a high value for a porous carbon. Electrochemical impedance spectroscopy, which measures the resistance a battery cell presents to alternating current, revealed a series resistance of just 1.8 ohms and a charge-transfer resistance of 70.9 ohms, both low figures that indicate electrons and ions can move through the electrode with minimal obstruction.

The researchers attribute the material’s exceptional performance to a synergistic effect between two structural features that work together rather than in isolation. The continuous three-dimensional conductive skeleton minimizes what is known as interparticle contact resistance — the electrical resistance that arises where separate particles of an electrode material touch one another. In conventional electrodes made of discrete particles, electrons must hop from particle to particle, and each junction adds resistance. In Na-3DG, because the graphene network is continuous, electrons can travel along uninterrupted pathways. Meanwhile, the abundant surface micropores provide short-range ion-penetration windows, allowing lithium ions to access the carbon surface from many directions at once. The combination — fast electron transport through a connected skeleton and fast ion transport through a microporous surface — is what enables the material to sustain such extreme charge rates without collapsing.

The electrochemical results bear this out. When tested as the anode in a lithium-ion half-cell, Na-3DG delivered more than 200 mAh per gram at a rate of 150C. To put that in perspective, a rate of 150C means the battery would be fully discharged in about 24 seconds — an extraordinary figure for any anode material, and one that approaches the limits of what ion transport physics allows. At a more moderate rate of 50C, the material retained 88.9 percent of its first-cycle capacity after 2,000 charge-discharge cycles, demonstrating not only speed but also durability. Long-term cycling stability is often the Achilles heel of high-rate anodes, because repeated insertion and removal of lithium ions can mechanically stress the material and degrade its structure. The fact that Na-3DG holds up over thousands of cycles suggests that its honeycomb framework is robust enough to accommodate the strain.

Beyond its immediate performance, the study carries a broader significance for how we think about carbon materials and the carbon cycle. The starting material is CO2 — a waste product and a greenhouse gas — and the product is a high-value carbon material with a precisely engineered structure. The authors describe this as a strategy for upcycling CO2 into hierarchical porous carbon, a term that captures the idea of transforming a low-value molecule into a material with sophisticated, multi-scale architecture. This is not the first time CO2 has been converted into graphene; previous work by some of the same researchers and by other groups has explored metallothermic and plasma-based routes. But the new study is distinguished by the degree of control it offers: by simply changing the metal reductant, the macroscopic morphology can be continuously tuned from granulated to plate-like to honeycomb, all within a single reaction. That level of morphological control, achieved in one step, is rare in materials synthesis and points toward a more general design principle for porous carbons.

The work also contributes to a growing body of research on fast-charging lithium-ion batteries, a field that has become one of the most active in energy storage science. Fast charging is widely seen as a critical enabler for electric vehicles, because the time it takes to recharge remains a major barrier to widespread adoption. The bottleneck, however, is not the battery’s total capacity but its ability to accept lithium ions quickly without triggering unwanted side reactions, such as lithium plating on the anode, which can degrade the cell and pose safety risks. Anode materials that can accommodate rapid ion insertion — like the honeycomb graphene described here — are therefore central to the fast-charging agenda. The study’s structural design principles, particularly the synergy between a continuous conductive skeleton and abundant surface micropores, offer a template that other researchers can apply to different carbon architectures and even to non-carbon materials.

For now, the material remains a laboratory demonstration, and translating it into commercial batteries will require scaling up the synthesis, integrating it into full cells with compatible cathodes and electrolytes, and validating its performance under realistic operating conditions. But the study’s message is clear and, in its own way, striking: the same molecule that drives climate change can be chemically reimagined as the backbone of a next-generation battery, provided the architecture is designed with the same care as the chemistry itself. By showing that a single reaction, guided by the choice of a metal reductant, can produce a 3D graphene with a honeycomb topology, an overwhelming micropore fraction, and a continuous sp2 carbon network, the researchers have not only advanced the state of the art in anode materials — they have also offered a glimpse of a future in which carbon capture and energy storage are not separate endeavours but two sides of the same molecular coin.

Subject of Research: Synergistic tuning of topology and microporosity in 3D graphene via direct CO2 conversion for ultrafast lithium storage

Article Title: Synergistic tuning of topology and microporosity in 3D graphene via direct CO2 conversion for ultrafast lithium storage

Article References: Wang, L., Wang, X., Wu, X., Luo, J., Liu, M., & Toan, S. (2026). Synergistic tuning of topology and microporosity in 3D graphene via direct CO2 conversion for ultrafast lithium storage. Ionics. https://doi.org/10.1007/s11581-026-07593-x

Image Credits: AI Generated

DOI: 10.1007/s11581-026-07593-x

Keywords: Synergistic, tuning, topology, microporosity, graphene, direct, conversion, ultrafast, lithium, storage, scientific research

The team, led by researchers from Bohai University, Foshan University, Shenzhen Polytechnic University, and Zhejiang University, focused on particle-reinforced metal matrix composites, or PRMMCs, in which silicon carbide particles strengthen a 6061 aluminum matrix. These materials are prized because the hard ceramic carries load while the ductile metal absorbs energy, but their mechanical response has always been complicated by the fact that particles rarely distribute uniformly during processing. Clusters, particle-depleted zones, and quasi-cellular patterns emerge naturally, and the study set out to clarify how this heterogeneity governs deformation and failure.

Using two-dimensional mesoscale finite element models, the researchers built virtual composites that all contained the same global silicon carbide volume fraction but featured distinct cellular architectures. By systematically varying the local particle concentration within reinforcement-rich regions and the connectivity between those regions, they isolated the effects of heterogeneity on stress transfer, strain localization, crack initiation, and crack propagation. The approach allowed them to decouple two factors that are usually entangled in real materials: how much ceramic sits in a given neighborhood, and whether the ceramic-rich zones form a continuous network across the sample.

The simulations produced a striking result about strength. Moderate localization of silicon carbide particles actually improved tensile strength by increasing the efficiency of stress transfer from the ductile aluminum matrix to the stiff ceramic reinforcement. When particles concentrate moderately, load flows more directly into the hard phase, allowing the composite to carry more force before yielding. However, the benefit has a sharp limit. When localization becomes excessive and the particle-rich regions lose their connections to one another, the macroscopic load-bearing capability deteriorates. A fragmented architecture cannot distribute stress across the sample, and the composite fails at loads it would otherwise sustain.

Perhaps the most important finding is that damage initiation and crack propagation are controlled by different aspects of the topology. Local silicon carbide concentration primarily determines where and when damage begins, because mismatched deformation between particle-rich and particle-poor zones intensifies strain incompatibility. The stiffer particle-rich regions deform less than the surrounding matrix, generating localized stress concentrations that nucleate cracks. In contrast, the connectivity of the reinforcement network governs what happens after a crack forms, dictating whether the fracture races through the material or is deflected into a more tortuous, energy-absorbing path.

This division of labor has direct consequences for design. A continuous particle-rich framework promotes efficient load transfer across the entire sample, boosting strength, but it also provides a highway for cracks: once damage initiates, the fracture propagates rapidly along the connected particle-rich network. A disconnected network behaves in the opposite manner. It enhances crack deflection, forcing fractures to change direction and dissipate energy, which improves damage tolerance, but the lack of continuity reduces strengthening efficiency because load cannot flow as effectively into the ceramic phase.

The study establishes a topology-based design principle for heterogeneous silicon carbide-aluminum composites, emphasizing that reinforcement connectivity is essential for achieving a favorable balance between strength and damage tolerance. Rather than tuning only the global volume fraction, engineers should think about the architecture of the particle distribution as a separate design variable. The ideal composite would combine moderate particle localization for efficient stress transfer with enough network continuity to distribute load, while retaining sufficient architectural complexity to deflect cracks once they form.

The mesoscale finite element approach is significant because it bridges the gap between microscopic models of individual particles and macroscopic models of entire components. At the mesoscale, researchers can resolve the actual arrangement of reinforcement clusters and capture the cellular patterns that emerge during composite processing, while still simulating enough material to observe realistic crack paths. This scale is where heterogeneity matters most, and the new findings demonstrate that ignoring it can lead to serious mispredictions of composite performance.

For the broader materials community, the work reframes heterogeneity from a processing nuisance into a design opportunity. The same mechanisms that cause failure in poorly arranged composites can be exploited to create materials that are simultaneously strong and damage-tolerant. By controlling the local concentration and connectivity of reinforcement during manufacturing, whether through stir casting, powder metallurgy, or additive processing, it may be possible to engineer particle architectures that deliver the best of both regimes. The research suggests that the next generation of ceramic-metal composites will be designed not by adding more ceramic, but by arranging it more intelligently.

Subject of Research: Topology-mediated deformation and failure mechanisms in heterogeneous cellular SiCp/Al composites analyzed by mesoscale finite element simulation

Article Title: Topology-mediated deformation and failure mechanisms in heterogeneous cellular SiCp/Al composites revealed by mesoscale finite element analysis

Article References: Chen, H., Zheng, Z., Yuan, B., Ma, S., Wang, L., Gong, B., Ouyang, W., Chen, D., Liu, C., & Gao, X. (2026). Topology-mediated deformation and failure mechanisms in heterogeneous cellular SiCp/Al composites revealed by mesoscale finite element analysis. Frontiers in Materials, 13, Article 1961834. https://doi.org/10.3389/fmats.2026.1961834

Image Credits: AI Generated

DOI: 10.3389/fmats.2026.1961834

Keywords: metal matrix composites, silicon carbide, finite element analysis, crack propagation, topology, damage tolerance, 6061Al, heterogeneous microstructure, Topology-mediated, deformation, failure, mechanisms

The research, published in Frontiers in Network Physiology by Arthur S. Bezerra, Robin Van Den Abeele, Nele Vandersickel and colleagues, builds on a deceptively simple mathematical observation. When the atrium is treated as a two-dimensional surface, every propagating wavefront must take one of exactly two geometric forms. It is either an open wave, a line-like segment whose two endpoints are anchored to boundaries such as valves, veins, scars or temporarily refractory tissue, or a closed wave, a ring-like structure that encloses a region of tissue and has no endpoints at all. The distinction echoes a theorem first articulated by Norbert Wiener and Arturo Rosenblueth in 1946, but the new work extends it into a complete dynamical framework for atrial fibrillation.

The crucial insight is that these two wave archetypes behave in fundamentally opposite ways. Open waves, the authors show, tend to self-perpetuate: as long as their endpoints remain attached to boundaries, the wave keeps circulating and can sustain reentrant activity indefinitely. Closed waves, by contrast, tend toward self-termination. On a surface topologically equivalent to a sphere, an expanding closed wave must eventually run out of excitable tissue, transition into a shrinking wave, and collapse. The sino-atrial node’s normal heartbeat pulse is itself a closed wave of this kind, expanding through the atrium before dying out.

From this dichotomy, the team derived a remarkably compact set of rules. Every interaction between wavefronts, obstacles and boundaries in their simulations reduced to just five elementary events: open wave creation, open wave annihilation, closed wave creation, closed wave annihilation, and open wave collision. When a closed wave strikes an obstacle and breaks, an open wave is born. When two open waves merge end to end, an open wave is annihilated. When the two endpoints of a single open wave meet, the wave closes into a ring. And when two open waves collide head-on, they pass through one another, producing two new open waves without changing the total count. More complicated-looking interactions, the authors found, are simply combinations of these five primitives occurring in quick succession.

To test whether this tidy taxonomy survives contact with biological realism, the researchers analyzed a cohort of 600 patient-specific atrial fibrillation simulations. The models were built from publicly available three-dimensional atrial meshes of 100 patients with fibrillation, incorporating realistic fibrosis maps derived from late gadolinium-enhanced MRI and patient-specific fiber orientations. Using the openCARP simulation environment and the Courtemanche ionic model with atrial fibrillation remodeling, the team simulated six different initiation conditions per mesh, each running for 3400 milliseconds, with conduction velocity reduced in fibrotic regions in proportion to MRI intensity.

Detecting and classifying hundreds of thousands of wavefronts required a purpose-built algorithm. The team used an extended phase-mapping approach that first computes the phase of the transmembrane voltage at every mesh vertex, then explicitly identifies phase defects, the discontinuities caused by functional block and fibrosis, and removes them from the rotation calculation. Triangles carrying phase jumps in opposite directions were clustered into connected components representing individual wavefronts, and end-triangles touching phase defects served as discrete equivalents of wave endpoints. Each endpoint was assigned a chirality, clockwise or counterclockwise, and wavefronts with exactly two oppositely charged endpoints were tagged as open waves, while those with none were tagged as closed waves.

The results were striking in their consistency. Across all simulations, the algorithm detected 804,085 open waves and 51,039 closed waves, and every single open wave contained exactly two endpoints with opposite chirality, while every closed wave contained none. Tracking the wavefronts over time yielded 132,870 interaction subgraphs containing 274,461 events, with creation and annihilation events each accounting for 45 percent of the total and open wave collisions making up the remaining 9 percent. Critically, when the researchers computed the total topological index, the net rotational charge, at every moment in every simulation, it summed to exactly zero, in perfect agreement with the index theorem that requires counter-rotating pairs on closed surfaces.

The framework’s most dramatic payoff came in the form of a virtual ablation strategy. Because open waves are the self-perpetuating elements that keep fibrillation alive, the team designed an intervention to convert every open wave in the tissue into a closed wave. At three different time points during each simulation, they identified all phase defects and all open waves, then drew instantaneous virtual ablation lines connecting the endpoints of each open wave just ahead of its advancing wavefront, using an A* pathfinding algorithm whose cost function steered the lines through regions of low phase to maximize the chance of intercepting propagation. Of 1,475 ablation procedures performed across the cohort, every single one terminated the arrhythmia, producing complete electrical silence before the end of the simulation window, a 100 percent success rate. The median procedure required only two ablation lines, and the average required the elimination of just over three open waves.

The authors are careful to note what this result does and does not mean. The virtual ablation is not practically implementable as such, since it demands the instantaneous creation of continuous lesion lines that precisely block dynamically moving wavefronts, something no catheter can currently achieve. The team also did not test whether the hearts would remain non-inducible after the intervention; because the strategy was designed only to terminate fibrillation at a moment in time, there is no reason to expect that new induction would not restart the arrhythmia. Instead, the researchers suggest a more realistic translational path: using the wave-detection algorithm during burst pacing with high-density mapping to identify substrate regions prone to generating non-recombining open waves, and targeting those areas prophylactically.

Even with those caveats, the conceptual contribution is substantial. The open-and-closed wave framework reconciles the field’s long-standing competing theories under a single umbrella: the multiple wavelet hypothesis, the mother rotor hypothesis, meandering rotors, and focal sources all emerge as particular dynamic manifestations of open waves constrained by different kinds of boundaries. It also connects to recent work on topological defibrillation, including the so-called teleportation method in which precisely timed stimuli force spiral wave endpoints together to trigger annihilation, and to statistical-physics analogies comparing fibrillation to unbound vortex states. If the framework holds up in experimental and clinical settings, the chaotic electrical storm of atrial fibrillation may turn out to be governed by a handful of rules simple enough to write on a napkin, and simple enough, perhaps, to beat.

Subject of Research: Topological classification of atrial wavefronts and topology-guided ablation for terminating atrial fibrillation in patient-specific simulations

Article Title: Open wavefront ablation terminates rotor-driven atrial fibrillation

Article References: Bezerra, A. S., Van Den Abeele, R., Van Landeghem, B., Verstraeten, B., Lootens, S., Van Nieuwenhuize, V., Hendrickx, S., Segers, V. F. M., Duytschaever, M., & Vandersickel, N. (2026). Open wavefront ablation terminates rotor-driven atrial fibrillation. Frontiers in Network Physiology, 6, Article 1940428. https://doi.org/10.3389/fnetp.2026.1940428

Image Credits: AI Generated

DOI: 10.3389/fnetp.2026.1940428

Keywords: atrial fibrillation, cardiac electrophysiology, topology, wavefront dynamics, ablation, rotors, phase mapping, computational modeling, index theorem, reentry, open waves, closed waves

The challenge the team set out to solve lies at the heart of a growing research effort in structured light. Light can be sculpted into specially shaped spatial patterns, much as letters combine to form words, and each distinct pattern can in principle encode a symbol in an optical communications alphabet. The larger the alphabet, the more information each pulse of light can carry. But there is a catch that has long frustrated researchers: these patterns do not necessarily keep their appearance as they travel. Distortions, turbulence and the physics of propagation can change how a structured beam looks while leaving its underlying identity intact. A receiver that relies on matching the exact appearance of a pattern can therefore fail even when the message itself has survived the journey perfectly well.

The Wits team’s insight was to stop reading the pattern’s appearance and start reading its topology instead. Nape offers an intuitive analogy: imagine a ribbon that has been twisted a certain number of times. If you bend and fold that ribbon into many different shapes, the number of twists remains unchanged no matter what the ribbon looks like. Light can carry analogous hidden features, robust quantities that persist even as the visible structure of the beam is transformed. These topological properties behave like a fingerprint that survives distortion, which makes them attractive carriers of information for any communication system that must operate in the imperfect, noisy real world rather than on a pristine laboratory bench.

Reading topology directly, however, is not straightforward. The conventional approach would be to capture a detailed image of the light pattern and analyse thousands of individual points to infer the hidden quantity, a process that demands heavy computation and introduces delays that undermine the speed advantage of using structured light in the first place. As Nape puts it, creating light patterns that form large alphabets for communications is only useful if they can be read as fast as they can be created. The new system addresses this by embedding the recognition task into the light itself, so that the measurement happens optically, in a single pass, rather than digitally, after the fact.

Technically, the light-powered brain works by passing the incoming structured beam through specially designed layers that transform and direct the light towards an array of detectors. The layers act like the weights of a neural network, but implemented physically in optics rather than in software running on silicon. Where the light lands on the detectors reveals the information it carries. Instead of mapping every crease in what the researchers call the fabric of light to count the twists, the network picks out the features that matter and identifies the topology quickly. Bezuidenhout, who is now an optics engineer at APSI, describes the approach as a simpler way to extract the needed information without first taking a detailed picture, allowing unusual light structures to serve as practical carriers of information for future communication systems.

The training procedure highlights how remarkably efficient the scheme is. The team trained the system on just 15 examples, after which it successfully recognised 81 different light structures within the family studied, including patterns it had never encountered before. That generalisation from a handful of training cases to a much larger set of unseen patterns is the kind of behaviour usually associated with machine learning systems, and here it emerges from the interplay between the physical design of the optical layers and the mathematical structure of the light fields themselves. The result is a classifier that runs at the speed of light, because the classification is performed by light propagating through the layers rather than by a processor crunching pixel data.

Robustness under real-world conditions was a second key test. When the researchers deliberately introduced noise into the detector, the system continued to work, correctly reading out the information despite the degraded measurements. This resilience matters enormously for practical deployment, because any future communication receiver will face imperfect detectors, background light and fluctuating channel conditions. A measurement scheme that only functions in idealised settings would be of limited use; one that tolerates noise brings structured-light communications a step closer to being engineered into working systems, whether for classical high-capacity links or for the quantum communication networks that many laboratories around the world are now trying to build.

The research is also a showcase for interdisciplinary science, combining Wits University’s strengths in artificial intelligence and quantum science, two fields in which the institution leads on the African continent. Professor Benjamin Rosman, Director of the Wits Machine Intelligence and Neural Discovery (MIND) Institute, notes that the work is a wonderful example of what becomes possible when ideas from artificial intelligence and fundamental physics are brought together. By embedding neural network principles directly into the behaviour of light, he says, the team is opening up new possibilities for how information is processed, and the result demonstrates the potential of interdisciplinary research, which is central to what the MIND Institute is building.

For Forbes, who directs the South African Quantum Technology Initiative (SA QuTI) and WitsQ, the breakthrough addresses a major bottleneck on the road to future communications technologies. At the Structured Light Laboratory, researchers are exploring how topology could support a future quantum and classical internet, but creating these light structures is only part of the challenge. Practical ways to read them are equally essential, and that measurement toolbox, as Forbes describes it, is still taking shape. The new work shows how reaching beyond photonics, in this case by borrowing ideas from machine intelligence, can help build that toolbox. It is a reminder that progress in optical communications often depends as much on better measurement as on better sources of structured light.

The team sees the light-powered brain as a beginning rather than an endpoint. Nape, who is the Optica Emerging Leader in Optics Chair and a MIND Institute Fellow as well as being affiliated with the laboratory, says the researchers hope to explore how optical intelligence can contribute to quantum technologies in South Africa. Extracting information from individual particles of light presents even greater measurement challenges than working with full beams, and the group is excited to investigate whether these tools can help tackle them. If they succeed, the same principle demonstrated here, that a physical system can be trained to recognise what matters in a signal without exhaustively measuring it, could shape how future quantum networks, sensors and communication systems extract meaning from light itself.

Subject of Research: Optical neural networks for reading topological information in structured light for communications

Article Title: Wits scientists create ‘light-powered brain’ that could transform future communications

Article References: Wits scientists create ‘light-powered brain’ that could transform future communications. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: structured light, optical neural network, topology, light-powered computing, quantum technology, communications, University of the Witwatersrand, Nature Communications, photonics, machine learning, information encoding, measurement

The core idea is deceptively simple. Where the classic cube relies on intricate spatial axis layouts and intersecting revolute joints, the PPRCM replaces rotation with pure translation. Its rigid components slide along grooves machined into a flat base, arranged in a grid reminiscent of the sliding-tile puzzles that have entertained generations. The researchers point out that this planar constraint is a genuine engineering advantage: planar mechanisms are far easier to actuate, analyze, and manufacture than their spatial counterparts, because theoretical derivation and numerical calculation are dramatically simplified when all motion happens in two dimensions.

The team built their theory around a physical prototype, also rendered as a three-dimensional printed model, consisting of a base and three distinct moving modules. The base carries uniformly distributed grooves along two perpendicular directions, allowing the modules to translate along either axis. The design borrows from an unexpectedly ancient source: the tenon-and-mortise joints of traditional Chinese woodworking, which inspired the groove-and-pin interlocking scheme that dynamically connects modules to the base. Six moving paths run along each direction, giving the mechanism a rich lattice of possible trajectories.

Each moving module is itself a layered assembly. It contains a moving block together with moving-block side pieces, or MBSPs, fitted with clamping pins that keep the assembly engaged in the base grooves during translation. The side pieces also carry their own internal grooves, which lock the moving block onto them when it slides along the horizontal direction. This creates three distinct motion modes: a module can translate along one axis, along the perpendicular axis, or the inner block can slide along the horizontal direction on top of its own side pieces. Because the contact surfaces differ between the first two modes and the third, the third mode offers the richest design possibilities, and the researchers chose it as the focus of their theoretical analysis.

That analysis centers on a concept the authors call the prismatic-pair contact surface, or PPCS. A prismatic pair is the fundamental sliding joint of mechanism theory, permitting exactly one translational degree of freedom between two components. The PPCS is the direct contact area between those components, and because it is generated by extruding a two-dimensional profile along the direction of motion, it can be uniquely described by a single profile equation in a cross-sectional coordinate system. The researchers classify these surfaces as symmetric or asymmetric depending on whether a plane of symmetry parallel to the motion exists, and they restrict their formal treatment to the symmetric case for clarity.

From this foundation, the team derived the conditions under which components can actually swap positions and reconfigure the mechanism. Three rules emerge. First, components must share identical movement slopes, meaning only parts translating along the same axis are mutually interchangeable. Second, the contact surfaces must satisfy an inclusivity requirement: a moving component can slide on a fixed component only if the fixed component’s profile contains the mover’s profile, a relationship the authors express mathematically and prove to be transitive. Third, the mechanism must contain at least two intersecting movement directions, because with only one direction all motion is parallel and no component can ever move in two ways, which would make reconfiguration impossible.

These conditions feed directly into the paper’s central contribution: a type synthesis method for the PPRCM. Type synthesis is the branch of mechanism theory concerned with enumerating the structural forms a machine can take, independent of its exact dimensions. The method proceeds in four steps: choose the number of movement directions, choose how many parallel moving paths exist in each direction, choose the types of contact surfaces in each direction, and finally design a base on which all movable components can be placed. Because these three factors, direction count, path count, and surface type, fully determine the mechanism’s topology, specifying their values generates a complete family of distinct PPRCM designs.

To demonstrate the method’s power, the authors worked through systematic case studies. They generated configurations with two, three, and even four different movement slopes, including versions whose directions are not perpendicular but angled at 45 degrees, showing that the theory accommodates non-orthogonal grids. They varied the number of moving paths per direction from two up to six, and they swapped in different sets of contact-surface profiles with different inclusivity hierarchies. For every synthesized configuration, corresponding three-dimensional models were constructed to validate that the designs are geometrically rational and mechanically effective, confirming that the method reliably produces working reconfigurable mechanisms rather than paper abstractions.

The significance extends well beyond puzzle-inspired novelty. Rubik’s cube mechanisms have already been combined with origami structures, deployable space hardware, and modular robots, and cube-inspired mathematics underpins image encryption schemes, biometric template protection, microfluidic devices, and even deep-learning architectures that exploit the cube’s group structure. A planar version with a rigorous synthesis theory gives engineers a tractable starting point: it simplifies the cognitive and analytical difficulty of complex reconfigurable mechanisms and lays a foundation for extending the approach to fully three-dimensional spatial designs. Because reconfigurable machinery is central to deformable structures, adaptable robots, and variable working scenarios, a systematic recipe for generating new configurations is a valuable tool.

The authors also situate their work in a long intellectual lineage. Planar type synthesis has evolved from designers’ intuition into formal methods based on kinematic chain enumeration, finite group theory, Assur groups, matrix representations, and, more recently, neural-network and big-data approaches. Yet none of these established methods transfers directly to Rubik’s cube mechanisms, whose unique sliding, interlocking, and position-swapping behavior demands new theory. The PPRCM framework also echoes much older ideas about rearrangement: the authors trace the concept back to Luo Shu, the ancient Chinese symbolic numerical pattern embodying transformation and rearrangement, and to sliding puzzles such as the eight-digit game and the fifteen-puzzle, which are, in mechanism terms, planar prismatic systems. By formalizing what those puzzles do intuitively, the study enriches planar mechanism theory and opens a path toward a new generation of flat, reconfigurable machines whose configurations can be counted, predicted, and designed on demand.

Subject of Research: Reconfigurable kinematic analysis and type synthesis of planar prismatic Rubik's cube mechanisms

Article Title: Research on reconfigurable kinematic analysis and type synthesis of planar prismatic Rubik's cube mechanism

Article References: Fan, D., Zeng, D., Zhao, Y., Feng, H., Deng, Y., & Liu, Y. (2026). Research on reconfigurable kinematic analysis and type synthesis of planar prismatic Rubik's cube mechanism. Mechanical Sciences, 17(2), 813-823. https://doi.org/10.5194/ms-17-813-2026

Image Credits: AI Generated

DOI: 10.5194/ms-17-813-2026

Keywords: reconfigurable mechanisms, Rubik's cube mechanism, type synthesis, planar mechanism, prismatic pair, kinematics, topology, mechanism design, sliding puzzle, metamorphic mechanism, mechanical sciences, 3D printed prototype

The story began more than a decade ago, when Hyun Youk, a professor of physics at Illinois, started his laboratory with a broad interest in how complex dynamics can arise from simple deterministic rules, particularly in systems of living cells that interact to form spatial patterns. In 2020, his group computationally explored how cells might communicate by secreting molecules and sensing those released by their neighbors, and they discovered communication modes that matched the ways real cells in nature construct the very same kinds of spatial patterns. That work led the team to a cellular automaton, a discrete grid of individual cells, each occupying one of a finite number of possible states and updating according to fixed rules. Cellular automata are famous for generating astonishingly sophisticated behavior—patterns that appear to move, interact, and even self-replicate—from deceptively simple local rules, which is why they have long served as models of pattern formation in physics, computer science, and biology.

The automaton Youk’s team studied was designed to mimic living tissue. Each cell takes on one of four states, and after every timestep it changes state according to a gene-circuit-like rule that imitates how real cells secrete and sense signaling molecules. The grid also carries periodic boundary conditions, meaning each edge wraps around to meet its opposite edge, much like the classic video game character Pac-Man reappearing on the left side of the screen after exiting the right. When simulated, the automaton starts from a randomly chosen initial configuration and always terminates in exactly one of three final fates: a static configuration of same-state cells, a moving rectilinear wave, or a moving spiral wave. Because the number of possible configurations is finite—though astronomically large—the system is, by the strict mathematical definition, not chaotic. Yet a difference of just a single cell’s state between two initial configurations often produced entirely different fates, with nothing visually obvious to explain why.

To test whether this apparent complexity amounted to genuine unpredictability, the researchers turned to machine learning. They gave a suite of algorithms a deceptively simple binary-classification task: given an initial configuration, forecast whether the automaton would end in a static fate or a moving-wave fate. The results were startling. Half the time the algorithms guessed correctly, and half the time they were completely wrong—performance indistinguishable from a coin flip. Here was a deterministic system whose future could not be extracted from its past by any human or machine. “Despite the simplicity of our system, the cells self-organized in a way that no human or machine could initially predict,” said Elinor Kay, an Illinois Physics graduate student and co-author of the study. The finding pointed to a source of unpredictability fundamentally distinct from chaos, one that had gone largely unnoticed in discussions of determinism and forecasting.

The breakthrough came when the team changed how they looked at the system. Instead of visualizing the four cell states as colors, they reimagined them as arrows pointing up, down, left, or right. What emerged was striking: cores of oppositely pointing arrows, completely surrounded by closed loops of arrows tracing circular paths, forming structures the researchers called vortices. Each vortex could be labeled positive, negative, or neutral depending on its orientation and degree of circular tracing. Youk and his former student, lead author Lars Koopmans, found the vortices to be highly dynamic entities. “Lars and I were looking at a lot of simulation movies, and watching them eventually trained our eyes to see these vortices,” Youk recalled. “At first, they were oddities, but then we noticed that their abundances always decreased over time.”

The vortices behaved like Brownian particles, drifting across the lattice, merging, and annihilating one another after an initial period of rapid proliferation. Their fate carried decisive information: if every vortex vanished, the system settled into a static configuration or a rectilinear wave, whereas the survival of even a single vortex guaranteed a spiral wave. The team also noticed that every positive vortex was tethered to a negative one, and vice versa, by an unbroken string of same-state cells, and that positive and negative vortices always appeared and disappeared together. The system’s total charge, therefore, remained exactly zero throughout every simulation—an unexpected conservation law that was nowhere encoded in the automaton’s update rules. Some of this behavior traced back to the periodic boundary conditions: whenever a vortex loop crossed a lattice boundary, it reentered the grid and generated a new vortex core of opposite orientation and charge, explaining both the pairing of charged vortices and the conservation of total charge. “We originally imposed periodic boundary conditions because they made the simulations easier to implement,” Youk said. “But it turns out this seemingly trivial decision is actually very important. Without these boundary conditions, we wouldn’t have unending waves or pairing of oppositely charged vortices.”

Something deeper was at work, rooted in topology. A two-dimensional grid with periodic boundary conditions is topologically equivalent to a torus—the surface of a donut—which can be visualized by gluing the lattice’s opposite edges together. Because of this connectivity, certain strings of same-state cells wrap around the donut and cannot be untangled from its hole; these are known as noncontractible loops. The researchers tested whether these loops could serve as predictors of fate. In simulations destined for static or rectilinear-wave outcomes, the average count of noncontractible loops fluctuated near zero before the final vortex annihilation, dipping to zero with increasing frequency as the deciding moment approached. In principle, observing such rapid drops could signal an impending static or rectilinear fate before it actually occurred. But in simulations bound for spiral-wave fates, the loop count simply fluctuated near one, a condition that still permits either non-spiral outcome. The loops, in other words, could predict some fates but not all.

The decisive predictor emerged from a generalization of these loops that the team calls the winding field, a topological quantity capturing the lattice’s full spatial configuration—precisely the kind of information to which the best-performing machine-learning model, a convolutional neural network, had proven sensitive. Rather than examining only wrapped strings, the winding field considers entire connected regions of same-state cells that wrap around the torus, assigning to each cell a pair of numbers, a winding vector, that quantifies how many times its region winds around the donut. At the start of nearly every simulation, the field was zero. But within the first one percent of each run’s runtime, the field switched on as vortices materialized, then self-organized as the dynamics unfolded, expanding as vortices moved and annihilated. Crucially, the field then changed in one of two characteristic ways: it either abruptly engulfed the entire lattice, producing a static or rectilinear fate, or it expanded gradually, leaving persistent regions of zero winding field and producing a spiral wave. That distinction allowed reliable discrimination among all three fates. When the winding field was fed to the convolutional neural network, its accuracy climbed steadily over the course of each simulation, from no better than random guessing at the start to near perfection at the end. “This shows that information is always present but slowly becomes accessible, which is very exciting because it implies that there’s a greater order just below our grasp,” Kay said.

The discovery challenges traditional notions of predictability that sit at the intersection of determinism and uncertainty, and Youk’s laboratory is among the first to probe these ideas. “We didn’t expect to find a new source of unpredictability at all,” Youk admitted, describing the finding as an accidental discovery born of the lab’s general interest in self-organizing systems. “What’s most exciting is the way our results exemplify the rich dynamics and layers of order that can form out of only local rules,” Kay added. Much remains to be understood. The team hopes to explore the system’s topological details more fully and to pin down a rigorous definition of predictability, which they currently define operationally as the ability of a human observer or machine-learning model to forecast fate better than chance. “So far, we haven’t come up with a deep answer to why topology matters so much in our simulations,” Youk concluded. “Rigorously defining predictability and examining its properties are our next goals.” The work was funded by the National Institutes of Health through an NIH-NIGMS R35 grant under Grant No. GM147508 and by the National Science Foundation’s Science and Technology Center for Quantitative Cell Biology under Grant No. 2243257.

Subject of Research: Emergence of predictability in a deterministic, nonchaotic cellular automaton modeling living cell communication

Article Title: The emergence of predictability in an unpredictable system

Article References: The emergence of predictability in an unpredictable system. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: cellular automata, predictability, chaos, topology, emergence, self-organization, machine learning, winding field, vortices, spatial patterns, determinism, Nature Communications

The research, published in Nature Communications on September 29, 2026, draws on topological photonics, a field that borrows concepts from topology, the branch of mathematics concerned with the properties of shapes that survive deformation. Topological ideas have already transformed condensed matter physics, explaining why certain materials conduct electricity flawlessly along their edges while insulating in their interiors. Photonics researchers have spent more than a decade trying to import the same robustness into light-based systems, designing devices in which light is forced to travel along protected pathways that ignore defects and sharp bends. What distinguishes the Maryland work is the platform: rather than fabricating intricate photonic microchips, Dutt and his colleagues achieved the first demonstration of these topological principles on a fiber-based platform, embedding the physics into the very glass strands that already span the globe.

The team’s building block is the microresonator, a microscopic bump sculpted onto the surface of a glass fiber with sub-nanometer precision using ultra-precise lasers. On its own, a single microresonator can trap and circulate light in a well-defined mode. Chained together, these bumps interact in a carefully engineered sequence, and by linking 21 of them along a single fiber the researchers created what they describe as a specialized, one-way optical highway. Light traveling along this highway is steered around obstacles and prevented from degrading or scattering, much as a protected lane keeps traffic flowing past construction sites. The one-way character is the topological signature: because the pathway is defined by the global pattern of the structure rather than by any local detail, small imperfections cannot easily reflect or divert the signal.

The pivotal experiment centered on a hybrid boundary. By carving different patterns of microscopic bumps onto different regions of a single glass fiber, the researchers created a microscopic border where two distinct light-guiding arrangements meet. On one side of the boundary, the structures follow one pattern; on the other, a different one. What happens when a light wave encounters this border is far from obvious. Depending on the topological character of each side, the wave might freeze in place, bounce backward, or flow smoothly across. Predicting the outcome required the team to develop an entirely new mathematical blueprint, a formula that tells scientists whether light will be trapped at the boundary or transmitted across it, granting them total control over the signal’s fate.

This theoretical framework is what elevates the work from a clever fabrication demonstration to a genuine design tool. In conventional photonic devices, engineers rely on trial, simulation, and iterative refinement to understand how light moves through complicated structures. The new formula provides a direct, predictive rule for multiband topological heterojunctions, the junctions between topologically distinct regions that the team created on what is known as the surface nanoscale axial photonics platform. With such a rule in hand, researchers can deliberately engineer junctions that transmit, reflect, or localize light on demand, opening a route to reconfigurable optical circuits written directly into fiber.

The practical advantages over existing technology are substantial. Traditional advanced microchips used for routing light are fragile and expensive to manufacture, and once fabricated they cannot easily be altered without relying on power-hungry components that constantly drain energy to maintain their configuration. The new fiber-optic devices invert that trade-off. If changes are needed after fabrication, scientists can simply hit the fiber with targeted laser heat to reshape the microscopic bumps, trimming the structure to a new specification with minute spatial precision. Once trimmed, the configuration is stable and requires no further energy to maintain. Dutt, who has spent fifteen years experimenting with photonic microchips before beginning this collaboration, noted that these unique capabilities of microbumps, such as adaptable trimming and measurement with minute precision in space, are quite beneficial compared to microchips.

Durability and efficiency extend beyond the reconfigurability. The glass fibers suffer almost zero signal loss, and they can handle complex light signals without requiring the heavy cooling systems or bulky vacuum chambers that burden other advanced quantum hardware. That combination, low loss, ambient operation, and compatibility with the existing fiber infrastructure, is exactly what network engineers seek as traffic volumes climb and quantum technologies begin to demand channels capable of preserving delicate optical states. A platform that protects light from the imperfections of the real world, while remaining compatible with the cables already in the ground, could shorten the path from laboratory physics to deployed systems considerably.

The collaboration itself reflects the breadth of expertise the platform demands. Alongside Dutt, the team includes Dashiell Vitullo, a physicist at the Army Research Laboratory, and Nathaniel Fried, a University of Maryland doctoral candidate and Department of Defense SMART Scholar. The work was conducted in Dutt’s Fearless Optics, Quantum Engineering, and Technology Laboratory, housed at the university’s A. James Clark School of Engineering, where Dutt holds faculty positions in the Department of Mechanical Engineering and the Institute for Physical Science and Technology, as well as at Army Research Laboratory facilities. The research was carried out under a Cooperative Research and Development Agreement between the University of Maryland and the U.S. Army through its Combat Capabilities Development Command, a partnership that pairs academic photonics innovation with military communications needs.

According to Vitullo, the breakthroughs achieved by the team could enhance the speed and reliability of military communications networks, pave the way for quantum navigation sensors that do not rely on GPS, and support the simulation of advanced materials. The navigation application is particularly striking: quantum sensors that exploit the properties of light and matter to measure motion and rotation with exquisite precision could offer an alternative to satellite-based positioning in environments where GPS signals are jammed or unavailable, and robust fiber-based optical systems are natural candidates for carrying and processing the fragile signals such sensors require.

With the fundamental physics now proven on the fiber platform, the researchers are already looking toward what comes next. Beyond the microbumps themselves, the team plans to explore nonlinear optical behaviors, exploiting the unique properties of light to create synthetic dimensions, engineered degrees of freedom in which light can be made to propagate as if occupying extra spatial directions. Synthetic dimensions would allow researchers to manipulate multiple aspects of light simultaneously, vastly increasing the amount of information these fiber systems can carry. If the topological highway demonstrated here proves as robust in deployment as it is in the laboratory, the humble glass fiber, already the backbone of global communications, may gain a new layer of mathematical protection that keeps the world’s data flowing smoothly through an imperfect physical world.

Subject of Research: Topological photonics on fiber-based platforms for robust light control in optical communications

Article Title: Optics breakthrough could yield swifter communications

Article References: Optics breakthrough could yield swifter communications. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: topological photonics, fiber optics, microresonators, optical communications, University of Maryland, Nature Communications, topology, photonic chips, quantum sensing, synthetic dimensions, signal robustness, Army Research Laboratory

The new method, called SymLQA, is described in a paper published in Quantum Information Processing by Wenjie Sun, Zhigang Wang, and colleagues at the University of Electronic Science and Technology of China, Tsinghua University, and partner institutions. Rather than attacking the higher-order terms head-on, the researchers exploit a structural property of the problems they target: planar face-flux optimization. These problems arise naturally in lattice gauge models, where spins live on the edges of a graph and the physically meaningful quantities are fluxes around closed loops, or faces. In such settings, the seemingly complicated HUBO energy function hides a much simpler structure that only becomes visible when the graph is treated as a geometric object rather than a bag of coupled variables.

The first step of the SymLQA pipeline is a careful topological extraction. Using a rotation system, a standard combinatorial device that records the cyclic order of edges around each vertex, together with half-edge traversal, the algorithm identifies all the bounded faces of an embedded planar graph. This is the computational equivalent of tracing every enclosed region of a map drawn on a flat sheet. The implementation is rigorous enough that it satisfies Euler’s identity, the classic relation among vertices, edges, and faces, on every embedding tested, and it successfully extracts irregular faces containing up to sixteen boundary edges. That robustness matters because real-world planar instances are rarely neat square grids; they are irregular, lopsided, and full of awkward boundary shapes.

Once the faces are known, the transformation at the heart of SymLQA begins. Each face is assigned a new binary variable defined as the product of the edge spins along its boundary, a quantity the authors call a classical face-flux variable. This move mirrors a deep idea from lattice gauge theory, where fluxes around plaquettes, rather than the underlying link variables, often carry the essential physics. In the face-flux variables, the original edge-spin HUBO, with its face fields and face-flux interaction terms, becomes a sparse objective containing only one-body and two-body terms. Crucially, this reduction requires no auxiliary variables at all, which distinguishes it from the usual penalty-based encodings that inflate problem size and introduce fragile constraint weights.

The reduction would be of limited use if solutions in the new variables could not be translated back. SymLQA handles this with a reconstruction step based on arithmetic over the finite field GF(2), the two-element field where addition is equivalent to exclusive-or. For connected open planar embeddings, the GF(2) reconstruction maps every assignment of the dual, or face, variables back to a consistent assignment of the original edge spins, and the mapping preserves the objective value exactly. The consequence is mathematically clean: the minimum of the primal problem and the minimum of the dual problem coincide. The annealer can therefore search the transformed, quadratic landscape with the full confidence that whatever optimum it finds corresponds to a genuine optimum of the original hard problem.

To find out whether this elegant reformulation actually pays off in practice, the team benchmarked SymLQA against three formidable baselines: a momentum-based native local quantum annealing applied directly to the HUBO, a gauged variant of local quantum annealing, and classical simulated annealing on the primal formulation. The test bed consisted of independently generated certified frustrated-loop instances, a family of benchmark problems whose ground states are known in advance, which allows success or failure to be verified without ambiguity. Frustrated loops are notoriously treacherous for annealers because competing interactions create rugged energy landscapes riddled with local minima, making them a demanding and honest yardstick for any new solver.

The results are striking. On regular grids up to 32 by 32 and on irregular planar grids, SymLQA reached the known ground state in every tested run, maintaining a perfect success probability. The baselines told a very different story: their success probabilities fell rapidly as the instances grew, a familiar signature of gradients drowning in higher-order terms and of generic thermal dynamics failing to navigate the landscape. SymLQA’s advantage was not confined to a single coupling regime either. Across four independently sampled coupling regimes, the method retained unit success probability, suggesting that the improvement stems from the structural reformulation itself rather than from a lucky interaction between the algorithm and one particular class of random instances.

The speedup numbers are equally dramatic. At a grid size of 12 by 12, SymLQA achieved a batch time to solution at the 99 percent confidence level, abbreviated TTS99, of just 0.137 seconds. Native local quantum annealing needed 22.35 seconds to reach the same reliability, roughly 160 times slower, while primal simulated annealing required 8.85 seconds, about 65 times slower. Time to solution is a standard metric in the annealing community because it combines the probability of finding the optimum with the cost of each run, rewarding algorithms that are both accurate and consistently repeatable. A two-order-of-magnitude gap on this metric is not an incremental gain; it is the kind of separation that changes which problems are considered practically solvable.

What makes SymLQA especially interesting is that it is, at its core, a classical pipeline. The face extraction, the flux-variable transformation, and the GF(2) reconstruction are all classical preprocessing and postprocessing steps wrapped around an annealing solver. This positions the work squarely within the growing field of quantum-inspired optimization, where insights from physics and from quantum hardware motivate classical algorithms that can run on ordinary computers today. The connection to quantum Z2 lattice gauge formulations of HUBO problems, explored in recent work by other groups, shows that gauge-theoretic structure is emerging as a general resource for taming higher-order optimization, and SymLQA demonstrates how to exploit that structure with full topological awareness on planar graphs.

The implications extend beyond a single benchmark family. Planar optimization structures appear in routing and network design, in grid-based physical models, and in any setting where constraints or costs are naturally associated with regions rather than individual links. By converting edge-spin HUBO models with polynomially suppressed gradients into sparse Ising objectives with clean one- and two-body terms, SymLQA makes an entire problem class friendly to the growing ecosystem of Ising machines, digital annealers, and quantum annealers. The work also carries a broader lesson for the field: before throwing more hardware or more sophisticated dynamics at a hard optimization problem, it can pay enormously to ask whether the problem’s hidden topology already contains the key to simplifying it. In this case, a map’s faces turned out to be the secret ingredient that turned an intractable-feeling search into one solved, reliably, in a fraction of a second.

Subject of Research: Topology-aware local quantum annealing for planar face-flux HUBO optimization problems

Article Title: SymLQA: topology-aware local quantum annealing for planar face-flux HUBO problems

Article References: Sun, W., Wang, Z., Hu, J., Yu, L., Chen, G., Wang, L., Liu, H., & Li, X. (2026). SymLQA: topology-aware local quantum annealing for planar face-flux HUBO problems. Quantum Information Processing, 25(10), Article 323. https://doi.org/10.1007/s11128-026-05345-4

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05345-4

Keywords: quantum annealing, HUBO, Ising model, lattice gauge theory, combinatorial optimization, planar graphs, face-flux variables, simulated annealing, topology, GF(2) reconstruction, time to solution, spin glass

Molecular weaving itself is a young discipline. Instead of tying polymer chains together with covalent bonds at every crossing, woven networks rely on mechanical interlocking: molecular threads pass over and under one another the way warp and weft strands do in a loom, but without covalent links at the crossings. This gives the material a bottom-up route to topological control, because properties such as flexibility, porosity, and stress distribution are dictated not only by the chemistry of the threads but by their geometry of entanglement. Landmark achievements over the past decade, including woven covalent organic frameworks and layered two-dimensional molecularly woven fabrics, proved that such structures could be made and crystallized. Yet every one of these materials shared a common constraint: they contained exactly one type of woven motif, repeated uniformly across the network. The fabric of everyday life, by contrast, achieves much of its sophistication through hierarchical layering, with threads crossing threads at several organizational levels simultaneously.

The Zhejiang-led team closed that gap through careful regulation of two design variables: the size of the molecular building blocks and the solvent environment in which the threads assemble. By tuning monomer dimensions, the researchers controlled how many strands could pass through a given region of the forming network, while solvent templating guided the strands into overlapping registration states during crystallization. The outcome is a family of materials labeled woven polymer networks, non-woven polymer networks, and, crucially, multilevel woven polymer networks such as MWPN-1 and MWPN-2, in which several woven topologies coexist in one ordered two-dimensional sheet. The authors describe the result as analogous to the structure of macroscale complex fabrics, in which threads weave through threads at more than one level of organization.

Proving that a structure this intricate genuinely exists required an unusually broad battery of characterization techniques. Single-crystal X-ray diffraction, the gold standard for establishing atomic connectivity in crystalline materials, provided unambiguous evidence of the multilevel woven architecture, and the crystallographic data have been deposited with the Cambridge Crystallographic Data Centre. Because these polymer sheets are extremely sensitive to electron beams, the team also deployed integrated low-dose and cryogenic electron microscopy imaging, adapting methods that have recently transformed the study of beam-sensitive frameworks such as metal-organic structures. Together, these independent imaging approaches confirmed the presence of the multilevel woven structure, ruling out the possibility that the exotic topology was an artifact of one analytical method.

With the structure established, the researchers turned to the question that motivates much of molecular weaving: does the topology change how the material behaves under stress? The answer, obtained through in situ pressure-dependent Raman spectroscopy combined with theoretical calculations, is emphatically yes. When the multilevel woven network is compressed, mechanical stress is distributed through a hierarchical mechanism that has no analogue in the single-level woven counterpart material. In a single-level weave, load transfer follows one set of crossing points; in the multilevel architecture, stress cascades through successive layers of interlocking strands, allowing the network to deform and redistribute force in a fundamentally different way. The team also measured nanoscale mechanical properties, including modulus distributions and force curves, showing quantitatively how the woven hierarchy alters the material’s elastic response.

This hierarchical stress regulation is more than a curiosity of mechanics. It demonstrates the central claim of the paper: that moving from single-level to multilevel woven topologies is not merely a structural upgrade but introduces properties and functions that lie beyond the reach of single-level systems. In conventional polymer design, chemists tune properties by changing monomer chemistry. Here, the same chemical building blocks yield materials with different mechanical signatures purely by changing the topological arrangement of the threads. That decoupling of function from composition is precisely what makes woven materials attractive as a design platform, and the new work shows that the platform is far richer than previously appreciated.

The practical payoff emerged in an area of intense industrial interest: hydrocarbon separation. Toluene and methylcyclohexane are chemically similar molecules, differing in that one is aromatic and the other is a saturated ring, yet separating them is a significant challenge in the petrochemical industry. The pair also matters for energy storage, because toluene and related molecules serve as liquid organic hydrogen carriers, media in which hydrogen can be stored and transported chemically. Efficient, low-energy separation of these species is therefore a bottleneck in emerging hydrogen economies. Breakthrough experiments simulating industrial separation processes showed that the multilevel woven material substantially outperforms expectations, thanks to synergistic channels generated by its multilevel woven topology. The hierarchical network creates a pore environment that discriminates between toluene and methylcyclohexane with a precision unavailable in the single-level analogue.

The origin of that selectivity is instructive. In the multilevel fabric, channels formed by one level of weaving intersect and interpenetrate channels formed by another, producing a combined pore landscape that neither topology would generate alone. Adsorption measurements on the material showed how guests interact with these channels, and comparisons among the woven, non-woven, and multilevel members of the family allowed the team to isolate the topological contribution to separation performance. In effect, the study provides a rare direct demonstration that mechanical interlocking geometry, not just pore size or surface chemistry, can be engineered to solve a real separation problem.

The synthetic chemistry underlying the achievement draws on the team’s prior expertise with dative boron-nitrogen bonds and with purely organic free-standing two-dimensional woven polymer networks, which the group reported in 2024. Those earlier single-level crystals established that robust, crystalline, all-organic woven sheets could be grown and handled. The new work extends that platform into the hierarchical regime, and the eleven distinct crystal structures deposited alongside the paper, spanning the woven, non-woven, and multilevel series, suggest a modular chemistry in which monomer size and solvent choice can be varied systematically to access different topological outcomes. Such a library is exactly what the field needs to move from proof-of-concept demonstrations to rational materials design.

The implications reach well beyond one material. Multilevel weaving offers a general strategy for building topological hierarchy into soft crystalline matter, with potential applications in adaptive membranes, mechanoresponsive materials, and selective adsorbents for energy-relevant separations. It also raises new questions that the community is only beginning to formulate: How many levels of weaving can be incorporated into a single network? Can topologies be switched after synthesis, in the way that some woven frameworks show dynamic guest-responsive behavior? And can the hierarchical stress-distribution mechanisms observed here be harnessed in three-dimensional architectures or in devices? What is already clear is that molecular weaving has crossed a threshold. Just as the leap from a plain cloth to a layered technical fabric transformed what textiles can do, the leap from single-level to multilevel molecular weaving transforms what woven matter can achieve, giving chemists a fabric-like degree of architectural control over materials measured in nanometers rather than millimeters.

Subject of Research: Synthesis of a two-dimensional multilevel woven polymer network with multiple woven topologies for stress regulation and molecular separation

Article Title: Multilevel molecular weaving

Article References: Chen, L., Guo, Z., Xiao, D., Liu, Y., Shan, T., Yang, X., Zhang, Z., Hu, D., Miao, X., Liu, S., Zeng, Q., Xiao, X., Wang, M., Zhu, Y., Li, G., & Huang, F. (2026). Multilevel molecular weaving. Nature Materials. https://doi.org/10.1038/s41563-026-02754-9

Image Credits: AI Generated

DOI: 10.1038/s41563-026-02754-9

Keywords: molecular weaving, two-dimensional polymers, supramolecular chemistry, self-assembly, topology, porous materials, mechanical properties, crystallography, cryo-electron microscopy, Raman spectroscopy, hydrocarbon separation, liquid organic hydrogen carriers