Next Article in Journal
A Novel Reconfigurable Vector-Processed Interleaving Algorithm for a DVB-RCS2 Turbo Encoder
Next Article in Special Issue
QMProt: A Comprehensive Dataset of Quantum Properties for Proteins
Previous Article in Journal
Sub-Synchronous Oscillation Robust Damping Method for HVDC with Embedded Energy Storage
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Quantum Strategy for the Simulation of Large Proteins: From Fragmentation in Small Proteins to Scalability in Complex Systems

by
Parfait Atchade-Adelomou
1,2,* and
Laia Coronas Sala
3
1
Lighthouse Disruptive Innovation Group, LLC, 1 Broadway, 14th Floor, Cambridge, MA 02142, USA
2
MIT Media Lab-City Science Group, Cambridge, MA 02139, USA
3
Lighthouse Disruptive Innovation Group Europe, SL., 08830 Barcelona, Spain
*
Author to whom correspondence should be addressed.
Electronics 2025, 14(13), 2601; https://doi.org/10.3390/electronics14132601
Submission received: 20 May 2025 / Revised: 19 June 2025 / Accepted: 23 June 2025 / Published: 27 June 2025
(This article belongs to the Special Issue Recent Advances in Quantum Information)

Abstract

We present a scalable and resource-aware framework for the quantum simulation of large proteins, grounded in systematic molecular fragmentation, analytical Toffoli gate modeling, and empirical validation. The ground-state energy of a target biomolecule is reconstructed from capped amino acid fragments, with fixed corrections to account for artificial boundaries. Analytical cost estimates—derived from reduced Hamiltonians—are benchmarked against empirical Toffoli counts using PennyLane’s resource estimation module. Our model maintains predictive accuracy across biologically relevant systems of up to 1852 electrons, capturing consistent patterns across diverse fragments. This framework enables early-stage feasibility assessments for achieving quantum advantage in biochemical simulation pipelines.

1. Introduction

The quantum simulation of biomolecular systems remains a major computational challenge due to the exponential scaling associated with solving the electronic Schrödinger equation. Proteins, in particular, present a formidable case, as they involve a large number of electrons and complex many-body interactions [1,2]. Fragmentation techniques, which decompose macromolecules into smaller subsystems such as amino acids or peptides, have emerged as a viable approach to reducing computational overhead while preserving physical accuracy [3,4,5,6].
Quantum computing offers theoretical advantages in simulating electronic structure problems, where classical methods rapidly become intractable with system size [7,8]. By encoding quantum states directly in qubit-based representations, quantum computers avoid the combinatorial explosion characteristic of classical full-configuration interaction methods. Despite the availability of approximations such as DFT [9] and CAS-CI [10], these approaches face well-known limitations in accuracy or scalability, particularly for systems with strong electronic correlation [11,12].
Exact quantum chemical simulations remain out of reach for full protein systems, even with quantum hardware. As such, methodologically principled reductions in problem size are essential. Our objective is to evaluate a fragmentation-based framework for scalable quantum simulation of proteins, balancing error control with computational feasibility. The methodology builds on our prior work [3], which introduced a reassembly scheme for independently simulated fragments with chemical corrections. That work demonstrated high accuracy on small peptides, achieving relative errors of approximately 0.005 % for amino acid-level fragmentation and 0.27 % for finer subdivisions.
In this study, we extend the methodology to larger and biologically relevant peptides, including Glucagon, Oxytocin, Vasopressin, and Angiotensin II, which vary in electron counts and structural complexity. Among them, Glucagon stands out as a critical benchmark due to its physiological role and its size, comprising 29 amino acids and over 1800 electrons. Its simulation requires addressing more than 1048 coefficients, posing a stringent test for the scalability of our approach.
By systematically evaluating prediction errors and quantum resource estimates across these molecules, we aim to assess the practical applicability of fragmentation-based strategies for quantum chemistry. This work contributes to the broader effort of making accurate electronic structure simulations tractable for systems of biological and chemical relevance. Beyond molecular simulation, the methodology has potential implications in areas such as drug discovery and materials design, where electronic structure accuracy is essential, and classical methods face intrinsic limitations.
The structure of the paper is as follows: Section 2 reviews related work in quantum simulation and fragmentation-based methods. Section 3 introduces our methodology, including regression models, Toffoli gate estimation, and the proposed multi-level fragmentation and reassembly strategy. Section 4 presents experimental validation on a range of peptides and proteins, from small dipeptides to large systems such as Glucagon, along with detailed error and scalability analyses. Section 5 discusses limitations, compares with alternative techniques, and outlines practical implications and future research. Section 6 summarizes our main findings and perspectives. Additional technical derivations and regression diagnostics are provided in the appendices.

2. Related Works

Quantum simulations of biomolecules [5,6,13] have progressed along two converging lines: (i) classical fragment-based electronic-structure methods that exploit locality to curb cost, and (ii) quantum algorithms that aggressively compress qubit and gate resources [14,15]. Our work positions itself at this intersection, extending classical fragmentation ideas into the quantum era and knitting together the most effective resource-optimization tools reported to date.
Fragmentation approaches such as the Fragment Molecular Orbital (FMO) method [16], Our N-Layered Integrated Molecular Orbital and Molecular Mechanics (ONIOM) [17], and adaptive Quantum Mechanics/Molecular Mechanics (QM/MM) [18] mitigate the exponential scaling bottleneck by decomposing proteins into chemically intuitive fragments. However, the high-level electronic treatment of each block is still limited to density-functional or semi-empirical accuracy.
E protein = i = 1 n E f i ± j = 1 k Δ E coupling , j ,
Δ E coupling , j = E a m j , capping / missing groups , n = 2 N E n -body , many-body terms .
In Equation (1), E protein denotes the total ground-state energy of the reassembled molecule, computed from a set of n fragments. Each E f i is the energy of fragment i, typically obtained from an independent quantum simulation. The term Δ E coupling , j represents an additional correction associated with inter-fragment effects or artificial modifications introduced via fragmentation.
Equation (2) defines two types of corrections that Δ E coupling , j may include the following:
  • E a m j : the energy of a group assembled or removed during fragmentation (e.g., a capping hydrogen atom to preserve chemical valency);
  • n = 2 N E n -body : a higher-order many-body interaction correction involving n fragments simultaneously, as in the fragment molecular orbital (FMO) method [16].
The index k denotes the total number of such coupling corrections considered. The ± sign in Equation (1) reflects the fact that these contributions can either increase or decrease the total energy, depending on whether the correction represents an additive or subtractive effect (e.g., insertion/removal of atoms or stabilizing/destabilizing couplings). By introducing the general symbol Δ E coupling , j , we unify the treatment of both structural and energetic corrections into a single formalism. This allows Equations (1) and (2) to remain valid across a wide range of fragmentation strategies, including those that incorporate post-reassembly many-body expansions (MBE).
Bowling et al. [19] exemplify this approach by combining single-residue fragmentation, minimal hydrogen capping, and screened two-body terms within a convergent many-body expansion (MBE) scheme:
E = I E I + I < J Δ E I J + I < J < K Δ E I J K +
Each correction term accounts for interactions omitted at lower orders of the expansion. In particular, truncating the series at the n-body level defines the degree of approximation. For instance, the three-body correction is given by the following:
Δ E I J K = E I J K ( E I J + E I K + E J K ) + ( E I + E J + E K )
Although many-body expansions offer chemically accurate results, their combinatorial scaling limits practical applicability. To address this, our method introduces resource-aware fragmentation, statistical estimation, and circuit-level compression to ensure scalability. Prior works, such as MFCC-MBE(2) [20], have improved classical accuracy by incorporating fragment and cap interactions. Extending these ideas, our framework replaces classical subroutines with quantum solvers while preserving compatibility with post-fragmentation corrections, thus enabling seamless integration into hybrid quantum–classical approaches.
Three breakthroughs underpin our scalable workflow:
  • Local qubit tapering. Extending the symmetry-based tapering of Bravyi et al. [21], we identify Z 2 symmetries within each fragment, removing ∼4–6 logical qubits on average.
  • SelectSwap oracle synthesis. The SelectSwap network of Zhu et al. [22] prepares fragment phase oracles at a cost of O 2 n f log ( 1 / ε ) T gates, where n f = log 2 N coeff is the number of logical qubits required to represent the N coeff diagonal coefficients of the fragment.
  • Optimal state preparation [23]. Diagonal-unitary synthesis plus exact amplitude amplification [24,25] reduces the non-Clifford depth by 20–50% in published benchmarks (22% for QAOA, 50% for random diagonals) [24,25].
Together, these optimizations shrink the space–time volume of a 400-orbital active site by nearly two orders of magnitude versus the double-factorized algorithm of von Burg et al. [26].
Most prior quantum–chemistry demonstrations target small peptides ( < 200 e ) or model chromophores. To probe genuine scalability, we select four bio-relevant hormones spanning two decades in electron count and 30 orders in the Hamiltonian-coefficient space:
  • Glucagon (29aa, 1852 e ) — 4.33 × 10 48 coefficients; 2679 logical qubits after tapering.
  • Oxytocin (9aa, 536 e ) — 8.85 × 10 17 coefficients; 778 qubits.
  • Vasopressin (9aa, 1134 e ) — 7.81 × 10 31 coefficients; 1641 qubits.
  • Angiotensin II (8aa, 558 e ) — 2.88 × 10 18 coefficients; 809 qubits.
These systems fill the gap between toy peptides and full enzymes—precisely the scale at which the existing methods begin to break down and where our integrated pipeline is explicitly designed to operate.
Tensor-network simulation methods (e.g., DMRG [27], MPS [28], and TTN [29]) are highly efficient for systems with low or structured entanglement. However, when applied to quantum circuits that generate strong global entanglement—such as GHZ preparation, quantum Fourier transform, or Hamiltonian evolution—the bond dimension grows exponentially, making contraction intractable [29,30]. This limits their applicability to deep circuits or realistic biomolecules.
Most current approaches to quantum simulation remain limited to small peptides with fewer than 150 electrons, where accurate reassembly has been demonstrated with sub-1% errors. However, no previous method integrates fragmentation-aware oracle synthesis and tapering into a scalable pipeline for biomolecules with 500–2000 electrons. Our work addresses this gap by combining these techniques into a unified, resource-efficient framework capable of operating at the hormone scale. While challenges remain—such as chemically informed fragmentation, correlation beyond MP2 [31], and cross-fragment error mitigation—recent advances in entanglement-guided heuristics [32] suggest promising directions to extend the approach.

3. Methodology

Our methodology addresses the challenges of simulating large protein systems on quantum computers by combining fragmentation strategies with advanced quantum algorithms. Below, we outline the key components of our approach, from data modeling and resource estimation to fragmentation and reassembly techniques.

3.1. Fragmentation and Recombination Strategy

