Parameterized Simulatability in Computation

• Parameterized simulatability is defined as the study of simulation tractability when conditioning on explicit structural parameters such as graph width, code dimensions, or process counts.
• It enables fixed-parameter tractable simulation in quantum circuits by leveraging parameters like rank-width and dynamic programming to outperform tensor-network methods in specific regimes.
• Applications span continuous-variable quantum computation, formal verification, and surrogate modeling for PDEs, demonstrating its multifaceted impact on simulation complexity.

Parameterized simulatability is used in several non-identical but structurally related senses across current research. In each usage, the central question is not merely whether a system is simulatable, but whether simulation, verification, or surrogate reproduction becomes tractable once one conditions on explicit parameters: graph width in quantum circuits, code dimension and measurement structure in continuous-variable computation, the number of replicated processes in verification, the number of probes or observed outputs in security, or the parameter space of a PDE or explanation pipeline. The resulting literature treats simulatability as a parameter-governed property rather than a uniform yes-or-no notion (Colnet et al., 28 May 2026, García-Álvarez et al., 2020, Aminof et al., 2023, Cho et al., 2024, Poché et al., 10 Jan 2025).

1. Parameter dependence as the organizing principle

A recurring pattern is that the relevant parameter is structural rather than purely size-based. In strong quantum-circuit simulation, the parameter can be the rank-width of a graph induced by a sum-of-powers representation of Feynman paths. In continuous-variable quantum computation, the controlling parameters include the logical dimensions $d_1,d_2$, the embedding factor $a$, rotation symmetries $N,M$, squeezing $\Delta$, and the negativity of a representation such as the Zak–Gross Wigner function. In parameterized verification, the parameter may be the number of anonymous processes, the size of a replicated type, or the shape of a candidate simulation or bisimulation relation. In explanation evaluation, simulatability is itself a measured quantity, parameterized by prompt design, simulator choice, concept vocabulary, and explanation format (Colnet et al., 28 May 2026, Calcluth, 27 May 2025, Mazur et al., 2012, Poché et al., 10 Jan 2025).

The literature also differs on what counts as “simulation.” Some works study exact strong simulation of amplitudes; some study polynomial-time weak simulation or sampling; some study simulation preorders and bisimulations between transition systems; some study whether a finite abstraction simulates an unbounded family; and some study whether a surrogate or evaluator can reproduce a model’s outputs from a compressed representation. This suggests that “parameterized simulatability” is best read as a family of formally specified tractability statements whose complexity or validity is indexed by explicit parameters, rather than as a single cross-domain definition.

2. Fixed-parameter tractable strong simulation of quantum circuits

In "Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation" (Colnet et al., 28 May 2026), parameterized simulatability is the statement that strong simulation of a quantum circuit is fixed-parameter tractable with respect to a structural parameter $k$ extracted from the circuit. Here strong simulation means exact computation of a single amplitude

$\langle z|C|y\rangle,$

for fixed computational-basis input and output states. For circuits over $\{H,T,CZ\}$, inserting basis resolutions yields a Feynman-path sum whose phase is a quadratic polynomial over Boolean path variables. After pinning the input and output bits, the amplitude takes the form

$$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$

where $G_C=(V,E)$ is the path-variable graph, $R$ is the Hadamard normalization, and the edges encode quadratic interactions induced by interior Hadamards and $a$0 gates.

The decisive parameter is the rank-width $a$1, defined from the $a$2 cut-rank

$a$3

Given a width-$a$4 rank-decomposition, the paper develops a dynamic program over the decomposition tree. For a node $a$5, assignments on the leaves under $a$6 are summarized by a boundary signature $a$7 and an internal residue $a$8, and the DP table counts assignments with a fixed signature-residue pair. This yields exact evaluation of the associated counting problem and hence the amplitude itself.

The runtime bound is

$a$9

time and

$N,M$0

space, or working space $N,M$1 when tables are discarded. A Fourier-mode variant reduces this to

$N,M$2

so for fixed $N,M$3 the complexity is $N,M$4. The method applies to all circuits over $N,M$5, hence in particular to Clifford$N,M$6, because replacing $N,M$7 by an arbitrary diagonal single-qubit gate changes only unary coefficients and the global normalization while leaving $N,M$8 unchanged.

A central comparison is with tensor-network contraction and decision-diagram methods. The paper proves that the SOP graph $N,M$9 is a minor of the tensor line graph $\Delta$0, implying

$\Delta$1

