A new approach uses circuit topology to study complex polymer interactions.
problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.
We define the local periodic linking number, LK, between two oriented closed or open chains in a system with three-dimensional periodic boundary conditions. The properties of LK indicate that it is an appropriate measure of entanglement between a collection of chains in a periodic system. Using this measure of linking …
New methods assess topological entanglement in periodic systems.
problem Assessing topological entanglement in systems with periodic boundary conditions.
method Introducing Periodic Jones polynomial and Cell Jones polynomial.
result Periodic Jones polynomial is a recurring factor of Jones polynomial of finite cutoffs.
Study on entanglement complexity of confined ring polymers in lattice tubes.
problem Understanding the entanglement complexity of confined ring polymers in lattice tubes.
method Applied knot theory to extend and prove results about the complexity of 2SAPs.
result Proved that all but exponentially few size m 2SAPs have F complexity that grows at least linearly in m as m approaches infinity.
The study examines linking numbers and writhes in random graph embeddings within a cube.
problem Modeling entanglements of polymers in confined spaces.
method Analysis of linking numbers and writhes in random linear embeddings of complete graphs and graphs on n vertices.
result Mean sum of squared linking numbers and writhes are of the order of θ(n(n!)) for random embeddings.
Develops a braid-theoretic framework to analyze chirality in molecular knots.
problem Analyzing chirality in molecular knots constructed using circuit topology.
method Translated circuit topology approach to knot engineering into braid-theoretic framework, calculating Jones polynomial for binary combinations.
result Jones polynomial provides a powerful tool for analyzing chirality of molecular knots.
Parallel algorithm speeds up Jones polynomial computation.
problem Efficient computation of knot complexity measures.
method First parallel algorithm for exact Jones polynomial computation.
result Reduces computational time by an exponential factor.
Proof of Knot Entropy Conjecture for tube lattice polygons.
problem Proving exponential growth rate of knot polygons equals unknot polygons.
method Upper and lower bounds on polygon counts, braid insertions, and pattern theorems.
result Established the Knot Entropy Conjecture for tube lattice polygons.
Machine learning improves polymer design accuracy.
problem Designing polymers with desired phase behavior in disordered systems.
method Inverse design via machine learning, including gradient boosting with decision trees and particle-swarm optimization.
result High-accuracy tuning of poly(2-oxazoline) cloud point with RMSE of 4 °C.
Novel Jones polynomial for open curves in 3D space.
problem Measuring entanglement complexity of open curves in 3-space.
method Defining Jones polynomial for linkoids and extending to collections of open and closed curves.
result Jones polynomial for open curves has real coefficients and is continuous.
Proposes a new model to predict polymer properties by integrating various data types.
problem Inaccurate polymer property prediction due to separate modeling of different data types.
method Multi-modal cascade feature transfer using GCN for chemical structure and molecular descriptors.
result Empirically evaluated model shows higher predictive performance than single-feature approaches.
Improved prediction of polymer morphology through machine learning and simulations.
problem Understanding and predicting the morphology of multi-component polymer blends.
method Modified Cahn-Hilliard model for simulations, machine learning for clustering and prediction.
result Machine learning achieved ≥ \geq ≥ 90% accuracy in predicting polymer morphology. Machine learning optimizes polymer fiber synthesis.
problem Complex material synthesis requires impractical experimentation.
method Bayesian optimisation using machine learning.
result Efficiently directs synthesis to achieve material and process objectives.
New interdisciplinary branch in math physics tackles topological interactions of polymer-like objects.
problem Analyzing topological interactions in fluctuating non-phantom rope-like objects.
method Review of conceptual steps in statistical topology.
result Emergence of statistical topology as a new interdisciplinary field.
Study shows space writhe closely correlates with knot signature in polymers.
problem Understanding the relationship between space writhe and knot signatures in knotted polymers.
method Performed Langevin dynamics simulations of knotted polymers to measure space writhe.
result Space writhe is strongly correlated with knot signature in complex knots.
Bayesian modeling predicts hydroxide ion conductivity in polymer membranes.
problem Quantitative relationship between hydrophilic domain size and hydroxide ion conductivity in polymer membranes is unknown.
method Bayesian sparse modeling applied to copolymer composition data.
result Composition-derived features are identified as critical for predicting hydroxide ion conductivity.
Method optimizes knotting pathways in constrained polymers.
problem Understanding how geometric constraints affect knot formation in polymers.
method Topological steering using knotoid spectrum and mean unravelling number.
result Geometric constraints increase the frequency of twist knots in polymers.
Novel symmetry found in nanocarbons' discrete principal curvature structure.
problem Identifying novel symmetries in nanocarbons' geometric structures.
method First-principles calculations and discrete geometry analysis.
result Discovery of a novel symmetry (pre-constant discrete principal curvature) in nanocarbons.
HAL accelerates the generation of training sets for accurate interatomic potentials.
problem Generating accurate and transferable interatomic potentials is time-consuming and requires expert input.
method HAL framework using a physically motivated sampler with a biasing term to drive high uncertainty configurations.
result HAL-generated training databases for alloys and polymers predict macroscopic properties with high accuracy.
Machine learning classifies polymer links with high accuracy.
problem Classifying knots and links in polymer melts and biological systems.
method Feedforward neural network trained on writhe density matrix.
result 97% accuracy in classifying six prime links across temperatures and lengths.
Study reveals weak knotting in confined polymers, not dominated by any single knot type.
problem Characterizing knotting in open, confined polymers.
method Modeling open curves as virtual knots, comparing lattice walks and ideal chains in confined and unconfined conditions.
result Weak knotting is a common feature in confined polymers, not dominated by any single knot type.
Quantum entanglement is linked to topological braiding through Yang-Baxter equations.
problem Understanding the relationship between quantum entanglement and topological braiding.
method Viewing unitary entangling operators as braiding operators and using Yang-Baxter equations.
result Quantum entanglement is necessary for forming invariants of knots, as shown by solutions to the Yang-Baxter Equation.
Non-entangling Yang-Baxter solutions yield trivial knot invariants.
problem Linking quantum entanglement to topological knot theory.
method Examined Yang-Baxter operators and their relation to quantum gates.
result Yang-Baxter solutions must be entangled to distinguish knots.
Quantum states are not entangled if submanifold is a product.
problem Understanding entanglement in quantum states associated with product submanifolds.
method Analyzing quantum states ρ N ρ_N ρ N on submanifolds of product Kähler manifolds in the semiclassical limit. result States are not entangled when submanifold is a product.
Study on quantum state entanglement using Kaehler manifolds.
problem Quantum state entanglement on Kaehler manifolds.
method Semiclassical asymptotics and pure states on spheres.
result Entropy analysis of quantum states on spheres.
Study entanglement in complex manifold sections.
problem Entanglement properties of complex manifold sections.
method Kähler quantization for ample line bundles.
result Characterized entanglement in tensor products of sections.
Locates entanglement in curves using knot intensity distribution.
problem Finding robust methods for locating entanglement in embedded curves.
method Introducing knot intensity distribution as a local quantifier for entanglement contribution.
result Intensity distributions identify regions in knots accommodating topological changes.
q-CNN learns data features through entangled states.
problem Classifying MNIST and Fashion MNIST datasets.
method Introduces q-CNN model, a tensor network description, and studies entanglement structure.
result q-CNN learns entanglement structure to perform classification tasks accurately.
Study of holographic entanglement entropy with boundary contributions in 3 and 4 dimensions.
problem Analyzing entanglement entropy in spacetimes with boundaries.
method Holographic calculation adapted to spacetimes with boundaries, comparing with Ryu-Takayanagi proposal.
result Complete agreement between holographic and Ryu-Takayanagi calculations under specific boundary conditions.
Quantum blockchain uses entangled photon states over time.
problem Secure and efficient blockchain without space-based entanglement.
method Temporal GHZ state of photons encoding blockchain, nonclassical past influence.
result Entanglement in time provides quantum advantage for blockchain.
Enhances graph neural networks by creating virtual data examples.
problem Lack of examples to identify optimal graph rationales in graph applications.
method Introduces environment replacement to create virtual data examples and proposes a framework for rationale-environment separation and representation learning.
result Demonstrates the effectiveness and efficiency of the augmentation-based graph rationalization framework on molecular and polymer datasets.
Anomalies and entanglement entropy linked in odd dimensions with boundary effects.
problem Understanding anomalies and entanglement entropy in odd dimensions with boundaries.
method Analyzing the integrated conformal anomaly and logarithmic term in entanglement entropy for odd-dimensional spacetimes with boundaries.
result Logarithmic term in entanglement entropy when the entangling surface crosses the boundary of spacetime.
The paper uncovers the mathematical structure enabling value decomposition in multi-agent systems.
problem Theoretical justification for why value decomposition works effectively in multi-agent systems remains underexplored.
method The paper introduces the concept of Markov entanglement to measure the underlying structure and demonstrates how it can be used to bound the decomposition error.
result The widely-used class of index policies is weakly entangled and enjoys a sublinear O ( N ) \mathcal O(\sqrt{N}) O ( N ) scale of decomposition error for N N N -agent systems. Artificial neural networks predict quantum entanglement types.
problem Predicting entanglement types of quantum states.
method Supervised learning and deep neural networks on algebraic varieties.
result Trained neural networks can classify entanglement types for up to 5 binary qubits and 3 qutrits.
Study uses holography to analyze entanglement entropy in deformed CFTs.
problem Analyzing entanglement entropy in $Tar{T}$ -deformed CFTs.
method Holographic methods and direct bulk gravitational action evaluation.
result Agreement with known results for entanglement entropy.
Paper defines untangling number to measure entanglement complexity in 3-periodic networks.
problem Measuring the complexity of entanglement in 3-periodic networks.
method Defining ground states through knot-theoretic crossing diagrams and measuring untangling number.
result Introduced untangling number as a measure of entanglement complexity.
This work introduces 'Artificial Entanglement' to understand LLMs' fine-tuning effectiveness.
problem Understanding the effectiveness of parameter-efficient fine-tuning methods for large language models.
method Adopting a quantum-information-inspired perspective, the study measures 'Artificial Entanglement' in neural networks.
result LoRA and FFT induce distinct internal entanglement signatures but not external ones, suggesting a 'no-hair' property.
Paper introduces simplified formulas for Milnor's triple linking number.
problem Computational difficulty in calculating Jones polynomial for topological polymers.
method Developed Gauss diagram formulas for Milnor's Vassiliev invariants.
result Introduced non-torsion valued Milnor's triple linking number.
We use the conformal invariance and the holographic correspondence to fully specify the dependence of entanglement entropy on the extrinsic geometry of the 2d surface Σ Σ Σ that separates two subsystems of quantum strongly coupled N = 4 {\mathcal{N}}=4 N = 4 SU(N) superconformal gauge theory. We extend this result and calculate en…
We present atomistic molecular dynamics simulations of two Polyethylene systems where all entanglements are trapped: a perfect network, and a melt with grafted chain ends. We examine microscopically at what level topological constraints can be considered as a collective entanglement effect, as in tube model theories, o…
Quantum entanglement guides machine learning classifier architectures.
problem Using quantum entanglement for classical machine learning.
method Represented classifiers as quantum states in MPS, applied classical learning algorithms.
result Reduced qubit count from 1/10 of original number for practical quantum computers.
We analyze the Ricci flow of a noncompact metric that describes a two-dimensional black hole. We consider entanglement entropy of a 2d black hole which is due to the quantum correlations between two subsystems: one is inside and the other is outside the black hole horizon. It is demonstrated that the entanglement entro…
Paper introduces untangling number to quantify 3-periodic tangle complexity.
problem Quantifying the complexity of 3-periodic tangles in biological, chemical, and physical systems.
method Introduces untangling number, a measure of minimum distance to ground state through diagrammatic operations.
result For infinite open curves, generic ground states are crystallographic rod packings.
New kernels allow learning from non-separable data.
problem Learning from non-separable data.
method Introducing entangled kernels and a two-step algorithm.
result Efficient algorithm for learning entangled kernels.
Researchers create an exact entangling gate using braiding and measurement of Fibonacci anyons.
problem No known leakage-free entangling gate using braiding of Fibonacci anyons.
method Supplement braiding with measurement operations to produce an exact controlled rotation gate.
result Exact entangling gate on two qubits created using Fibonacci anyons and measurement.
Computes entanglement entropy using Chern-Simons theory and symmetric webs.
problem Determining if a product state implies unlinked components.
method Using symmetric webs to compute colored link invariants and write multi-partite entangled states.
result Written down multi-partite entangled states of any given link.
Knoto-ID studies the entanglement of open protein chains without closing them.
problem Analyzing the entanglement of open protein chains without altering their geometry.
method Using knotoids, a generalization of knot theory for open curves, to evaluate entanglement without closing the curve.
result Knoto-ID can analyze both global and local topologies of protein chains, identifying non-trivial folds.
Quantum datasets improve QML performance.
problem Benchmarking QML on classical datasets is uncertain.
method Introduced NTangled dataset of quantum states with varying entanglement.
result QML models trained on NTangled dataset outperform classical models.