Our methodology builds upon the fragmentation protocol introduced in the QMProt framework [33], extending it to enable scalable quantum simulations of large biomolecules. The core idea is to approximate the ground-state energy of a full protein or peptide by summing the energies of chemically meaningful fragments, primarily based on individual amino acid residues. Each fragment is saturated with hydrogen atoms or small chemical groups to preserve valency and molecular stability.
In our framework, the reassembled ground–state energy E m is given by
E m = i = 1 n E f i ± j = 1 k E a m j ,
where the following applies:
  • n denotes the total number of fragments generated;
  • E f i is the ground-state energy (GSE) of fragment i;
  • k is the number of small molecules added or removed;
  • E a m j is the GSE of each such molecule;
  • E m is the final GSE of the reassembled molecule.
Here, the index i runs from 1 to n, enumerating each fragment, and j runs from 1 to k, enumerating each added or removed molecule.
To correct the artificial effects introduced at the cutting points, we apply fixed energy corrections based on the capping strategy:
  • If a methyl group (CH3) is added to complete valency, we add the energy of a methane molecule as a corrective term.
  • If a water molecule is implicitly removed during fragmentation (e.g., in peptide bonds), its reference energy is subtracted.
  • If no group is added or removed, no correction is applied.
These correction values are precomputed and consistently reused. This avoids the need for iterative many-body corrections or self-consistent inter-fragment coupling, drastically reducing computational complexity compared to traditional fragmentation schemes.
We apply this fragmentation strategy at two levels:
  • Amino acid level: Each amino acid is split into radical and backbone groups. We benchmark the ground-state energy (GSE) and resource estimates (e.g., qubits, Toffoli gates) of the full amino acid against the sum of its fragments, quantifying the reduction factor.
  • Peptide/protein level: For representative peptides such as Oxytocin, Angiotensin II, and Glucagon, we compute total energy as the sum of fragment energies plus corrective terms, as expressed in Equation (1). We compare this estimate to the full molecular simulation to evaluate accuracy and resource savings.
This approach maintains high computational efficiency while ensuring that GSE estimates remain within acceptable error bounds. The residual recombination error grows with the number of fragments and is influenced by the precision of the energy evaluation for each fragment. In our current implementation, calculations are performed at the Hartree–Fock (HF) level, which introduces some limitations for large systems. However, the modular nature of the method makes it compatible with more accurate solvers (e.g., DFT, MP2, or quantum algorithms), which are expected to further reduce the error as these techniques mature. Thus, our strategy provides a robust foundation for efficient and scalable quantum simulations of biomolecular systems.

3.2. Modeling Based on Experimental Data

To support our modeling and prediction efforts, we use a dataset—QMProt [33]. This dataset encompasses 45 carefully selected organic molecules, with a particular focus on the 20 canonical amino acids essential to human biology. Each molecule is decomposed into chemically meaningful subunits, including amino and carboxyl termini, central α -carbon atoms, and characteristic side chains.
The molecules in QMProt are composed primarily of non-hydrogen atoms such as carbon, nitrogen, oxygen, and sulfur, and they contain up to 15 heavy atoms. For each molecular entry, the dataset provides the following:
  • The total number of electrons and molecular orbitals.
  • The corresponding number of logical qubits required for simulation.
  • The full Hamiltonian encoded as a set of quantum coefficients.
  • Ground-state energy estimates derived from quantum mechanical methods
  • Additional physicochemical attributes relevant for simulation benchmarking.
This dataset bridges quantum chemical characterization with quantum resource modeling, offering a representative basis for scaling predictions to larger biomolecules. Using this foundation, we develop regression models to forecast quantum resource needs—including qubits and gate counts—based on fundamental descriptors such as the electron number, enabling extrapolation to peptides and protein fragments well beyond the initial dataset.

3.2.1. Linear Model for Qubits

We assume a linear relationship between the number of qubits and the number of electrons:
n qubits = α + β · n electrons + ε ,
where α is the intercept, β is the slope, and ε is the residual error. The model is fitted using ordinary least squares (OLS), minimizing the squared residuals:
min α , β i = 1 n n qubits ( i ) ( α + β n electrons ( i ) ) 2 .
The analytical solution involves solving the normal equations:
n n electrons n electrons n electrons 2 α β = n qubits n electrons n qubits .

3.2.2. Log-Linear Robust Model for Qubits

While the linear model offers a simple baseline, an empirical evaluation revealed that the relationship between electron count and qubit requirements is more accurately captured using a log-transformed regression. Accordingly, we consider the following:
log ( n qubits ) = α + β · n electrons + ε ,
where the parameters α and β are estimated using robust methods, such as the Huber Regressor [34] and the Theil–Sen Estimator [35], to mitigate the influence of outliers.
To account for structural diversity, we partition the dataset into three molecular complexity segments: Small (electron count ≤ 150), medium (151–500), and large (>500), enabling localized regressions adapted to each scale. Predictions are returned to the original scale via the following:
n ^ qubits = exp ( α + β · n electrons ) .

3.2.3. Exponential Model for Hamiltonian Coefficients

We hypothesize an exponential growth in the number of coefficients concerning the electron count:
n coef = a · exp ( b · n electrons ) ,
with a and b as model parameters. Taking the natural logarithm yields a linearized version:
log ( n coef ) = log ( a ) + b · n electrons + ε ,
which is fitted using OLS. The predicted values in the original scale are obtained via exponentiation:
n ^ coef = exp ( log ( a ) + b · n electrons ) .

3.2.4. Confidence Intervals

For the linear model, the 95% confidence interval for a prediction y ^ is as follows:
y ^ ± t n 2 , 0.975 · s fit ( x ) ,
where x is the number of electrons for which the confidence interval is being computed, and x ¯ denotes the sample mean of the observed electron counts.
s fit ( x ) = σ ^ · 1 n + ( x x ¯ ) 2 ( x i x ¯ ) 2 .
σ ^ denotes the estimated standard deviation of the residuals, calculated as σ ^ = 1 n 2 i = 1 n y i y ^ i 2 , assuming the model is fitted using ordinary least squares, and where t n 2 , 0.975 denotes the critical value from the Student’s t-distribution with n 2 degrees of freedom, corresponding to a two-tailed confidence level of 95%.
  For the log-linear robust model, the 95% confidence interval is computed using the delta method. Let y ^ = α + β x denote the log-qubit prediction. The Jacobian vector with respect to the parameters is as follows:
J ( x ) = y ^ α y ^ β = [ 1 , x ] ,
and the variance of the prediction is as follows:
Var ( y ^ ) = J ( x ) · Σ · J ( x ) ,
where Σ is the estimated covariance matrix of the fitted parameters. The resulting interval is given by the following:
y ^ ± t n 2 , 0.975 · Var ( y ^ ) ,
and transformed back to the original scale as follows:
n ^ qubits exp ( y ^ Δ ) , exp ( y ^ + Δ ) ,
where Δ = t n 2 , 0.975 · Var ( y ^ ) . A complete derivation of these expressions and additional justifications for the segment-wise log-qubit modeling can be found in Appendix D.

3.2.5. Error Metrics

We evaluate model performance using standard regression error metrics commonly employed in predictive modeling. The root mean squared error (RMSE) and the mean absolute error (MAE) are used to quantify the average magnitude of residuals, with RMSE giving greater weight to larger errors and MAE providing a more robust central tendency measure less affected by outliers [36].
To contextualize the errors concerning the scale of the observed values, we also report the mean relative error (MRE), expressed as a percentage. Additionally, we compute the relative standard deviation ( σ rel ), which captures the dispersion of predicted values normalized by their mean. These metrics provide a consistent basis for comparing model outputs across different experimental conditions.

3.3. Estimation of Toffoli Gate Count

To estimate the quantum cost, we employ a function inspired by the SelectSwap algorithm [15]. This algorithm achieves a quadratic improvement in gate counts by reducing the number of Toffoli gates to a scale of f · M , where M is the number of coefficients, and f is a multiplicative factor. Without SelectSwap, the cost grows proportionally to M and requires log ( M ) ancillary qubits.
The Toffoli gate count is estimated using the following function:
T toffoli = C 1 2 n · log 2 n ϵ + C 2 log 2 n ϵ ,
where
n = log 2 ( n coef ) , C 1 , and C 2 R .
We define the target precision ϵ as a function of fragment size, setting ϵ = n 2 b for a fragment comprising n logical qubits. Here, b denotes the resolution parameter of the quantum hardware, capturing the logarithmic relationship between numerical accuracy and the size of the Hamiltonian coefficient vector. In our experiments, we fix b = 20 , corresponding to a 20-bit precision level that reflects realistic thresholds for fault-tolerant quantum architectures. This formulation is consistent with practical accuracy requirements and aligns with resource scaling trends reported in prior studies [22].
Equation (20) expresses the asymptotic scaling of the SelectSwap algorithm and serves as a practical estimator for Toffoli gate counts in fault-tolerant quantum simulations. For all experiments, we assume constant factors C 1 = C 2 = 3 unless otherwise stated. Additional implementation details and derivations are provided in Appendix B.

3.4. Experimental Validation

To validate our analytical Toffoli-gate estimates, we employ PennyLane’s resource estimation module, available through the pennylane.labs.resource_estimation interface (Commit 5fc5d02308d25831594ecb41e4acc6f74ce2da30 on GitHub; not yet part of the stable release or fully documented at the time of our study). Using this framework, we instantiate both QROM-based state preparation circuits [37] and qubitization routines [38] for each fragment and benchmark peptide, adapting the templates to match the structure of our reduced Hamiltonians.
For each system, we extract empirical Toffoli counts and compare them against the theoretical predictions obtained from Equations (6)–(20). This experimental procedure serves to verify the internal consistency of our cost model and ensure compatibility with circuit-level resource estimators in current quantum toolchains.

4. Results

We begin by evaluating the accuracy of our fragmentation strategy via regression analysis. Figure 1 shows an exponential fit of the total number of Hamiltonian coefficients versus the electron count, including a 95% confidence interval. In addition, Figure 2 provides a complementary linear interpolation for the smallest molecules in our dataset.
Next, we quantify recombination and estimation errors. Table 1 reports fragment recombination errors across all peptides, confirming minimal error accumulation for small fragments and identifying increased errors for larger systems.
We then examine resource-scaling trends. In Figure 3, we plot both Toffoli gate counts and qubit requirements against molecular size, comparing the original full-Hamiltonian approach to our base-structure method. Table 2 summarizes these benchmarks— numbers of the coefficients, Toffoli estimates, reduction factors, and electron counts—for every fragment.
To validate regression robustness, Table 3 presents performance metrics for robust regression models (Huber with varying  ϵ and Theil–Sen) in predicting log-transformed qubit counts across small, medium, and large molecular complexity segments.
Finally, to ground our theoretical Toffoli formula (Equation (20)) in real circuit data, we measured gate counts using PennyLane’s resource_estimation module [39]. Table 4 reports these empirical gate counts alongside the derived coefficients  C 1 and  C 2 and their relative errors.
Using our regression models—linear for qubits and exponential for coefficients—we predicted the resources required to simulate a variety of proteins and peptides, including both well-known and novel examples. Our models provide the following key insights:
  • Number of coefficients ( n coef ): The number of Hamiltonian coefficients exhibits exponential growth with the number of electrons, as captured by the exponential model in Equation (11).
  • Number of Qubits ( n qubits ): the number of qubits grows moderately linearly with the number of electrons, as described by the linear model in Equation (6).
  • Number of Toffoli Gates: While fragmentation occasionally introduces overhead for small amino acids—due to duplicated setup costs and additional reassembly steps—it proves advantageous at the peptide scale, where monolithic encodings become intractable. This trade-off is acceptable, given the preservation of accuracy and the exponential savings in larger systems. However, for small systems, fragmentation maintains extremely low errors, supporting the method’s accuracy and feasibility. This suggests that, while fragmentation introduces a slight overhead in gate count for small systems, it remains a viable strategy for reducing resource requirements in larger systems.
