Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.
A linear-time heuristic for improving network partitions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Presents an optimal gate-packing partitioning scheme for the QFT that aims to minimize e-bit count in distributed quantum systems and validates it on hardware.
citing papers explorer
-
End-to-end performance of quantum-accelerated large-scale linear algebra workflows
Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.
-
Towards an Optimally Distributed Quantum Fourier Transform Circuit
Presents an optimal gate-packing partitioning scheme for the QFT that aims to minimize e-bit count in distributed quantum systems and validates it on hardware.