⚛️ quantum physics

Variational Quantum Algorithms for Hyperelasticity: Incorporating Nonlinear Constitutive Behavior

This paper extends a Variational Quantum Algorithm framework to solve one-dimensional incompressible hyperelasticity problems with nonlinear constitutive behaviors involving rational powers of stretch by transforming these terms via auxiliary variables and penalty constraints, and further enhances solution accuracy through an iterative correction strategy.

Original authors: Uditnarayan Kouskiya, Caglar Oskay

Published 2026-08-20

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Uditnarayan Kouskiya, Caglar Oskay

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a world where the materials around us—rubber bands, car tires, the soft tissue in our bodies—could be modeled with perfect precision on a computer. Engineers and scientists have long relied on classical computers to predict how these materials stretch, squish, and snap back under pressure. However, these materials often behave in complex, non-linear ways, meaning a small push does not always result in a proportionally small movement. Solving the math behind these behaviors is notoriously difficult, especially when trying to simulate them on the next generation of computers: quantum machines. While quantum computers promise to solve certain problems faster than any machine today, they struggle with the very non-linear behaviors that make real-world materials interesting. They are excellent at handling straight lines and simple relationships, but they stumble when faced with the curves and twists of reality.

This is the challenge that Uditnarayan Kouskiya and Caglar Oskay, researchers at Vanderbilt University, set out to address. They are working at the intersection of civil engineering and quantum computing, a field that seeks to use the strange rules of quantum mechanics to solve problems in structural design. Their goal was to extend a new method they had previously developed to handle the messy, non-linear math of rubber-like materials. Specifically, they wanted to see if their approach could work for materials that follow complex rules involving fractional powers, a mathematical description common in models for rubber and biological tissues. The researchers did not build a physical quantum computer for this study; instead, they ran sophisticated simulations on a classical computer that mimics how a quantum machine would behave. Their work serves as a proof of concept, demonstrating that a specific strategy can bridge the gap between the rigid logic of quantum algorithms and the flexible reality of hyperelastic materials.

The core of the researchers' work involves a technique called a Variational Quantum Algorithm. In simple terms, this is a way of using a quantum computer to find the lowest energy state of a system, which corresponds to the most stable shape a material will take under a given load. The researchers took the mathematical description of a material's energy and turned it into a "cost function," a score that the quantum computer tries to minimize. The problem is that the equations for these rubber-like materials often contain powers that are fractions or negative numbers, which current quantum circuits cannot process directly. To get around this, the team introduced a clever workaround. They added "auxiliary variables," which are essentially helper numbers that stand in for the difficult fractional parts of the equation. They then added a "penalty" to the system: if the helper number did not match the difficult part of the equation perfectly, the cost score would go up. This forces the quantum computer to find a solution where the helper variable and the difficult math align, effectively translating the complex problem into a form the quantum machine can understand.

However, this translation is an approximation, and like any approximation, it introduces a small amount of error. To fix this, the researchers developed a second stage in their process: an iterative correction strategy. Once the quantum computer finds an initial, rough solution, the researchers use that result to calculate a "correction" field. They then run the quantum algorithm again, this time asking it to find the small adjustments needed to improve the first answer. They repeat this cycle, with each round refining the solution and bringing it closer to the true physical behavior of the material. It is a bit like tuning a radio; you first find the general station, and then you make small adjustments to the dial until the static clears and the signal becomes sharp.

The team tested this two-step approach on three different models of rubber-like materials, including the Ogden model and the Mooney–Rivlin model, which are standard ways engineers describe how these substances deform. They simulated a one-dimensional strip of material, one millimeter long, subjected to specific forces and boundary conditions. Using a simulated quantum system with three qubits—the basic units of quantum information—they ran their algorithm. The results showed that the initial penalty-based method provided a decent estimate, but the iterative correction process significantly improved the accuracy. For the Mooney–Rivlin model, the error dropped from over four percent to less than half a percent after just a few rounds of correction. The researchers found that while the first guess was often close, the subsequent corrections were essential for capturing the fine details of the material's behavior.

The study concludes that this method is viable for the specific types of non-linearities they tested, but it also highlights the limits of the current technology. The researchers noted that while their method works well for the simple, one-dimensional examples they chose, more complex, real-world scenarios involving multiple dimensions and intricate material behaviors would require more qubits and more sophisticated handling of the auxiliary variables. They did not claim to have solved the problem of simulating all materials on quantum computers, nor did they suggest that this method is ready for immediate industrial use. Instead, they presented a clear, step-by-step demonstration that a combination of penalty constraints and iterative refinement can make quantum algorithms useful for a class of difficult engineering problems that were previously out of reach. The work stands as a significant step forward in showing how quantum computing might one day help engineers design safer, more efficient structures by understanding the complex physics of the materials they use.

Technical Summary: Variational Quantum Algorithms for Hyperelasticity with Nonlinear Constitutive Behavior