These predictions were validated on a diverse set of intermediate systems and then extrapolated to full hormone peptides—such as Glucagon—demonstrating that the model retains predictive power across four orders of magnitude in electron count and 30 orders of Hamiltonian complexity.
To further analyze the scalability of our approach, we generated log-log plots that relate the following quantities:
  • n coef versus n electrons ,
  • Toffoli gates versus n electrons ,
  • Reduction factor versus n electrons ,
  • Total qubits versus n electrons .
These plots reveal that, although the quantum cost increases with system size, the application of fragmentation and the SelectSwap algorithm significantly mitigates this increase. Specifically, the reduction factor achieved through fragmentation keeps the gate count and qubit requirements within acceptable ranges, even for large systems. This demonstrates the effectiveness of our approach in managing the exponential scaling of quantum resources. Further details of these affirmations can be corroborated in Table 2, where the reduction in terms of coefficients and Toffoli gates of our approach is presented, both in the case of protein and amino acid fragmentation levels. These results confirm that, while quantum resource scaling remains exponential, targeted fragmentation combined with modern quantum oracles offers a tractable and chemically accurate pathway to simulate biologically meaningful molecules on future quantum hardware.
To bring the strategy of our previous work to the next level  [3], we compute the accuracy of our fragmentation strategy by comparing reference energies ( E GT ) with calculated energies ( E m ) for a set of larger peptides. Table 1 summarizes the number of electrons, orbitals, theoretical energy, computed energy, and relative error ( % R E ), starting with some small peptides included in our previous work and continuing with much larger ones to compare the change in accuracy as the system scales up. Key observations include the following:
  • Small peptides: Relative errors of 0.0005–0.0065% in dipeptides (e.g., Gly-Gly, Pro-Gly, Gly-Ala). This confirms the high accuracy of our fragmentation strategy for small systems.
  • Intermediate peptides: Some (e.g., Aspartame and Phe-Ile) exhibit slightly higher errors (up to  0.065%), confirming again the accuracy of the strategy.
  • Large systems: In molecules with hundreds of electrons (e.g., Angiotensin II and IV, Oxytocin, Glucagon), the relative error increases (between 2 and 3%), highlighting the need for further optimization strategies, even though the errors remain within acceptable limits for practical applications.
Our combined methodology—statistical modeling, hierarchical fragmentation, and quantum resource optimization—enables the accurate simulation of complex biomolecules at an unprecedented scale. These results lay the groundwork for near-term beyond applications in quantum biochemistry and offer a scalable framework compatible with fault-tolerant quantum computing architectures.

Experimental Validation

Table 4 presents a detailed comparison between theoretical Toffoli gate counts—computed via Equation (20) with fixed parameters C 1 = C 2 = 3 —and empirical counts (Toffoli*) obtained using the pennylane.labs.resource_estimation [40] module for each fragment’s qubitization circuit. Additionally, we perform an ordinary least squares (OLS) fit across all samples to extract empirical scaling coefficients C 1 and C 2 , along with their deviations. Per-fragment parameter variations under different precision settings ( ε 1 , ε 2 ) are detailed in Appendix C.

5. Discussion