It also uses $\Delta$2 to show that the rank-width algorithm recovers linear-rank-width guarantees known from decision-diagram simulation, while strictly improving them on families where $\Delta$3 is large and $\Delta$4 is small. Explicit families $\Delta$5 are constructed with

$\Delta$6

so the rank-width DP remains polynomial while competing parameters degrade. The limitations are equally explicit: the construction assumes Hadamard is the only non-diagonal single-qubit gate, assumes access to a width-$\Delta$7 rank-decomposition, and targets single amplitudes rather than full distributions.

3. Continuous-variable quantum computation: encoded structure, negativity, and universality

In continuous-variable settings, parameterized simulatability is formulated in terms of code structure, measurement type, and quasiprobability representations rather than graph width. "Efficient simulatability of continuous-variable circuits with large Wigner negativity" (García-Álvarez et al., 2020) identifies large families of CV circuits, built from GKP or rotation-symmetric bosonic codes, that are strongly simulatable in polynomial time even when their physical Wigner functions are negative and can be large or unbounded. The key mechanism is an encoding into finite-dimensional qudit stabilizer dynamics. For GKP, symmetric embeddings with

$\Delta$8

allow one to reinterpret CV displacements and Gaussian gates as qudit Clifford operations in dimension $\Delta$9. For RSB codes, two embedding methods are given, with parameters $k$0, again landing inside an encoded Clifford group. Homodyne measurement in GKP maps to Pauli $k$1, while phase measurement in RSB maps to Pauli projections. The resulting strong simulation runs in time polynomial in $k$2, the circuit length, and $k$3, and the paper emphasizes that this complexity is independent of the magnitude of Wigner negativity.

The same theme is sharpened in "From simulatability to universality of continuous-variable quantum computers" (Calcluth, 27 May 2025). There, parameterized simulatability is described through tunable parameters such as the number of modes, gate-set structure, angle arithmetic, measurement type, squeezing $k$4, and a negativity monotone in the Zak–Gross Wigner representation. Several simulatable classes are identified. For ideal GKP stabilizer inputs and rational or restricted symplectic Gaussian operations, homodyne distributions become lattice sums or Dirac combs; for one family the joint PDF can be computed in $k$5 time. For encoded Clifford circuits with modular measurements in odd $k$6, the Zak–Gross Wigner function is non-negative on ideal stabilizer states, so efficient phase-space sampling is possible even though the standard CV Wigner function can be highly negative. For finitely squeezed or magic GKP states, quasiprobability Monte Carlo cost is controlled by

$k$7

where $k$8.

These results support a resource-theoretic conclusion stated explicitly in both works: Wigner negativity is necessary in several architectures but is not sufficient for classical hardness. Encoded stabilizer structure, lattice symmetry, and representation choice determine simulability more sharply than raw negativity alone. The boundary to universality is then obtained by adding resources that cross explicit thresholds. The thesis states that adding the vacuum state to SGKP circuits promotes the model to universal quantum computation because GKP error correction on vacuum yields logical states above a magic-state distillation threshold except on a measure-zero set, while another criterion uses robustness of magic after suitable CV-to-DV maps.

4. Structural parameters in measurement-based quantum computation

In measurement-based quantum computation, parameterized simulatability is tied to causal structure and entanglement structure rather than to gate counts. "Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation" (Markham et al., 2013) develops two complementary parameterizations.

The first is based on $k$9Flow. For an open graph state $\langle z|C|y\rangle,$0, $\langle z|C|y\rangle,$1Flow provides a correcting map $\langle z|C|y\rangle,$2 and a strict partial order $\langle z|C|y\rangle,$3 satisfying conditions that guarantee deterministic MBQC in the allowed Pauli planes. From this one defines $\langle z|C|y\rangle,$4Flow paths, influencing paths, and the forward cone

$\langle z|C|y\rangle,$5

the set of qubits whose future measurement bases or corrections can depend on outcome $\langle z|C|y\rangle,$6. A stabilizer-tracking simulation then yields the bound

$\langle z|C|y\rangle,$7

with per-vertex update cost $\langle z|C|y\rangle,$8. The exponential factor comes from the growth of terms in the Pauli expansion of logical operators along influencing paths.

The second parameterization is entanglement-based. The paper uses entanglement width $\langle z|C|y\rangle,$9 and structural entanglement $\{H,T,CZ\}$0, with simulation bounds

$\{H,T,CZ\}$1

and

$\{H,T,CZ\}$2

For flow-based patterns the paper derives

$\{H,T,CZ\}$3

where $\{H,T,CZ\}$4 is the maximum number of edges crossing between flow wires and $\{H,T,CZ\}$5. This yields a simulation bound parameterized by inter-wire crossings, and, when translated to the circuit model, recovers the form of Jozsa’s theorem for circuits where each wire is touched by only logarithmically many two-qubit gates.

The paper stresses that the two parameterizations are complementary. In 1D cluster states, the $\{H,T,CZ\}$6Flow light-cone bound is loose because forward cones are long, whereas the entanglement width is constant and gives polynomial simulation. In 2D cluster states both parameters are large, so both routes predict exponential difficulty. This separation of causal spread from bipartite entanglement complexity is one of the clearest examples of parameterized simulatability as a genuinely multidimensional notion.

5. Verification, abstraction, and simulation preorders for parameterized systems

In verification and concurrency, parameterized simulatability often means that an infinite family of systems can be represented, reduced, or compared through a finite or finitely presented simulation. "Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems" (Aminof et al., 2023) gives a two-way efficient correspondence between discrete-timed networks and untimed RB-systems. Time elapse becomes symmetric broadcast, clocks are clipped at

$\{H,T,CZ\}$7

and the parameterized model-checking problems are polynomial-time inter-reducible. This transfers complexity results: safety is PSPACE-complete, liveness is decidable in EXPTIME without a controller, while liveness with a controller becomes undecidable via an inter-reduction to asymmetric broadcast systems. Here simulatability is the efficient preservation of executions and verification problems across parameterized formalisms.

"A type reduction theory for systems with replicated components" (Mazur et al., 2012) studies PMCP in CSP when the parameter is the number of replicated processes. For a sufficiently large type $\{H,T,CZ\}$8, a $\{H,T,CZ\}$9-collapsing map

$$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$0

identifies all identities at least $$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$1 with a single representative $$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$2. The main theorems show that, under symmetry and syntactic normality assumptions,

$$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$3

and analogously in the stable-failures model. The threshold $$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$4 is extracted from symbolic operational semantics of the specification. This is a canonical example of parameterized simulatability through reduction to a fixed representative instance.

"Counter Simulations via Higher Order Quantifier Elimination" (Ghilardi et al., 2017) gives a logical foundation for counter abstraction. A higher-order specification with process indices, arrays, and cardinalities is projected to an integer-only subsystem by eliminating second-order symbols. For chosen counter variables $$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$5, the induced formulas are

$$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$6

and

$$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$7

The resulting counter system is the strongest projection simulation over the chosen arithmetic subsignature, and can be model-checked with $$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$8. The paper therefore treats simulatability as the existence of a faithful counter system suitable for SMT-based safety verification.

"Probabilistic Bisimulation for Parameterized Systems" (Hong et al., 2020) generalizes the picture to probabilistic transition systems. States and candidate relations are represented in the decidable first-order theory of the universal automatic structure

$$\langle z|C|y\rangle=\frac1R\sum_{x\in\{0,1\}^V}\omega_r^{c+\sum_{v\in V}b_vx_v+\frac r2\sum_{\{u,v\}\in E}x_ux_v},$$9

A fixed FO formula $G_C=(V,E)$0 characterizes when a regular relation $G_C=(V,E)$1 is a probabilistic bisimulation. Active automata learning then synthesizes candidate regular bisimulations for parameterized protocols such as dining cryptographers and the grades protocol. The same paper explicitly notes that the framework can be adapted from bisimulation to one-sided probabilistic simulation by replacing equivalence requirements with reflexivity, transitivity, and forward transfer only.

"Bisimilarity and Simulatability of Processes Parameterized by Join Interactions" (Grabmayer et al., 19 Aug 2025) gives a preorder-theoretic version. For processes $G_C=(V,E)$2 and environment $G_C=(V,E)$3, Larsen-style parameterized simulatability $G_C=(V,E)$4 is shown to coincide with join-interaction parameterized simulatability

$G_C=(V,E)$5

For image-finite systems this admits the modal characterization

$G_C=(V,E)$6

where $G_C=(V,E)$7 denotes the positive Hennessy–Milner theory. By contrast, the analogous bisimilarity notions coincide only for deterministic environments.

A further logical variant appears in "Characterizing p-Simulation Between Theories" (Monroe, 17 Jul 2025), where parameterized simulatability means polynomial simulation of one theory $G_C=(V,E)$8 by a base theory $G_C=(V,E)$9. If $R$0 efficiently interprets $R$1, then $R$2 $R$3-simulates $R$4; moreover,

$R$5

The paper also states that no computably enumerable theory $R$6-simulates all extensions $R$7. Although this lies in proof complexity rather than model checking, it shares the same pattern: simulation power is indexed by an explicit parameter, here the added axiom $R$8.

6. Security and categorical formulations of simulatability

In information-theoretic key generation, simulatability appears as an exact condition under which active attacks destroy secret-key capacity. "On the Simulatability Condition in Key Generation Over a Non-authenticated Public Channel" (Tu et al., 2014) defines $R$9 by the existence of a stochastic matrix $a$00 such that

$a$01

where $a$02 collects $a$03 and $a$04 collects $a$05. Equivalently, there must exist a nonnegative vector $a$06 solving

$a$07

The paper constructs an LP certificate

$a$08

subject to

$a$09

and proves that simulatability holds iff the rank test is consistent and $a$10. A second LP,

$a$11

constructs an explicit attack channel. This is a parameterized notion because the feasibility problem depends on the alphabet sizes and the joint PMF $a$12, and because the outcome partitions the problem into the two Maurer–Wolf regimes: $a$13 if simulatability holds, and otherwise

$a$14

A different security-oriented formalization appears in "The propagation game: on simulatability, correlation matrices, and probing security" (Zaccaria, 2023). There simulatability is expressed categorically in a PROP of correlation matrices. Parameters are explicit: $a$15 adversarial probes, $a$16 observed outputs, $a$17 refreshing randoms, and the gate topology. The matrix criterion is

$a$18

where $a$19 leaves at most $a$20 input identities unerased, $a$21 injects randomness, and $a$22 erases unobserved outputs. Diagrammatically this becomes backward propagation of erase morphisms. The critical cut rule is

$a$23

which shows that a uniformly random XOR input destroys secret dependence, whereas

$a$24

for AND. The same framework is used to reformulate PINI and its composability. A plausible implication is that here parameterized simulatability is not only a complexity statement but also a syntax-sensitive criterion for existence of a simulator under bounded leakage.

7. Surrogate models, automated evaluators, and classical realizations

Some recent works use simulatability in an explicitly operational or evaluative sense. "Parameterized Physics-informed Neural Networks for Parameterized PDEs" (Cho et al., 2024) defines parameterized simulatability for PDEs as the ability to approximate $a$25 or $a$26 across a parameter set $a$27 with one surrogate model rather than retraining per parameter value. P$a$28INNs use a parameter encoder $a$29, a coordinate encoder $a$30, and a solution network $a$31, assembled as

$a$32

Training is physics-informed: $a$33 and in the experiments instantiated as

$a$34

The paper reports that P$a$35INNs outperform several baselines on benchmark parameterized PDEs, including difficult convection–diffusion–reaction cases, and frames this as joint simulation over the parameter space rather than isolated approximation at fixed coefficients.

"ConSim: Measuring Concept-Based Explanations' Effectiveness with Automated Simulatability" (Poché et al., 10 Jan 2025) makes simulatability itself the evaluation target. A simulator $a$36, implemented with an LLM, receives explanations $a$37 and must predict the output of the explained model. The core metric is

$a$38

The framework parameterizes simulatability by simulator choice, prompt design, anonymization, concept extraction method, concept interpretation method, and the number of concepts included. Performance across settings is aggregated with Copeland’s voting scheme

$a$39

and

$a$40

In this setting, parameterized simulatability is the end-to-end reproducibility of a model’s behavior from an explanation under explicit communication constraints.

Finally, "Quantum systems simulatability through classical networks" (Caruso, 2021) treats simulatability as realization through classical dynamical systems. Finite-dimensional quantum Hamiltonians $a$41 and $a$42 are related by gauge transformations

$a$43

with state transformation $a$44. Realifying the Schrödinger equation turns it into a system of real linear ODEs and then into second-order equations

$a$45

which can be implemented by passive electrical networks. The parameterized viewpoint supplied in the work ties classical simulatability to Hilbert-space dimension, locality, sparsity, simulation time $a$46, target error $a$47, and the complexity of the gauge transformation.

Across these application-level uses, the common idea is unchanged: once the relevant representation is parameterized correctly, simulation becomes a quantitative property of the representation itself. In some cases the parameter is structural width; in others it is code symmetry, leakage budget, explanation bandwidth, or PDE coefficient space. The literature therefore treats parameterized simulatability less as a single theorem schema than as a research program for locating tractable regimes by exposing the right parameter.