Problem Statement
The paper addresses the challenge of solving nonlinear elastostatic boundary-value problems using near-term quantum hardware. While recent advances have motivated quantum algorithms for differential equations, two primary obstacles persist: many algorithms with strong theoretical guarantees require fault-tolerant hardware, and the linear structure of quantum state evolution complicates the treatment of nonlinear differential equations. Specifically, this work targets hyperelastic materials governed by constitutive models involving rational powers of the stretch (e.g., fractional and inverse powers), which are common in models like the Ogden and Mooney–Rivlin formulations. These nonlinearities are difficult to represent directly within the shallow-circuit Variational Quantum Algorithm (VQA) framework previously proposed for linear or logarithmic nonlinearities.

Methodology
The authors extend a previously proposed VQA framework for 1D hyperelasticity to handle constitutive nonlinearities involving rational powers. The methodology consists of three core components:

Reformulation as a Cost Function: The elastostatic problem is reformulated by discretizing the potential energy functional, $E[u]$ , and encoding the displacement degrees of freedom into a quantum state $|u\rangle = \theta_0 \hat{V}(\theta)|0\rangle$ . Here, $\hat{V}(\theta)$ is a parameterized quantum circuit (ansatz), and the potential energy serves as the cost function $C(\theta_0, \theta)$ to be minimized.
Polynomial Approximation via Penalty Methods: Since current quantum primitives (specifically Quantum Nonlinear Processing Units or QNPUs) can efficiently evaluate polynomial operations but not arbitrary rational powers, the strain-energy density $W(\lambda)$ is approximated as a sum of power terms. To eliminate fractional or inverse powers (e.g., $\lambda^{p}$ where $p \in \mathbb{Q}$ ), auxiliary variables $y$ are introduced to enforce constraints such as $y = \lambda^{p}$ . These constraints are incorporated into the total potential energy via a penalty term:
$\tilde{E}[u, y] = E[u, y] + \frac{\beta}{2} \int_{\Omega_0} (y^b - \lambda^a)^2 dX$
This transforms the problem into minimizing a polynomial cost function compatible with the VQA.
Iterative Correction Strategy: Recognizing that the penalty formulation introduces approximation errors (due to the polynomial approximation and the penalty parameter $\beta$ ), the authors introduce an iterative correction scheme. Starting from an approximate solution $\tilde{u}$ , a correction field $\delta u$ is sought such that $u = \tilde{u} + \delta u$ . By performing a Taylor expansion of the strain-energy density about the current approximation, a new cost function is constructed for the correction term. This correction problem is solved via a sequence of VQAs, updating the solution iteratively ( $u^{(k+1)} = u^{(k)} + \delta u^{(k)}$ ) to improve accuracy.

Key Contributions

Extension of VQA Framework: The work extends the VQA framework from linear and logarithmic nonlinearities to a broader class of constitutive models involving rational powers of stretch, specifically demonstrating applicability to incompressible Ogden and Mooney–Rivlin models.
Auxiliary Variable and Penalty Formulation: The paper proposes a method to handle non-polynomial constitutive terms by introducing auxiliary variables and penalty constraints, rendering the energy functional compatible with available quantum algorithmic primitives.
Iterative Correction Algorithm: A novel iterative correction strategy is introduced to mitigate errors inherent in the penalty-based approximation, systematically refining the solution through a sequence of VQA solves.

Results
The proposed approach was validated using statevector simulations in Qiskit for one-dimensional incompressible Ogden models (with parameters $\alpha=2$ and $\alpha=3$ ) and a Mooney–Rivlin model.

Accuracy: The iterative correction procedure significantly improved the accuracy of the penalty-based solutions for all tested models. The relative $L_2$ errors with respect to analytical solutions were reduced substantially after five iterations. For instance, the Mooney–Rivlin model showed a reduction in error from 4.27% (penalty-only) to 0.49% (iterative).
Convergence: The refinement process was observed to become increasingly difficult to optimize as the solution approached the analytical response, leading the authors to terminate the process after five iterations, at which point substantial accuracy gains were already achieved.
Implementation: The simulations utilized a 3-qubit system ( $N_q=8$ ) with a circuit depth of $d=4$ .

Significance and Claims
The paper positions this work as a "proof of concept" demonstrating that VQAs can be adapted to solve nonlinear hyperelasticity problems involving rational power laws, a class of problems previously difficult to address with near-term quantum algorithms. The authors claim that the combination of penalty-based approximation and iterative correction offers a viable pathway to improve solution accuracy without requiring fault-tolerant hardware.

The authors remain modest regarding the scope, noting that while the current examples require only a single auxiliary variable, more complex constitutive models involving multiple fractional-power terms would necessitate additional variables and a more expensive quantum implementation. Furthermore, the work is currently limited to one-dimensional problems; the authors identify the extension to higher-dimensional problems and the handling of unstructured grids as critical future directions required to fully leverage the finite element method's capabilities in a quantum setting. The paper does not claim an exponential advantage for these specific 1D examples but notes that complexity analysis follows analogous conditions to previous work regarding potential advantages.

More like this