The results presented demonstrate that our fragmentation–reassembly protocol effectively decomposes large protein Hamiltonians into tractable subunits while preserving overall accuracy. By applying Equation (20) with fixed parameters ( C 1 = C 2 = 3 ) and validating against PennyLane’s resource_estimation [39] (Table 4), we achieve sub-3% relative energy errors alongside reductions of up to 20 orders of magnitude in Toffoli gate counts (Table 2). This dual attainment of precision and scalability is essential for hybrid quantum–classical workflows on near-term devices.
A key strength of our methodology lies in its modular error propagation: The overall simulation error results from the additive contributions of each independently simulated fragment. Consequently, any improvement in fragment accuracy, whether through higher-order quantum algorithms (e.g., quantum phase estimation [41] or improved state preparation circuits [23], directly results in a lower global error. As logical qubit fidelity advances, we therefore anticipate convergence toward chemical precision without altering the core fragmentation scheme.
Our resource-prediction framework is underpinned by robust regression, with Huber estimators ( ϵ 2.0 ) delivering superior outlier resistance and fit quality across small, medium, and large fragment regimes (Table 3). Compared to Theil–Sen, Huber regression maintains higher R 2 values and lower MAE in log space, justifying its selection as the primary model for qubit- and gate-count estimation. The trends illustrated in Figure 3 further corroborate the consistency of these predictions across molecular sizes.
Empirical calibration refines our theoretical scaling: fitting Equation (20) to measured data yields global corrections C 1 = 2.64 , C 2 = 3.17 , reducing the mean Toffoli-count error to 11.9%. These adjustments preserve the validity of the analytical model while aligning it with practical hardware characteristics, thereby bridging theory and experiment with minimal overhead.
When benchmarked against classical fragmentation approaches (e.g. ONIOM, many-body expansions), our pipeline offers comparable or improved accuracy for small peptides and more favorable scaling for larger biomolecules. Unlike global symmetry tapering [21], which is limited due to the scarcity of protein-wide symmetries, our fragment-wise active-space identification applies universally, enhancing adaptability across diverse protein architectures.
Nonetheless, several limitations remain. Current noise and decoherence on real quantum hardware constrain immediate fault-tolerant implementation. Fragments containing atypical bonds or motifs may introduce systematic deviations; targeted corrections—guided by the QMProt dataset [33]—and refined state-preparation protocols are required to address these edge cases. Moreover, the integration of advanced subroutines will improve fragment precision at the expense of greater circuit complexity, necessitating a careful trade-off between accuracy and resource availability.
In summary, our fragmentation framework provides a scientifically rigorous, modular, and scalable blueprint for quantum simulation of biomolecules. By combining analytical modeling, empirical validation, and error modularity, we propose a scientifically grounded and practically oriented pathway toward achieving quantum advantage in real-world biochemical simulations.

6. Conclusions and Perspectives

We have presented a scalable, resource-efficient protocol for the quantum simulation of large protein systems, based on molecular fragmentation, regression-driven resource estimation, and circuit optimization via the SelectSwap algorithm.
Starting from small peptides and extending to Glucagon, our method maintains relative energy errors below 3% while reducing Toffoli gate counts by up to 20 orders of magnitude. Regression models accurately predict resource requirements and support pre-optimization of quantum workloads for both current and near-term devices.
Future work includes expanding the molecular dataset to improve model robustness, integrating advanced subroutines (e.g. QPE and optimized state preparation) to approach chemical accuracy, and benchmarking on actual hardware to evaluate noise resilience. Comparative analysis with techniques such as Hamiltonian tapering and active-space reduction will further refine the reassembly pipeline, and the modular nature of our framework ensures that hardware improvements map directly to simulation accuracy without altering the core methodology.
Our head-to-head comparison with PennyLane’s resource_estimation module [39] confirms that, once validated, it can serve as a reliable standalone estimator of circuit cost. Simulating each fragment’s qubitization circuit under the chosen precision settings can replace the explicit extraction of empirical coefficients C 1 and C 2 , simplifying future resource estimates without sacrificing rigor.
Moreover, implementing quantum phase estimation at the fragment level is expected to reduce individual fragment errors to near–chemical precision. Because the total energy error accumulates fragment-wise, improving each fragment’s precision directly lowers the global error. This property is well suited to near-term quantum processors with limited numbers of high-fidelity logical qubits.
Overall, the proposed strategy offers a practical and verifiable route to simulate increasingly large biomolecules, aligning with the current trajectory of quantum hardware development and providing a clear framework for ongoing methodological enhancement.

Author Contributions

Conceptualization, P.A.-A. and L.C.S.; Methodology, P.A.-A. and L.C.S.; Software, P.A.-A.; Validation, P.A.-A. and L.C.S.; Formal Analysis, P.A.-A. and L.C.S.; Investigation, P.A.-A. and L.C.S.; Resources, P.A.-A.; Data Curation, P.A.-A. and L.C.S.; Writing—Original Draft Preparation, P.A.-A.; Writing—Review and Editing, P.A.-A. and L.C.S.; Visualization, P.A.-A. and L.C.S.; Supervision, P.A.-A.; Project Administration, P.A.-A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The QMProt dataset is publicly available on the Pennylane platform for direct integration with quantum computing pipelines. It can be accessed at: https://pennylane.ai/datasets/collection/qmprot (accessed on 19 May 2025).

Acknowledgments

The authors gratefully acknowledge Guillermo Alonso-Linaje and Diego Guala for their valuable comments and discussions during the development of this project. We also extend our special thanks to the Pennylane team for their ongoing work on the resource_estimation module and for providing helpful guidance that supported the validation and implementation phases of this study.

Conflicts of Interest

Authors Parfait Atchade-Adelomou and Laia Coronas Sala were employed by Lighthouse Disruptive Innovation Group (LDIG). The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Appendix A. Source Code

The Python scripts used for model fitting, Toffoli gate estimation, and comparisons between full and fragmented simulations are publicly available at https://github.com/pifparfait/qmprot_strategy (accessed on 19 May 2025).

Appendix B. T-Gate Count from the Big-O Bound

We translate the Big-O bound from the reference [22] on the T-gate count into an explicit formula with constant factors. Specifically, the T-gate count required to implement the quantum lookup table is given by
T total ( n , ε ) = C 1 2 n ln 1 ε + C 2 ln 1 ε ,
where n = log 2 ( N ) is the number of address qubits for a lookup table with N entries, and ε denotes the allowable error tolerance in the state preparation. The constants C 1 and C 2 depend on the gate decomposition and error-correction protocols [22].
This formula underpins the analysis in Section 3 and is directly used to estimate the quantum resource cost for each molecule (see Table 2).
The asymptotic bound is given by
O 2 n ln 1 ε + ln 1 ε ,
which implies that, for a sufficiently large n and small ε , there exist constants C 1 , C 2 > 0 , such that
T total ( n , ε ) C 1 2 n ln 1 ε + C 2 ln 1 ε .
Our goal is to determine these constant factors explicitly. Following the work developed in [22], the partition the memory into blocks of size is given by
λ = 2 n ,
so that the number of blocks is
2 n λ = 2 n 2 n = 2 n .
Each block is processed via a quantum routing tree using non-Clifford operations (e.g., CSWAP or Toffoli gates). Let K 1 denote the T-gate cost per block, which includes the decomposition cost (e.g., a Toffoli gate typically decomposes into about 7 T-gates [22,42]) and an extra factor of ln ( 1 / ε ) due to error suppression. Hence, the T-gate cost per block is
T block K 1 ln 1 ε .
After multiplying by the number of blocks in Equation (A3), the primary query cost is
T query K 1 2 n ln 1 ε = K 1 2 n ln 1 ε .
We set
C 1 = K 1 .
Ancillary operations (uncomputing and error correction, e.g., via entanglement distillation [22]) contribute a cost proportional to ln ( 1 / ε ) . Let K 2 be the unit cost for these operations; then,
T aux K 2 ln 1 ε .
We define
C 2 = K 2 .
Adding Equations (A5) and (A6) yields equation Equation (A1)
Two key insights justify this formula:
1.
An optimal block partitioning ( λ = 2 n ) results in 2 n iterations, each costing K 1 ln ( 1 / ε ) T–gates [22].
2.
Ancillary operations add an overhead scaling linearly with ln ( 1 / ε )  [22].
The value of C 1 is influenced by the cost of decomposing complex non-Clifford operations. While a raw Toffoli gate might require approximately 7 T-gates [22,42], the unified architecture integrates several optimizations (e.g., reducing SWAP overhead, parallel processing, and gate cancellations) that lower the effective cost per block. Empirical and theoretical analyses in [22] and related literature (including [15,42,43]) support an effective value for C 1 in the range of 3 to 10. Similarly, C 2 reflects the cost of auxiliary operations for amplitude amplification and uncomputing. The procedure in [22] applies two such operations per query, each with a low, nearly constant T–gate cost (typically around 1 T–gate), leading to C 2 2 .
The expression in Equation (A1) is essential for precise resource estimation in fault-tolerant quantum implementations of lookup tables and is supported by the detailed analyses in [22].

Appendix C. Per-Fragment Coefficient Determination

This appendix rigorously derives the empirical coefficients C 1 , i and C 2 , i employed in Equation (20) and reported in Table 4 of the main text. It supplements the study by formalizing the relation between the measured Toffoli counts and the theoretical scaling parameters.
Let i index each Hamiltonian fragment, with the following:
  • m i = # coefs i , the number of Hamiltonian terms (input).
  • n i = log 2 m i , the required qubit-index width.
Two precision settings b 1 , b 2 are chosen a priori to probe sensitivity:
ε k = n i 2 b k , b 1 = 20 , b 2 = 18 .
For each ( i , k ) , compute the auxiliary variables:
X 1 , i ( k ) = 2 n i log 2 n i ε k ,
X 2 , i ( k ) = log 2 n i ε k .
Denote with T i ( ) ( k ) the Toffoli count measured via PennyLane’s resource_estimation under precision  ε k (input). The linear model for each fragment is as follows:
T i ( ) ( k ) = C 1 , i X 1 , i ( k ) + C 2 , i X 2 , i ( k ) , k = 1 , 2 .
Solving the 2 × 2 system yields closed-form expressions:
C 1 , i = T i ( ) ( 1 ) X 2 , i ( 2 ) T i ( ) ( 2 ) X 2 , i ( 1 ) X 1 , i ( 1 ) X 2 , i ( 2 ) X 1 , i ( 2 ) X 2 , i ( 1 ) ,
C 2 , i = T i ( ) ( 2 ) X 1 , i ( 1 ) T i ( ) ( 1 ) X 1 , i ( 2 ) X 1 , i ( 1 ) X 2 , i ( 2 ) X 1 , i ( 2 ) X 2 , i ( 1 ) .
In practice, the global constants ( C 1 , C 2 ) reported in Table 4 are obtained via a least-squares fit across all fragments:
( C ^ 1 , C ^ 2 ) = arg min C 1 , C 2 i k = 1 2 T i ( ) ( k ) ( C 1 X 1 , i ( k ) + C 2 X 2 , i ( k ) ) 2 .

Appendix D. Regression Model Analysis for Qubits

This appendix presents a regression-based analysis to estimate the number of quantum qubits required to simulate molecular systems, based on their electron count. In contrast to classical approaches relying on ordinary least squares (OLSs), we adopt robust regression techniques—namely the Huber regressor and Theil–Sen estimator—combined with molecular segmentation to improve stability and resistance to outliers.

Appendix D.1. Model Formulation

We consider a log-linear model relating the number of logical qubits n qubits to the number of electrons n electrons :
log ( n qubits ) = α + β · n electrons + ε ,
where α and β are regression coefficients and ε is a residual error term. This formulation enables exponential growth in qubit requirements while allowing for linear estimation in the log-domain.
Robust estimators were employed to mitigate the influence of outliers in the training data. Additionally, the dataset was segmented into three groups based on the electron count:
  • Small: n electrons 150
  • Medium: 151 n electrons 500
  • Large: n electrons > 500
The predicted qubit counts are then obtained by exponentiating the log prediction:
n ^ qubits = exp ( α + β · n electrons ) .

Appendix D.2. Evaluation Metrics

To assess model performance, we compute the coefficient of determination R 2 , defined as follows:
R 2 = 1 i ( y i y ^ i ) 2 i ( y i y ¯ ) 2 ,
where y i and y ^ i represent the observed and predicted log ( n qubits ) values, respectively.
We further report the following:
MAE = 1 n i = 1 n | y i y ^ i | ,
RMSE = 1 n i = 1 n ( y i y ^ i ) 2 ,
σ = 1 n i = 1 n ( y i y ^ i ε ¯ ) 2 ,
CV = σ y ^ ¯ · 100 .

Appendix D.3. Confidence Interval (95%) via Delta Method

For the log-linear model, 95% confidence intervals are computed using the delta method. Let y ^ = α + β x be the predicted log ( n qubits ) for a given electron count x. The Jacobian vector is as follows:
J ( x ) = y ^ α y ^ β = [ 1 , x ] ,
and the variance of the prediction is as follows:
Var ( y ^ ) = J ( x ) · Σ · J ( x ) ,
where Σ is the parameter covariance matrix. The 95% confidence interval in log-space is as follows:
y ^ ± t n 2 , 0.975 · Var ( y ^ ) ,
which is back-transformed to yield the following:
n ^ qubits exp ( y ^ Δ ) , exp ( y ^ + Δ ) ,
where Δ = t n 2 , 0.975 · Var ( y ^ ) , and t n 2 , 0.975 is the t-quantile with n 2 degrees of freedom for a two-tailed 95% confidence level.
The use of log-linear robust regression models across molecular segments improves the consistency of predictions and their interpretability.

References

  1. Bryce, R.A. What Next for Quantum Mechanics in Structure-Based Drug Discovery? Methods Mol. Biol. 2020, 2114, 339–353. [Google Scholar] [CrossRef] [PubMed]
  2. Baiardi, A.; Christandl, M.; Reiher, M. Quantum Computing for Molecular Biology. Chembiochem 2023, 24, e202300120. [Google Scholar] [CrossRef]
  3. Sala, L.C.; Atchade-Adelemou, P. Efficient Protein Ground State Energy Computation via Fragmentation and Reassembly. arXiv 2025, arXiv:2501.03766. [Google Scholar]
  4. Li, S.; Li, W.; Jiang, Y. Generalized energy-based fragmentation approach for computing the ground-state energies and properties of large molecules. J. Phys. Chem. A 2007, 111, 2193–2199. [Google Scholar] [CrossRef] [PubMed]
  5. Deev, V.; Collins, M.A. Approximate ab initio energies by systematic molecular fragmentation. J. Chem. Phys. 2005, 122, 154102. [Google Scholar] [CrossRef]
  6. Bettens, R.P.A.; Lee, A.M. Accurately reproducing ab initio electrostatic potentials with multipoles and fragmentation. J. Phys. Chem. A 2006, 110, 8777. [Google Scholar] [CrossRef]
  7. Atchade-Adelomou, P. Quantum algorithms for solving hard constrained optimisation problems. arXiv 2022, arXiv:2202.13125. [Google Scholar]
  8. Reiher, M.; Wiebe, N.; Svore, K.M.; Wecker, D.; Troyer, M. Elucidating reaction mechanisms on quantum computers. Proc. Natl. Acad. Sci. USA 2017, 114, 7555–7560. [Google Scholar] [CrossRef]
  9. Hohenberg, P.; Kohn, W. Density functional theory (DFT). Phys. Rev 1964, 136, B864. [Google Scholar] [CrossRef]
  10. Evangelisti, S.; Bendazzoli, G.L.; Gagliardi, L. Complete active-space configuration interaction with optimized orbitals: Application to Li2. Int. J. Quantum Chem. 1995, 55, 277–280. [Google Scholar] [CrossRef]
  11. McArdle, S.; Endo, S.; Aspuru-Guzik, A.; Benjamin, S.C.; Yuan, X. Quantum computational chemistry. Rev. Mod. Phys. 2020, 92, 015003. [Google Scholar] [CrossRef]
  12. Yang, P.J.; Sugiyama, M.; Tsuda, K.; Yanai, T. Artificial neural networks applied as molecular wave function solvers. J. Chem. Theory Comput. 2020, 16, 3513–3529. [Google Scholar] [CrossRef] [PubMed]
  13. Cao, Y.; Romero, J.; Olson, J.P.; Degroote, M.; Johnson, P.D.; Kieferová, M.; Kivlichan, I.D.; Menke, T.; Peropadre, B.; Sawaya, N.P.; et al. Quantum chemistry in the age of quantum computing. Chem. Rev. 2019, 119, 10856–10915. [Google Scholar] [CrossRef]
  14. Wecker, D.; Bauer, B.; Clark, B.K.; Hastings, M.B.; Troyer, M. Gate-count estimates for performing quantum chemistry on small quantum computers. Phys. Rev. A 2014, 90, 022305. [Google Scholar] [CrossRef]
  15. Low, G.H.; Kliuchnikov, V.; Schaeffer, L. Trading T gates for dirty qubits in state preparation and unitary synthesis. Quantum 2024, 8, 1375. [Google Scholar] [CrossRef]
  16. Kitaura, K.; Ikeo, E.; Asada, T.; Nakano, T.; Uebayasi, M. Fragment Molecular Orbital Method: An Approximate Computational Method for Large Molecules. Chem. Phys. Lett. 1999, 313, 701–706. [Google Scholar] [CrossRef]
  17. Morokuma, M.; collaborators. ONIOM: A Multilayered Integrated MO + MM Method. J. Mol. Struct. 1999, 461–462, 1–21. [Google Scholar]
  18. ApSimon, J.; J. Bearpark, R. Adaptive QM/MM Methods for Chemical Reaction Dynamics. WIREs Comput. Mol. Sci. 2023, 13, e1618. [Google Scholar]
  19. Bowling, P.E.; Broderick, D.R.; Herbert, J.M. Convergent Protocols for Computing Protein–Ligand Interaction Energies Using Fragment-Based Quantum Chemistry. J. Chem. Theory Comput. 2023, 19, 3656–3670. [Google Scholar] [CrossRef]
  20. Vornweg, J.R.; Wolter, M.; Jacob, C.R. A simple and consistent quantum-chemical fragmentation scheme for proteins that includes two-body contributions. J. Chem. Theory Comput. 2022, 18, 4516–4527. [Google Scholar] [CrossRef]
  21. Bravyi, S.; Gambetta, J.M.; Mezzacapo, A.; Temme, K. Tapering off qubits to simulate fermionic Hamiltonians. arXiv 2017. [Google Scholar] [CrossRef]
  22. Zhu, S.; Sundaram, A.; Low, G.H. Unified architecture for a quantum lookup table. arXiv 2024, arXiv:2406.18030. [Google Scholar]
  23. Fomichev, S.; Hejazi, K.; Zini, M.S.; Kiser, M.; Fraxanet, J.; Casares, P.A.M.; Delgado, A.; Huh, J.; Voigt, A.C.; Mueller, J.E.; et al. Initial state preparation for quantum chemistry on quantum computers. PRX Quantum 2024, 5, 040339. [Google Scholar] [CrossRef]
  24. Gosset, D.; Kothari, R.; Wu, K. Quantum state preparation with optimal T-count. arXiv 2024, arXiv:2411.04790. [Google Scholar]
  25. Carrera Vazquez, A.; Woerner, S. Efficient state preparation for quantum amplitude estimation. Phys. Rev. Appl. 2021, 15, 034027. [Google Scholar] [CrossRef]
  26. von Burg, V.; Low, G.H.; Häner, T.; Steiger, D.S.; Reiher, M.; Roetteler, M.; Troyer, M. Quantum computing enhanced computational catalysis. Phys. Rev. Res. 2021, 3. [Google Scholar] [CrossRef]
  27. Schollwöck, U. The density-matrix renormalization group. Rev. Mod. Phys. 2005, 77, 259–315. [Google Scholar] [CrossRef]
  28. Perez-Garcia, D.; Verstraete, F.; Wolf, M.M.; Cirac, J.I. Matrix product state representations. arXiv 2006. [Google Scholar] [CrossRef]
  29. Orús, R.; Mugel, S.; Lizaso, E. Tensor Networks for Complex Quantum Systems. Nat. Rev. Phys. 2019, 1, 538–550. [Google Scholar] [CrossRef]
  30. Chan, G.K.L.; Zgid, D. The Density Matrix Renormalization Group in Quantum Chemistry. Annu. Rep. Comput. Chem. 2009, 5, 149–162. [Google Scholar]
  31. Møller, C.; Plesset, M.S. Note on an Approximation Treatment for Many-Electron Systems. Phys. Rev. 1934, 46, 618–622. [Google Scholar] [CrossRef]
  32. Zou, H.; Magnusson, E.; Brunander, H.; Dobrautz, W.; Rahm, M. Multireference error mitigation for quantum computation of chemistry. arXiv 2025. [Google Scholar] [CrossRef]
  33. Sala, L.C.; Atchade-Adelomou, P. QMProt: A Comprehensive Dataset of Quantum Properties for Proteins. arXiv 2025, arXiv:2505.08956. [Google Scholar]
  34. Huber, P.J. Robust estimation of a location parameter. In Breakthroughs in Statistics: Methodology and Distribution; Springer: Berlin/Heidelberg, Germany, 1992; pp. 492–518. [Google Scholar]
  35. Theil, H. A rank-invariant method of linear and polynomial regression analysis. Indag. Math. 1950, 12, 173. [Google Scholar]
  36. Hyndman, R.J.; Koehler, A.B. Another look at measures of forecast accuracy. Int. J. Forecast. 2006, 22, 679–688. [Google Scholar] [CrossRef]
  37. PennyLaneAI Development Team. test_qrom_state_prep.py: QROM State Preparation Test. Available online: https://github.com/PennyLaneAI/pennylane/blob/qrom_state_prep/tests/templates/test_state_preparations/test_qrom_state_prep.py (accessed on 17 June 2025).
  38. PennyLaneAI Development Team. test_resource_qubitization.py: Resource Qubitization Test. 2025. Available online: https://github.com/PennyLaneAI/pennylane/blob/5fc5d02308d25831594ecb41e4acc6f74ce2da30/pennylane/labs/tests/resource_estimation/templates/test_resource_qubitization.py (accessed on 17 June 2025).
  39. Xanadu Quantum Technologies Inc. qml.labs.resource_estimation—PennyLane 0.41.1 Documentation. 2024. Available online: https://docs.pennylane.ai/en/stable/code/api/pennylane.labs.resource_estimation.html (accessed on 16 June 2025).
  40. contributors, P. pennylane.labs.resource_estimation: Resource Estimation Module. 2025. Available online: https://github.com/PennyLaneAI/pennylane/tree/5fc5d02308d25831594ecb41e4acc6f74ce2da30/pennylane/labs (accessed on 16 June 2025).
  41. Kitaev, A.Y. Quantum measurements and the Abelian stabilizer problem. arXiv 1995. [Google Scholar] [CrossRef]
  42. Amy, M.; Maslov, D.; Mosca, M.; Roetteler, M. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. IEEE Trans.-Comput.-Aided Des. Integr. Circuits Syst. 2013, 32, 818–830. [Google Scholar] [CrossRef]
  43. Ross, N.J.; Selinger, P. Optimal ancilla-free Clifford+ T approximation of z-rotations. arXiv 2014, arXiv:1403.2975. [Google Scholar]
Figure 1. Scaling of quantum resource requirements with electron count, shown on log–log axes with 95% confidence intervals. (Left) Exponential regression of Hamiltonian coefficient counts versus number of electrons. Experimental data (filled circles), fitted model (solid line), and fragmentation-based predictions (open circles) are plotted. (Right) Linear regression of qubit requirements versus electron count, including measured values (filled circles), regression line (solid), and fragmentation estimates (open). Shaded bands in both panels represent the 95% confidence intervals of the fits.
Figure 1. Scaling of quantum resource requirements with electron count, shown on log–log axes with 95% confidence intervals. (Left) Exponential regression of Hamiltonian coefficient counts versus number of electrons. Experimental data (filled circles), fitted model (solid line), and fragmentation-based predictions (open circles) are plotted. (Right) Linear regression of qubit requirements versus electron count, including measured values (filled circles), regression line (solid), and fragmentation estimates (open). Shaded bands in both panels represent the 95% confidence intervals of the fits.
Electronics 14 02601 g001
Figure 2. Linear fit of the required qubits ( n qubits ) as a function of the number of electrons ( n electrons ), using data from QMProt [33]. Blue markers denote empirical values, the orange line represents the fitted model n qubits = α + β n electrons , and the shaded band indicates the 95% confidence interval. The nearly linear relationship provides a useful estimate of qubit requirements as system size increases.
Figure 2. Linear fit of the required qubits ( n qubits ) as a function of the number of electrons ( n electrons ), using data from QMProt [33]. Blue markers denote empirical values, the orange line represents the fitted model n qubits = α + β n electrons , and the shaded band indicates the 95% confidence interval. The nearly linear relationship provides a useful estimate of qubit requirements as system size increases.
Electronics 14 02601 g002
Figure 3. Predicted quantum resource requirements as a function of the number of electrons. (Top-left) exponential model of coefficient growth. (Top-right) linear model for qubit requirements. (Bottom-left) estimated Toffoli gate counts based on predicted coefficients. (Bottom-right) total qubit requirements. Shaded regions indicate 95% confidence intervals. These trends support the scalability of the resource model across molecular sizes.
Figure 3. Predicted quantum resource requirements as a function of the number of electrons. (Top-left) exponential model of coefficient growth. (Top-right) linear model for qubit requirements. (Bottom-left) estimated Toffoli gate counts based on predicted coefficients. (Bottom-right) total qubit requirements. Shaded regions indicate 95% confidence intervals. These trends support the scalability of the resource model across molecular sizes.
Electronics 14 02601 g003
Table 1. Summary of electrons, orbitals, theoretical energy (GT), calculated energy (Em), and relative error (%RE) for different peptides.
Table 1. Summary of electrons, orbitals, theoretical energy (GT), calculated energy (Em), and relative error (%RE) for different peptides.
PeptidesElectronsOrbitalsGTEm%RE
Gly-Gly7053 4.83 × 10 2 4.83 × 10 2 4.00 × 10 3
Gly-Ala7860 5.22 × 10 2 5.22 × 10 2 3.16 × 10 3
Glu-Gly10882 7.45 × 10 2 7.45 × 10 2 2.52 × 10 3
Ser-Cys11081 1.03 × 10 3 1.03 × 10 3 1.58 × 10 3
Carnosine (Ala-His)12094 7.81 × 10 2 7.81 × 10 2 1.94 × 10 3
Gly-Ser8665 5.96 × 10 2 5.96 × 10 2 2.62 × 10 3
Pro-Gly9272 5.98 × 10 2 5.98 × 10 2 3.33 × 10 3
Cystine (Cys-Cys)12690 1.42 × 10 3 1.42 × 10 3 5.40 × 10 4
Leu-Thr126100 7.89 × 10 2 7.89 × 10 2 1.82 × 10 3
Gly-Val-Ala132104 8.42 × 10 2 8.42 × 10 2 3.59 × 10 3
Thr-Lys134106 8.43 × 10 2 8.43 × 10 2 1.88 × 10 3
Val-Ala-Ser148116 9.54 × 10 2 9.54 × 10 2 3.09 × 10 3
Phe-Ile150122 9.03 × 10 2 9.03 × 10 2 1.60 × 10 3
Ser-Gly-Glu154117 1.06 × 10 3 1.06 × 10 3 3.40 × 10 3
Aspartame (Asp-Phe)156123 1.01 × 10 3 1.01 × 10 3 5.00 × 10 2
Tyr-Asp156121 1.05 × 10 3 1.05 × 10 3 1.47 × 10 3
Glutathione (Cys-Glu-Gly)162121 1.38 × 10 3 1.38 × 10 3 2.34 × 10 3
Arg-Met164127 1.31 × 10 3 1.31 × 10 3 1.02 × 10 3
Val-Asp-Ser170131 1.14 × 10 3 1.14 × 10 3 2.71 × 10 3
Gly-His-Lys182144 1.16 × 10 3 1.16 × 10 3 2.94 × 10 3
Trp-His180144 1.14 × 10 3 1.14 × 10 3 1.84 × 10 3
Tyr-Arg180143 1.14 × 10 3 1.14 × 10 3 1.43 × 10 3
His-Arg-Val220175 1.38 × 10 3 1.38 × 10 3 2.01 × 10 3
Tuftsin (Thr-Lys-Pro-Arg)270215 1.64 × 10 3 1.68 × 10 3 2.84
Methionine-enkephalin (Tyr-Gly-Gly-Phe-Met)304239 2.16 × 10 3 2.21 × 10 3 2.06
Leucine-enkephalin (Tyr-Gly-Gly-Phe-Leu)296237 1.81 × 10 3 1.85 × 10 3 2.59
Oxytocin (Cys-Tyr-Ile-Gln-Asn-Cys-Pro-Leu–Gly)536419 3.84 × 10 3 3.91 × 10 3 1.85
Opiorphin (Gln-Arg-Phe-Ser-Arg)558446 2.29 × 10 3 2.35 × 10 3 2.53
Bradykinin (Arg-Pro-Pro-Gly-Phe-Ser-Pro-Phe-Arg)566453 3.43 × 10 3 3.53 × 10 3 2.92
Neurotensin (Glu-Leu-Tyr-Glu-Asn-Lys-Pro-Arg-Arg-Pro-Tyr-Ile-Leu)896716 5.43 × 10 3 5.27 × 10 3 2.83
Gastrin-14 (Trp-Leu-Glu-Glu-Glu-Glu-Glu-Ala-Tyr-Gly-Trp-Met-Asp-Phe)970763 6.39 × 10 3 6.25 × 10 3 2.31
Angiotensin IV (Val-Tyr-Ile-His-Pro-Phe)414334 2.47 × 10 3 2.55 × 10 3 2.98
Angiotensin II (Asp-Arg-Val-Tyr-Ile-His-Pro-Phe)558446 3.40 × 10 3 3.49 × 10 3 2.83
Angiotensin I (Asp-Arg-Val-Tyr-Ile-His-Pro-Phe-His-Leu)692554 4.19 × 10 3 4.32 × 10 3 2.97
Glucagon (His-Ser-Gln-Gly-Thr-Phe-Thr-Ser-Asp-Tyr-Ser-Lys-Tyr-
Leu-Asp-Ser-Arg-Arg-Ala-Gln-Asp-Phe-Val-Gln-Trp-Leu-Met-Asn-Thr)18521459 1.18 × 10 4 1.22 × 10 4 2.80
Table 2. Resource comparison for peptide simulations: theoretical Toffoli gate estimates using the full Hamiltonian ( C 1 = C 2 = 3 ) versus the proposed fragmentation–reassembly (base-structure) approach. For each molecule and version (Ver.: Orig. = Original; Prop. = Proposed), the table lists the number of Hamiltonian coefficients (# Coeffs.), the estimated Toffoli gate count, the Toffoli reduction factor (Red. (Toffoli)), the electron count (when available), and the coefficient reduction factor (Red. (Coeff.)).
Table 2. Resource comparison for peptide simulations: theoretical Toffoli gate estimates using the full Hamiltonian ( C 1 = C 2 = 3 ) versus the proposed fragmentation–reassembly (base-structure) approach. For each molecule and version (Ver.: Orig. = Original; Prop. = Proposed), the table lists the number of Hamiltonian coefficients (# Coeffs.), the estimated Toffoli gate count, the Toffoli reduction factor (Red. (Toffoli)), the electron count (when available), and the coefficient reduction factor (Red. (Coeff.)).
MoleculesVer.# Coeffs.ToffoliRed. (Toffoli)ElectronsRed. (Coeff.)
AlanineOrig. 2.73 × 10 6 2.02 × 10 4 - 4.80 × 10 1 -
R_ala + Base StructuresProp. 5.79 × 10 4 2.59 × 10 3 7.80 4.72 × 10 1
HistidineOrig. 2.38 × 10 7 5.67 × 10 4 - 8.20 × 10 1 -
R_his + Base StructuresProp. 2.03 × 10 6 1.43 × 10 4 3.96 1.17 × 10 1
LeucineOrig. 1.62 × 10 7 4.02 × 10 4 - 7.20 × 10 1 -
R_leu + Base StructuresProp. 5.76 × 10 5 1.02 × 10 4 3.96 2.81 × 10 1
IsoleucineOrig. 1.64 × 10 7 4.02 × 10 4 - 7.20 × 10 1 -
R_ile + Base StructuresProp. 5.76 × 10 5 1.02 × 10 4 3.96 2.84 × 10 1
LysineOrig. 2.39 × 10 7 5.67 × 10 4 - 8.00 × 10 1 -
R_lys + Base StructuresProp. 2.25 × 10 6 2.02 × 10 4 2.82 1.06 × 10 1
MethionineOrig. 1.78 × 10 7 5.67 × 10 4 - 8.00 × 10 1 -
R_met + Base StructuresProp. 5.63 × 10 5 1.02 × 10 4 5.64 3.16 × 10 1
PhenylalanineOrig. 3.61 × 10 7 8.01 × 10 4 - 8.80 × 10 1 -
R_phe + Base StructuresProp. 3.78 × 10 6 2.02 × 10 4 3.99 9.56
ThreonineOrig. 8.36 × 10 6 2.58 × 10 4 - 6.40 × 10 1 -
R_thr + Base StructuresProp. 1.06 × 10 5 3.90 × 10 3 7.91 7.92 × 10 1
TryptophanOrig. 9.24 × 10 7 6.11 × 10 4 - 1.08 × 10 2 -
R_trp + Base StructuresProp. 1.49 × 10 7 9.54 × 10 3 2.83 6.19
ValineOrig. 9.82 × 10 6 2.58 × 10 4 - 6.40 × 10 1 -
R_val + Base StructuresProp. 3.98 × 10 5 3.89 × 10 3 5.63 2.47 × 10 1
ArginineOrig. 4.36 × 10 7 8.01 × 10 4 - 9.40 × 10 1 -
R_arg + Base StructuresProp. 5.47 × 10 6 3.13 × 10 4 2.56 7.97
CysteineOrig. 6.19 × 10 6 2.38 × 10 4 - 6.60 × 10 1 -
R_cys + Base StructuresProp. 1.56 × 10 5 4.82 × 10 3 5.62 3.97 × 10 1
GlutamineOrig. 1.83 × 10 7 5.67 × 10 4 - 7.80 × 10 1 -
R_gln + Base StructuresProp. 8.73 × 10 5 1.43 × 10 4 5.64 2.09 × 10 1
AsparagineOrig. 1.13 × 10 7 3.79 × 10 4 - 7.00 × 10 1 -
R_asn + Base StructuresProp. 3.45 × 10 5 6.97 × 10 3 5.63 3.28 × 10 1
TyrosineOrig. 4.85 × 10 7 8.00 × 10 4 - 9.60 × 10 1 -
R_tyr + Base StructuresProp. 4.32 × 10 6 3.17 × 10 4 2.52 1.12 × 10 1
SerineOrig. 4.53 × 10 6 2.00 × 10 4 - 5.60 × 10 1 -
R_ser + Base StructuresProp. 9.70 × 10 4 4.82 × 10 3 7.91 4.67 × 10 1
GlycineOrig. 1.16 × 10 6 1.43 × 10 4 - 4.00 × 10 1 -
R_gly + Base StructuresProp. 5.60 × 10 4 3.38 × 10 3 5.58 2.08 × 10 1
Aspartic_AcidOrig. 1.05 × 10 7 3.79 × 10 4 - 7.00 × 10 1 -
R_asp + Base StructuresProp. 4.31 × 10 5 6.97 × 10 3 5.63 2.45 × 10 1
Glutamic_AcidOrig. 1.72 × 10 7 5.67 × 10 4 - 7.80 × 10 1 -
R_glu + Base StructuresProp. 1.22 × 10 6 1.43 × 10 4 3.99 1.41 × 10 1
ProlineOrig. 8.37 × 10 6 2.58 × 10 4 - 6.20 × 10 1 -
R_pro + Base StructuresProp. 1.29 × 10 5 4.82 × 10 3 7.91 6.48 × 10 1
GlucagonOrig. 4.33 × 10 48 3.24 × 10 25 - 1.85 × 10 3 -
Amino acids - GlucagonProp. 5.02 × 10 8 3.11 × 10 5 1.04 × 10 20 8.63 × 10 39
OxytocinOrig. 8.85 × 10 17 1.44 × 10 10 - 5.36 × 10 2 -
Amino acids - OxytocinProp. 1.31 × 10 8 1.55 × 10 5 9.26 × 10 4 6.76 × 10 9
VasopressinOrig. 7.81 × 10 31 1.21 × 10 17 - 1.13 × 10 3 -
Amino acids - VasopressinProp. 1.76 × 10 8 2.20 × 10 5 5.50 × 10 11 4.44 × 10 23
Angiotensin IIOrig. 2.88 × 10 18 2.88 × 10 10 - 5.58 × 10 2 -
Amino acids - Angiotensin IIProp. 1.93 × 10 8 2.20 × 10 5 1.31 × 10 5 1.49 × 10 10
KyotorphinOrig. 4.41 × 10 9 1.24 × 10 6 - 1.80 × 10 2 -
Amino acids - KyotorphinProp. 8.84 × 10 7 1.55 × 10 5 8.00 5.00 × 10 1
Methionine-enkephalinOrig. 3.44 × 10 12 2.81 × 10 7 - 3.04 × 10 2 -
Amino acids - Methionine-enkephalinProp. 1.03 × 10 8 1.55 × 10 5 1.81 × 10 2 3.34 × 10 4
Leucine-enkephalinOrig. 2.24 × 10 12 2.81 × 10 7 - 2.96 × 10 2 -
Amino acids - Leucine-enkephalinProp. 1.01 × 10 8 1.55 × 10 5 1.81 × 10 2 2.21 × 10 4
TuftsinOrig. 5.54 × 10 11 1.41 × 10 7 - 2.70 × 10 2 -
Amino acids - TuftsinProp. 8.22 × 10 7 1.55 × 10 5 9.05 × 10 1 6.74 × 10 3
OpiorphinOrig. 1.19 × 10 14 1.59 × 10 8 - 3.70 × 10 2 -
Amino acids - OpiorphinProp. 1.42 × 10 8 2.20 × 10 5 7.24 × 10 2 8.37 × 10 5
Angiotensin IVOrig. 1.26 × 10 15 6.37 × 10 8 - 4.14 × 10 2 -
Amino acids - Angiotensin IVProp. 1.41 × 10 8 2.20 × 10 5 2.90 × 10 3 8.95 × 10 6
NeurotensinOrig. 2.20 × 10 26 2.36 × 10 14 - 8.96 × 10 2 -
Amino acids - NeurotensinProp. 3.12 × 10 8 3.11 × 10 5 7.59 × 10 8 7.05 × 10 17
BradykininOrig. 4.43 × 10 18 2.88 × 10 10 - 5.66 × 10 2 -
Amino acids - BradykininProp. 1.86 × 10 8 2.20 × 10 5 1.31 × 10 5 2.38 × 10 10
Angiotensin IOrig. 3.84 × 10 21 9.22 × 10 11 - 6.92 × 10 2 -
Amino acids - Angiotensin IProp. 2.33 × 10 8 2.20 × 10 5 4.19 × 10 6 1.64 × 10 13
Gastrin-14Orig. 7.03 × 10 23 1.02 × 10 13 - 7.89 × 10 2 -
Amino acids - Gastrin-14Prop. 2.17 × 10 8 2.20 × 10 5 6.37 × 10 7 3.23 × 10 15
GLU_CYS_GLYOrig. 5.47 × 10 9 8.95 × 10 5 - 1.62 × 10 2 -
Amino acids - GLU_CYS_GLYProp. 2.46 × 10 7 5.67 × 10 4 1.58 × 10 1 2.23 × 10 2
ALA_HISOrig. 3.01 × 10 8 2.25 × 10 5 - 1.20 × 10 2 -
Amino acids - ALA_HISProp. 2.66 × 10 7 5.67 × 10 4 4.00 1.13 × 10 1
PRO_GLY_PROOrig. 1.87 × 10 9 4.49 × 10 5 - 1.82 × 10 2 -
Amino acids - PRO_GLY_PROProp. 1.79 × 10 7 4.49 × 10 4 7.99 1.04 × 10 2
GLY_HIS_LYSOrig. 1.44 × 10 10 1.26 × 10 6 - 1.44 × 10 2 -
Amino acids - GLY_HIS_LYSProp. 4.89 × 10 7 8.01 × 10 4 1.58 × 10 1 2.94 × 10 2
Table 3. Comparison of regression models (Huber and Theil–Sen) for predicting log-transformed qubit counts across molecular complexity segments. Metrics include R 2 , the cross-validated R 2 (when applicable), the MAE, the RMSE, the standard deviation, and the coefficient of variation. Segment-specific modeling reveals performance variation by molecular size. Cross-validation scores are omitted (–) where data scarcity limits statistical significance.
Table 3. Comparison of regression models (Huber and Theil–Sen) for predicting log-transformed qubit counts across molecular complexity segments. Metrics include R 2 , the cross-validated R 2 (when applicable), the MAE, the RMSE, the standard deviation, and the coefficient of variation. Segment-specific modeling reveals performance variation by molecular size. Cross-validation scores are omitted (–) where data scarcity limits statistical significance.
SegmentModelR2 TotalR2 CVMAE (log)RMSE (log)Std Dev (log)CV (%)
Small (≤150)Huber ϵ = 1.1 0.9220.8070.0570.0810.2886.059
Small (≤150)Huber ϵ = 1.35 0.9250.8240.0570.0790.2886.059
Small (≤150)Huber ϵ = 1.75 0.9290.8280.0560.0760.2886.059
Small (≤150)Huber ϵ = 2.0 0.9310.8310.0570.0760.2886.059
Small (≤150)Theil–Sen0.9270.8060.0560.0780.2886.059
Medium (151–500)Huber ϵ = 1.1 0.9780.0390.0510.3475.741
Medium (151–500)Huber ϵ = 1.35 0.9830.0420.0450.3475.741
Medium (151–500)Huber ϵ = 1.75 0.9830.0420.0460.3475.741
Medium (151–500)Huber ϵ = 2.0 0.9830.0420.0460.3475.741
Medium (151–500)Theil–Sen0.9770.0410.0520.3475.741
Large (>500)Huber ϵ = 1.1 0.9460.0780.0930.3985.591
Large (>500)Huber ϵ = 1.35 0.9480.0780.0910.3985.591
Large (>500)Huber ϵ = 1.75 0.9560.0750.0830.3985.591
Large (>500)Huber ϵ = 2.0 0.9560.0750.0830.3985.591
Large (>500)Theil–Sen0.9120.0710.1180.3985.591
Table 4. Comparison of analytical Toffoli estimates [Equation (20), C 1 = C 2 = 3 ] with empirical counts (Toffoli *) from PennyLane’s resource estimation module [39], applied to each fragment’s qubitization circuit. A global OLS fit gives C 1 = 2.64 , C 2 = 3.17 ( | Δ C 1 | = 0.36 , | Δ C 2 | = 0.17 ), with a mean relative error of 11.9%. See Appendix C for C 1 , i , C 2 , i derivations at different ε . Ver.: Orig. = Original; Prop. = Proposed; # Coefs. = number of Hamiltonian coefficients.
Table 4. Comparison of analytical Toffoli estimates [Equation (20), C 1 = C 2 = 3 ] with empirical counts (Toffoli *) from PennyLane’s resource estimation module [39], applied to each fragment’s qubitization circuit. A global OLS fit gives C 1 = 2.64 , C 2 = 3.17 ( | Δ C 1 | = 0.36 , | Δ C 2 | = 0.17 ), with a mean relative error of 11.9%. See Appendix C for C 1 , i , C 2 , i derivations at different ε . Ver.: Orig. = Original; Prop. = Proposed; # Coefs. = number of Hamiltonian coefficients.
MoleculesVer.# CoeffsToffoliToffoli * C 1 C 2 Δ C 1 (%) Δ C 2 (%) Δ T (%)
AlanineOrig. 2.73 × 10 6 2.02 × 10 4 1.77 × 10 4 2.62 3.27 3.78 × 10 1 2.68 × 10 1 1.26 × 10 1
R_ala + Base StructuresProp. 5.79 × 10 4 2.59 × 10 3 2.37 × 10 3 2.74 3.05 2.56 × 10 1 4.66 × 10 2 8.41
HistidineOrig. 2.38 × 10 7 5.67 × 10 4 5.10 × 10 4 2.70 3.14 3.02 × 10 1 1.37 × 10 1 1.01 × 10 1
R_his + Base StructuresProp. 2.03 × 10 6 1.43 × 10 4 1.27 × 10 4 2.67 3.06 3.31 × 10 1 5.99 × 10 2 1.10 × 10 1
LeucineOrig. 1.62 × 10 7 4.02 × 10 4 3.45 × 10 4 2.58 3.30 4.24 × 10 1 2.97 × 10 1 1.41 × 10 1
R_leu + Base StructuresProp. 5.76 × 10 5 1.02 × 10 4 8.73 × 10 3 2.58 3.22 4.24 × 10 1 2.21 × 10 1 1.41 × 10 1
IsoleucineOrig. 1.64 × 10 7 4.02 × 10 4 3.42 × 10 4 2.56 3.13 4.45 × 10 1 1.28 × 10 1 1.48 × 10 1
R_ile + Base StructuresProp. 5.76 × 10 5 1.02 × 10 4 9.24 × 10 3 2.73 3.04 2.74 × 10 1 4.33 × 10 2 9.10
LysineOrig. 2.39 × 10 7 5.67 × 10 4 5.05 × 10 4 2.67 3.12 3.30 × 10 1 1.22 × 10 1 1.10 × 10 1
R_lys + Base StructuresProp. 2.25 × 10 6 2.02 × 10 4 1.81 × 10 4 2.69 3.13 3.07 × 10 1 1.26 × 10 1 1.02 × 10 1
MethionineOrig. 1.78 × 10 7 5.67 × 10 4 4.82 × 10 4 2.55 3.26 4.53 × 10 1 2.55 × 10 1 1.51 × 10 1
R_met + Base StructuresProp. 5.63 × 10 5 1.02 × 10 4 9.31 × 10 3 2.75 3.23 2.52 × 10 1 2.26 × 10 1 8.35
MhenylalanineOrig. 3.61 × 10 7 8.01 × 10 4 7.26 × 10 4 2.72 3.31 2.81 × 10 1 3.05 × 10 1 9.36
R_phe + Base StructuresProp. 3.78 × 10 6 2.02 × 10 4 1.74 × 10 4 2.59 3.17 4.12 × 10 1 1.73 × 10 1 1.37 × 10 1
ThreonineOrig. 8.36 × 10 6 2.85 × 10 4 2.45 × 10 4 2.58 3.06 4.19 × 10 1 6.11 × 10 2 1.39 × 10 1
R_thr + Base StructuresProp. 1.06 × 10 5 3.64 × 10 3 3.14 × 10 3 2.58 3.25 4.18 × 10 1 2.50 × 10 1 1.37 × 10 1
TryptophanOrig. 9.24 × 10 7 1.13 × 10 5 9.82 × 10 4 2.61 3.26 3.93 × 10 1 2.65 × 10 1 1.31 × 10 1
R_trp + Base StructuresProp. 1.49 × 10 7 4.02 × 10 4 3.56 × 10 4 2.65 3.20 3.46 × 10 1 2.02 × 10 1 1.15 × 10 1
ValineOrig. 9.82 × 10 6 4.02 × 10 4 3.53 × 10 4 2.63 3.27 3.66 × 10 1 2.68 × 10 1 1.22 × 10 1
R_val + Base StructuresProp. 3.98 × 10 5 7.21 × 10 3 6.27 × 10 3 2.60 3.18 3.95 × 10 1 1.80 × 10 1 1.31 × 10 1
ArginineOrig. 4.36 × 10 7 8.01 × 10 4 7.13 × 10 4 2.67 3.19 3.28 × 10 1 1.89 × 10 1 1.23 × 10 1
R_arg + Base StructuresProp. 5.47 × 10 6 2.85 × 10 4 2.44 × 10 4 2.57 3.16 4.28 × 10 1 1.59 × 10 1 1.42 × 10 1
CysteineOrig. 6.19 × 10 6 2.85 × 10 4 2.47 × 10 4 2.60 3.03 3.95 × 10 1 3.12 × 10 2 1.32 × 10 1
R_cys + Base StructuresProp. 1.56 × 10 5 5.12 × 10 3 4.48 × 10 3 2.62 3.06 3.80 × 10 1 5.74 × 10 2 1.26 × 10 1
GlutamineOrig. 1.83 × 10 7 5.67 × 10 4 4.99 × 10 4 2.64 3.03 3.61 × 10 1 3.31 × 10 2 1.20 × 10 1
R_gln + Base StructuresProp. 8.73 × 10 5 1.02 × 10 4 9.18 × 10 3 2.71 3.23 2.91 × 10 1 2.25 × 10 1 9.65
AsparagineOrig. 1.13 × 10 7 4.02 × 10 4 3.46 × 10 4 2.59 3.12 4.15 × 10 1 1.23 × 10 1 1.38 × 10 1
R_asn + Base StructuresProp. 3.45 × 10 5 7.21 × 10 3 6.38 × 10 3 2.65 3.18 3.48 × 10 1 1.85 × 10 1 1.15 × 10 1
TyrosineOrig. 4.85 × 10 7 8.01 × 10 4 7.12 × 10 4 2.67 3.31 3.32 × 10 1 3.12 × 10 1 1.25 × 10 1
R_tyr + Base StructuresProp. 4.32 × 10 6 2.85 × 10 4 2.42 × 10 4 2.55 3.10 4.47 × 10 1 1.02 × 10 1 1.49 × 10 1
SerineOrig. 4.53 × 10 6 2.85 × 10 4 2.54 × 10 4 2.67 3.15 3.29 × 10 1 1.54 × 10 1 1.09 × 10 1
R_ser + Base StructuresProp. 9.70 × 10 4 3.64 × 10 3 3.14 × 10 3 2.58 3.26 4.21 × 10 1 2.63 × 10 1 1.38 × 10 1
GlycineOrig. 1.16 × 10 6 1.43 × 10 4 1.22 × 10 4 2.56 3.10 4.43 × 10 1 9.58 × 10 2 1.47 × 10 1
R_gly + Base StructuresProp. 5.60 × 10 4 2.59 × 10 3 2.37 × 10 3 2.74 3.05 2.57 × 10 1 4.76 × 10 2 8.42
Aspartic_acidOrig. 1.05 × 10 7 4.02 × 10 4 3.68 × 10 4 2.75 3.12 2.53 × 10 1 1.15 × 10 1 8.42
R_asp + Base StructuresProp. 4.31 × 10 5 7.21 × 10 3 6.53 × 10 3 2.71 3.07 2.86 × 10 1 7.44 × 10 2 9.48
Glutamic_acidOrig. 1.72 × 10 7 5.67 × 10 4 4.93 × 10 4 2.61 3.32 3.93 × 10 1 3.19 × 10 1 1.31 × 10 1
R_glu + Base StructuresProp. 1.22 × 10 6 1.43 × 10 4 1.22 × 10 4 2.56 3.28 4.36 × 10 1 2.80 × 10 1 1.45 × 10 1
ProlineOrig. 8.37 × 10 6 2.85 × 10 4 2.55 × 10 4 2.69 3.22 3.12 × 10 1 2.24 × 10 1 1.04 × 10 1
R_pro + Base StructuresProp. 1.29 × 10 5 3.64 × 10 3 3.21 × 10 3 2.64 3.30 3.64 × 10 1 3.00 × 10 1 1.19 × 10 1
GlucagonOrig. 4.33 × 10 48 2.15 × 10 25 1.84 × 10 25 2.57 3.28 4.31 × 10 1 2.79 × 10 1 1.44 × 10 1
Amino acids – GlucagonProp. 5.02 × 10 8 2.25 × 10 5 1.99 × 10 5 2.65 3.08 3.52 × 10 1 8.24 × 10 2 1.17 × 10 1
OxytocinOrig. 8.85 × 10 17 1.01 × 10 10 8.56 × 10 9 2.55 3.31 4.50 × 10 1 3.07 × 10 1 1.50 × 10 1
Amino acids – OxytocinProp. 1.31 × 10 8 1.13 × 10 5 1.03 × 10 5 2.74 3.19 2.65 × 10 1 1.95 × 10 1 8.82
VasopressinOrig. 7.81 × 10 31 8.20 × 10 16 7.10 × 10 16 2.60 3.28 4.02 × 10 1 2.80 × 10 1 1.34 × 10 1
Amino acids – VasopressinProp. 1.76 × 10 8 1.60 × 10 5 1.43 × 10 5 2.68 3.31 3.17 × 10 1 3.08 × 10 1 1.06 × 10 1
Angiotensin IIOrig. 2.88 × 10 18 2.01 × 10 10 1.75 × 10 10 2.61 3.12 3.91 × 10 1 1.24 × 10 1 1.30 × 10 1
Amino acids – Angiotensin IIProp. 1.93 × 10 8 1.60 × 10 5 1.41 × 10 5 2.65 3.06 3.47 × 10 1 5.81 × 10 2 1.16 × 10 1
KyotorphinOrig. 4.41 × 10 9 8.95 × 10 5 7.93 × 10 5 2.66 3.10 3.41 × 10 1 9.56 × 10 2 1.14 × 10 1
Amino acids – KyotorphinProp. 8.84 × 10 7 1.13 × 10 5 9.73 × 10 4 2.58 3.16 4.18 × 10 1 1.59 × 10 1 1.39 × 10 1
Metionina encefalinaOrig. 3.44 × 10 12 2.00 × 10 7 1.83 × 10 7 2.75 3.28 2.52 × 10 1 2.83 × 10 1 8.40
Amino acids – Metionina encefalinaProp. 1.03 × 10 8 1.13 × 10 5 1.02 × 10 5 2.71 3.30 2.93 × 10 1 2.97 × 10 1 9.77
Leucina encefalinaOrig. 2.24 × 10 12 2.00 × 10 7 1.83 × 10 7 2.74 3.03 2.58 × 10 1 2.53 × 10 2 8.62
Amino acids – Leucina encefalinaProp. 1.01 × 10 8 1.13 × 10 5 1.03 × 10 5 2.73 3.19 2.68 × 10 1 1.85 × 10 1 8.93
TuftsinOrig. 5.54 × 10 11 1.00 × 10 7 8.93 × 10 6 2.67 3.16 3.31 × 10 1 1.56 × 10 1 1.10 × 10 1
Amino acids – TuftsinProp. 8.22 × 10 7 1.13 × 10 5 1.03 × 10 5 2.74 3.09 2.62 × 10 1 9.37 × 10 2 8.74
OpiorfinaOrig. 1.19 × 10 14 1.13 × 10 8 9.62 × 10 7 2.56 3.06 4.38 × 10 1 6.12 × 10 2 1.46 × 10 1
Amino acids – OpiorfinaProp. 1.42 × 10 8 1.60 × 10 5 1.37 × 10 5 2.58 3.13 4.16 × 10 1 1.30 × 10 1 1.38 × 10 1
Angiotensina IVOrig. 1.26 × 10 15 4.49 × 10 8 3.82 × 10 8 2.55 3.32 4.47 × 10 1 3.23 × 10 1 1.49 × 10 1
Amino acids – Angiotensina IVProp. 1.41 × 10 8 1.60 × 10 5 1.39 × 10 5 2.61 3.13 3.88 × 10 1 1.26 × 10 1 1.29 × 10 1
NeurotensinaOrig. 2.20 × 10 26 1.62 × 10 14 1.41 × 10 14 2.63 3.19 3.75 × 10 1 1.88 × 10 1 1.25 × 10 1
Amino acids – NeurotensinaProp. 3.12 × 10 8 2.25 × 10 5 1.95 × 10 5 2.60 3.25 4.00 × 10 1 2.47 × 10 1 1.33 × 10 1
BradicininaOrig. 4.43 × 10 18 2.01 × 10 10 1.82 × 10 10 2.72 3.14 2.82 × 10 1 1.39 × 10 1 9.40
Amino acids – BradicininaProp. 1.86 × 10 8 1.60 × 10 5 1.39 × 10 5 2.62 3.33 3.82 × 10 1 3.32 × 10 1 1.27 × 10 1
Angiotensina IOrig. 3.84 × 10 21 6.38 × 10 11 5.54 × 10 11 2.60 3.33 3.98 × 10 1 3.29 × 10 1 1.33 × 10 1
Amino acids – Angiotensina IProp. 2.33 × 10 8 1.60 × 10 5 1.41 × 10 5 2.66 3.10 3.42 × 10 1 1.03 × 10 1 1.14 × 10 1
Gastrin-14Orig. 7.03 × 10 23 1.02 × 10 13 8.71 × 10 12 2.57 3.18 4.27 × 10 1 1.81 × 10 1 1.42 × 10 1
Amino acids – Gastrin-14Prop. 2.17 × 10 8 1.60 × 10 5 1.44 × 10 5 2.71 3.12 2.87 × 10 1 1.19 × 10 1 9.58
GLU_CYS_GLYOrig. 5.47 × 10 9 8.95 × 10 5 7.64 × 10 5 2.56 3.11 4.41 × 10 1 1.14 × 10 1 1.47 × 10 1
Amino acids – GLU_CYS_GLYProp. 2.46 × 10 7 5.67 × 10 4 5.20 × 10 4 2.75 3.03 2.48 × 10 1 3.48 × 10 2 8.28
ALA_HISOrig. 3.01 × 10 8 2.25 × 10 5 2.03 × 10 5 2.71 3.22 2.94 × 10 1 2.17 × 10 1 9.79
Amino acids – ALA_HISProp. 2.66 × 10 7 5.67 × 10 4 4.89 × 10 4 2.58 3.18 4.15 × 10 1 1.83 × 10 1 1.38 × 10 1
PRO_GLY_PROOrig. 1.87 × 10 9 4.49 × 10 5 3.81 × 10 5 2.54 3.04 4.56 × 10 1 3.95 × 10 2 1.52 × 10 1
Amino acids – PRO_GLY_PROProp. 1.79 × 10 7 5.67 × 10 4 5.13 × 10 4 2.72 3.11 2.85 × 10 1 1.12 × 10 1 9.48
GLY_HIS_LYSOrig. 1.44 × 10 10 1.26 × 10 6 1.13 × 10 6 2.69 3.31 3.08 × 10 1 3.12 × 10 1 1.03 × 10 1
Amino acids – GLY_HIS_LYSProp. 4.89 × 10 7 8.01 × 10 4 7.20 × 10 4 2.70 3.10 3.03 × 10 1 9.93 × 10 2 1.01 × 10 1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Atchade-Adelomou, P.; Coronas Sala, L. A Quantum Strategy for the Simulation of Large Proteins: From Fragmentation in Small Proteins to Scalability in Complex Systems. Electronics 2025, 14, 2601. https://doi.org/10.3390/electronics14132601

AMA Style

Atchade-Adelomou P, Coronas Sala L. A Quantum Strategy for the Simulation of Large Proteins: From Fragmentation in Small Proteins to Scalability in Complex Systems. Electronics. 2025; 14(13):2601. https://doi.org/10.3390/electronics14132601

Chicago/Turabian Style

Atchade-Adelomou, Parfait, and Laia Coronas Sala. 2025. "A Quantum Strategy for the Simulation of Large Proteins: From Fragmentation in Small Proteins to Scalability in Complex Systems" Electronics 14, no. 13: 2601. https://doi.org/10.3390/electronics14132601

APA Style

Atchade-Adelomou, P., & Coronas Sala, L. (2025). A Quantum Strategy for the Simulation of Large Proteins: From Fragmentation in Small Proteins to Scalability in Complex Systems. Electronics, 14(13), 2601. https://doi.org/10.3390/electronics14132601

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop