Design-CP: Context Parallelism for Design of Protein Nanoparticles

• URL: http://arxiv.org/abs/2607.05439v1
• Date: Fri, 03 Jul 2026 15:50:24 GMT
• Title: Design-CP: Context Parallelism for Design of Protein Nanoparticles
• Abstract summary: We introduce Design-CP, two context-parallel (CP) inference strategies for RFdiffusion 3.<n>We show how strong point-group symmetry constraints make CP usable out of the box for end-to-end, all-atom design of icosahedral nanoparticles.
• Score: 1.770767758587368
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many all-atom generative protein models can in principle design large multimeric complexes by jointly modelling all chains, but their quadratic token- and atom-pair representations quickly exceed single-GPU memory as the number of chains and residues modelled grows. We introduce Design-CP, two context-parallel (CP) inference strategies for RFdiffusion 3 (1D row-sharding and 2D grid sharding with ring attention) that distribute the quadratic activations across a multi-GPU mesh while preserving pretrained weights. We characterise their scaling when sampling icosahedral assemblies, showing that the maximum feasible asymmetric subunit (ASU) size grows with the expected square-root trend in GPU count and that 2D sharding achieves better wall-clock scaling. Moreover, we show how strong point-group symmetry constraints make CP usable out of the box for end-to-end, all-atom design of icosahedral nanoparticles, yielding favourable in silico structural and interface metrics. Finally, we demonstrate octahedral nanoparticle design on a small cluster of workstation-grade 16GB GPUs, illustrating how Design-CP can be a practical path towards democratising large-assembly protein design.

Related papers

• SimpleDesign: A Joint Model for Protein Sequence and Structure Codesign [53.93453139057735]
  We present SimpleDesign, an effective multi-modal protein design model trained directly in the data space.<n>We train SimpleDesign on over 2M sequence-structure pairs achieving strong performance across co-design and unconditional sequence/structure generation benchmarks.
  arXiv  Detail & Related papers  (2026-09-03T05:25:05Z)
• Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers [2.5315729179239637]
  We present a quantum simulation framework for real-time dynamics of the multi-flavor Gross-Neveu model in 1+1 dimensions.<n>We develop a hardware-efficient Trotterization whose per-step circuit depth scales with fermion flavor number rather than total system size.<n>A central contribution of this work is the Localized Diagonal Operator Approximation (LDOA), which systematically reduces the overhead associated with quartic interactions.
  arXiv  Detail & Related papers  (2026-05-06T21:57:51Z)
• PKINet-v2: Towards Powerful and Efficient Poly-Kernel Remote Sensing Object Detection [73.05827565991488]
  PKINet-v2 synergizes anisotropic axial-strip convolutions with isotropic square kernels and builds a multi-scope receptive field.<n>PKINet-v2 achieves state-of-the-art accuracy while delivering a $bf3.9times$ FPS acceleration compared to PKINet-v1.
  arXiv  Detail & Related papers  (2026-03-17T10:17:58Z)
• Fold-CP: A Context Parallelism Framework for Biomolecular Modeling [11.44600151695527]
  We present NVIDIA BioNeMo Fold-CP, a context parallelism framework.<n>We use the Boltz models as open source reference architectures.<n>We implement custom multidimensional primitives that efficiently parallelize both the dense triangular updates and the irregular, data-dependent pattern of window-batched local attention.
  arXiv  Detail & Related papers  (2026-03-16T04:20:01Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Metasurface-Based Dual-Basis Polarization Beam Splitter for efficient entanglement witnessing [0.0]
  Entanglement witnessing is essential for quantum technologies such as computing, key distribution, and networking.<n>We propose a metasurface-based analyzer that performs dual-basis projections simultaneously by mapping them to spatial modes.<n>The proposed scheme provides a path toward efficient entanglement verification with applications in quantum key distribution, quantum repeaters, and scalable quantum networks.
  arXiv  Detail & Related papers  (2025-10-04T20:23:25Z)
• DualEquiNet: A Dual-Space Hierarchical Equivariant Network for Large Biomolecules [32.33126287600196]
  We introduce DualEquiNet, a Dual-Space Hierarchical Equivariant Network that constructs complementary representations in both Euclidean and Spherical Harmonics spaces to capture local geometry and global symmetry-aware features.<n> DualEquiNet achieves state-of-the-art performance on multiple existing benchmarks for RNA property prediction and protein modeling, and outperforms prior methods on two newly introduced 3D structural benchmarks.
  arXiv  Detail & Related papers  (2025-06-10T07:43:50Z)
• Sequence-Augmented SE(3)-Flow Matching For Conditional Protein Backbone Generation [55.93511121486321]
  We introduce FoldFlow-2, a novel sequence-conditioned flow matching model for protein structure generation.<n>We train FoldFlow-2 at scale on a new dataset that is an order of magnitude larger than PDB datasets of prior works.<n>We empirically observe that FoldFlow-2 outperforms previous state-of-the-art protein structure-based generative models.
  arXiv  Detail & Related papers  (2024-05-30T17:53:50Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Embed to Control Partially Observed Systems: Representation Learning with Provable Sample Efficiency [105.17746223041954]
  Reinforcement learning in partially observed Markov decision processes (POMDPs) faces two challenges. It often takes the full history to predict the future, which induces a sample complexity that scales exponentially with the horizon. We propose a reinforcement learning algorithm named Embed to Control (ETC), which learns the representation at two levels while optimizing the policy.
  arXiv  Detail & Related papers  (2022-05-26T16:34:46Z)
• Compilation and scaling strategies for a silicon quantum processor with sparse two-dimensional connectivity [0.0]
  Inspired by the challenge of scaling up existing silicon quantum hardware, we propose a spin-qubit architecture with minimal compilation overhead. Our architecture is based on silicon nanowire split-gate transistors which can form finite 1d chains of spin-qubits. An appealing feature of the proposed architecture is its manufacturability using complementary-metal-oxide-semiconductor (CMOS) fabrication processes.
  arXiv  Detail & Related papers  (2022-01-08T19:01:32Z)
• HyperSPNs: Compact and Expressive Probabilistic Circuits [89.897635970366]
  HyperSPNs is a new paradigm of generating the mixture weights of large PCs using a small-scale neural network. We show the merits of our regularization strategy on two state-of-the-art PC families introduced in recent literature.
  arXiv  Detail & Related papers  (2021-12-02T01:24:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.