Bounded-Error Quantum Simulation

• Bounded-error quantum simulation is a framework that quantifies how closely ideal quantum operations—such as Hamiltonian evolution or channel synthesis—are reproduced using finite resources and controlled error measures.
• It encompasses various strategies including product-formula Hamiltonian simulations with refined Trotter bounds, variational time evolution, and quasiprobabilistic approaches to manage simulation errors.
• The methodology emphasizes task-dependent error metrics using tools like channel purified distance, operator norm bounds, and energy bias evaluations to ensure explicit control over finite error.

Bounded-error quantum simulation is the study of how accurately an ideal quantum channel, Hamiltonian evolution, or quantum computation can be reproduced when the simulation is constrained by finite blocklength, finite timestep, finite circuit depth, finite sampling, or hardware noise. In the recent literature, the term covers several distinct but structurally related problems: entanglement-assisted reverse-Shannon simulation of channels, product-formula Hamiltonian simulation, variational time evolution, analog many-body simulation, and quasiprobabilistic simulation under imperfect resources. Across these settings, the common objective is to replace asymptotic “vanishing error” statements with explicit control of finite error, error exponents, or end-to-end accuracy at fixed resources (Li et al., 2021, Heyl et al., 2018, Murota et al., 12 Mar 2026).

1. Scope and performance criteria

There is no single canonical error metric for bounded-error quantum simulation. In entanglement-assisted quantum channel simulation, the target is a CPTP map $\mathcal N_{A\to B}$, and the natural performance criterion is the channel purified distance

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$

which is explicitly worst-case over entangled inputs. The corresponding reliability function is

$$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$

so the central question is the exponential decay rate of simulation error with blocklength (Li et al., 2021). In digital Hamiltonian simulation, by contrast, product-formula analyses often use operator norm error such as

$\left\|e^{-itH}-S_1(t/r)^r\right\|,$

which controls worst-case action on states and observables (Tran et al., 2019, Layden, 2021).

Several other bounded-error notions are state dependent rather than worst case. For driven digital simulation, the deviation between the exact and simulated final pure states is bounded through the Fubini–Study angle

$$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$

yielding a lower bound on final-state overlap and fidelity (Hatomura, 2022). For variational quantum time evolution, the preferred metric is the Bures distance

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$

chosen specifically to avoid phase-dependent overestimation (Zoufal et al., 2021). In quantum chemistry, the practically relevant quantity is often not a norm of the propagator error but the ground-state energy shift

$$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$

because phase estimation is sensitive to effective eigenvalue bias rather than worst-case action on arbitrary states (Babbush et al., 2014). Noise-aware end-to-end analyses for Hamiltonian simulation instead adopt

$$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$

with bias controlled by half the diamond distance, $D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$, thereby treating bounded error as a mean-squared-error target on observable estimation (Murota et al., 12 Mar 2026). This suggests that bounded-error simulation is intrinsically task dependent: the operational meaning of “small error” depends on whether the goal is channel synthesis, local-observable prediction, state preparation, or expectation-value estimation.

2. Product-formula Hamiltonian simulation and refined Trotter bounds

For local many-body Hamiltonians, first-order Trotter analysis has been substantially sharpened beyond the naive accumulation picture. For one-dimensional nearest-neighbor systems whose Hamiltonian decomposes as $H=H_1+H_2$ with each layer internally commuting, the first-order product formula satisfies

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$0

provided $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$1 is sufficiently small. This improves on the conventional $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$2 estimate by showing that the leading local Trotter errors interfere destructively rather than adding coherently. The corresponding gate-count estimate for target error $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$3 is

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$4

rather than $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$5 for the same class of systems (Tran et al., 2019).

A complementary structural explanation views first-order Trotterization through the second-order product formula. For $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$6, the identity

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$7

shows that PF1 differs from PF2 only by boundary gates. This yields the explicit bound

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$8

with $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$9, $$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$0, and $$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$1 determined by nested commutators. In one-dimensional nearest-neighbor systems, $$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$2, so the refined bound matches the $$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$3 scaling without the technical caveats of earlier derivations (Layden, 2021). The boundary term $$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$4 and the PF2-like bulk term $$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$5 isolate two distinct error mechanisms.

For local observables, the Floquet reinterpretation of Trotterization leads to a different kind of bounded-error statement. Writing one Trotter step as a Floquet period,

$$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$6

with

$$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$7

the dynamics exhibits a threshold in the Trotter step size $$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$8. Below this threshold, the Floquet dynamics is regular and localized in the space of Floquet eigenstates; above it, the dynamics becomes quantum chaotic. In the localized regime, local-observable errors can remain bounded and effectively independent of system size and total simulation time. For the Ising benchmark, the long-time simulation-accuracy measure obeys

$$E^{\rm sim}(\mathcal N,r):=\liminf_{n\to\infty}\frac{-1}{n}\log P^{\rm sim}(\mathcal N^{\otimes n},nr),$$9

and the long-time magnetization error satisfies

$\left\|e^{-itH}-S_1(t/r)^r\right\|,$0

with the paper reporting $\left\|e^{-itH}-S_1(t/r)^r\right\|,$1 for the studied parameters (Heyl et al., 2018). The bounded-error statement here is deliberately local-observable specific rather than a claim about the full many-body wavefunction.

3. State-dependent and structure-aware certification

A different line of work replaces worst-case norm bounds by trajectory-dependent error certification. For digital simulation of driven, time-dependent Hamiltonians $\left\|e^{-itH}-S_1(t/r)^r\right\|,$2, the final-state error admits the exact geometric bound

$\left\|e^{-itH}-S_1(t/r)^r\right\|,$3

where each $\left\|e^{-itH}-S_1(t/r)^r\right\|,$4 depends on the exact and approximate one-step propagators evaluated on the actually realized simulated state. Consequently,

$\left\|e^{-itH}-S_1(t/r)^r\right\|,$5

whenever the cosine is nontrivial. Under first-order Suzuki–Trotterization with $\left\|e^{-itH}-S_1(t/r)^r\right\|,$6, the local angle is approximated by

$\left\|e^{-itH}-S_1(t/r)^r\right\|,$7

with

$\left\|e^{-itH}-S_1(t/r)^r\right\|,$8

This is explicitly stronger than a norm bound whenever the simulated trajectory lies in directions where the commutator expectation values are small (Hatomura, 2022).

Variational quantum time evolution uses a comparable residual-to-global-error philosophy. For both variational real-time and imaginary-time evolution, the Bures-distance error is bounded by

$\left\|e^{-itH}-S_1(t/r)^r\right\|,$9

where the local residual norm is expressed in terms of the energy variance, the Fubini–Study metric $$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$0, and the McLachlan tangent-vector coefficients. For real time,

$$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$1

and an analogous expression holds for imaginary time. The resulting fidelity lower bound is phase agnostic and can be evaluated a posteriori along the simulation trajectory (Zoufal et al., 2021).

In quantum chemistry, the same shift from worst-case to task-specific metrics is especially pronounced. For second-order Trotter–Suzuki simulation of electronic-structure Hamiltonians, the relevant bounded-error quantity is the ground-state energy bias rather than $$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$2. The paper derives

$$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$3

and

$$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$4

Norm-based bounds can overestimate the actual ground-state Trotter error by up to sixteen orders of magnitude, and the practically relevant cost depends strongly on maximum nuclear charge, orbital filling fraction, and basis choice rather than spin-orbital count alone. The same study reports that for systems such as helium hydride, lithium hydride, and atoms including N, O, F, and Ne, one or two second-order Trotter steps can suffice for chemical accuracy (Babbush et al., 2014).

4. Noisy digital simulation, error mitigation, and non-unitary channels

One route to bounded-error improvement is to abandon the requirement that the simulator implement a single unitary approximation. A non-unitary simulation channel of the form

$$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$5

can suppress coherent Trotterization error by averaging over a small ensemble of unitary product-formula circuits. In short time, the Haar-averaged Frobenius loss is controlled by the weighted leading error operator

$$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$6

in long time, repeated-step error is controlled by the weighted commuting component

$$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$7

The paper develops two ensemble-construction mechanisms—term-order permutations and global symmetry conjugations—and shows analytically and numerically that averaging can suppress leading commutator terms. On an IonQ trapped-ion device, the equal-weight average of two first-order orderings produced about a $$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$8 reduction in total error at $$\mathcal L(|\Phi(T)\rangle,|\Psi(T)\rangle)=\arccos |\langle \Phi(T)|\Psi(T)\rangle|,$$9 for the reported benchmark (Gong et al., 2023).

A separate literature treats noisy Hamiltonian simulation as an end-to-end estimation problem. In that setting, the central criterion is

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$0

For Trotterized simulation without probabilistic error cancellation (PEC),

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$1

where $$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$2 is circuit depth, $$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$3 is the algorithmic Trotter bias, and $$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$4 is the physical-noise bias. With PEC,

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$5

which yields the analytic depth-selection rule

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$6

and the critical error scale

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$7

For randomized LCU with PEC, optimizing the repetition number

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$8

gives

$$B(\ket{\psi_t^\omega},\ket{\psi_t^*})=\sqrt{2-2|\langle\psi_t^\omega|\psi_t^*\rangle|},$$9

so the dependence on $$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$0 remains polynomial even though the noise-dependent prefactor is exponential (Murota et al., 12 Mar 2026).

A state-dependent analysis of noisy Trotter circuits pushes this further by arguing that not only physical one-step error but also one-step algorithmic error decays exponentially with the Trotter-step index $$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$1. For local depolarizing noise, the reported bounds are

$$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$2

leading to an accumulated-error model from which the optimal number of Trotter steps is derived as

$$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$3

Under the asymptotic identifications $$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$4 and $$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$5, the admissible noise threshold scales as

$$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$6

which the paper interprets as the noise requirement needed to guarantee target precision (2504.10247).

5. Channel simulation, resource theories, and computational-model simulation

Bounded-error quantum simulation also arises in settings that are not Hamiltonian simulation. In entanglement-assisted reverse-Shannon simulation, the aim is to reproduce a memoryless quantum channel $$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$7 using unlimited shared entanglement, local operations, and bounded classical communication. The optimal simulation error at communication cost $$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$8 is

$$\Delta E_i=\langle \psi_i|V^{(1)}|\psi_i\rangle+O(\Delta_t^4),$$9

and the paper derives both finite-blocklength and reliability-function bounds. The explicit achievability result is

$$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$0

while the asymptotic reliability function satisfies

$$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$1

Below the critical rate

$$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$2

the lower and upper bounds coincide, giving the exact low-rate exponent

$$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$3

This yields an operational interpretation of channel sandwiched Rényi mutual information of orders $$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$4 to $$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$5 (Li et al., 2021).

In the error-corrected regime of Clifford+$$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$6 computation, bounded-error simulation can be formulated through quasiprobability decompositions relative to available noisy or insufficient magic resources. The key quantity is the Quantum-assisted Robustness of Magic,

$$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$7

which determines the overhead of unbiased additive-error estimation. If the target expectation value is to be estimated within additive error $$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$8 and failure probability $$\epsilon^2=\mathrm{Var}(\hat\mu)+\mathrm{Bias}(\hat\mu)^2,$$9, the sample complexity satisfies

$D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$0

This framework interpolates continuously between classical simulation ($D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$1), quantum-assisted simulation ($D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$2), and full error mitigation with noisy logical magic states (Lostaglio et al., 2021).

The same term also has a complexity-theoretic meaning. For bounded-error query-to-communication simulation, the Buhrman–Cleve–Wigderson transformation gives $D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$3, and the open question was whether the $D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$4 overhead is removable. For the XOR gadget, it is not: there exists a total Boolean function $D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$5 such that

$D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$6

so the logarithmic overhead is unavoidable in general (Chakraborty et al., 2019). In space-bounded postselected quantum computation, bounded-error simulation appears as an elimination theorem: intermediate measurements and intermediate postselections can be removed without changing computational power, yielding

$D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$7

Here the simulation target is not a Hamiltonian or channel but a nonunitary space-bounded quantum computation, and the result states that a purely unitary computation with only final postselection can simulate it in the same asymptotic space bound (Tani, 2022).

6. Analog, open-system, and bounded-strength simulation

In analog control settings, bounded-error simulation is often formulated through average-Hamiltonian theory rather than gate counts. For bounded-strength open-loop control, the controlled Hamiltonian $D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$8 induces a toggling-frame Hamiltonian

$D(\Phi,\Psi)=\frac12\|\Phi-\Psi\|_\diamond$9

with zeroth-order average

$H=H_1+H_2$0

Modified Eulerian cycles with finite-strength controls and inserted coasting intervals realize nontrivial target Hamiltonians while avoiding bang-bang pulses. When the decoupling condition

$H=H_1+H_2$1

is satisfied, the protocol yields

$H=H_1+H_2$2

For open systems,

$H=H_1+H_2$3

the same framework gives

$H=H_1+H_2$4

so the target system Hamiltonian is simulated while system-bath couplings are removed to leading order. Time-symmetrization eliminates odd Magnus terms and upgrades the simulation error to

$H=H_1+H_2$5

which is the paper’s route to second-order bounded-error simulation under realistic control constraints (Bookatz et al., 2013).

For analog many-body simulators, a related problem is not to upper-bound simulation error a priori but to characterize it experimentally. If the implemented Hamiltonian differs from the target by a random perturbation $H=H_1+H_2$6, then for the Heisenberg-evolved target Hamiltonian,

$H=H_1+H_2$7

where $H=H_1+H_2$8 is the coherent error and $H=H_1+H_2$9 is the fluctuation scale. Under operator thermalization, the long-time steady-state value of $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$00 estimates coherent Hamiltonian error, while the short-time oscillation amplitude estimates non-Markovian shot-to-shot fluctuations (Prakash et al., 2023).

A more specialized open-system example is the simulation of a two-level atom coupled to a one-dimensional coupled-cavity array in the single-excitation sector. With $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$01 qubits, the simulator encodes

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$02

cavities plus the atomic excited state. In the bound-state regime, the long-time excited-state population takes the form

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$03

and the metrological error in estimating the atomic transition frequency recovers the ideal scaling

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$04

For finite $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$05, the regular oscillatory regime has finite duration $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$06, with empirical law

$$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$07

so the duration approximately doubles when one more qubit is added (Liu et al., 2023).

Open problems recur across these subfields. Exact reverse-Shannon reliability above the critical rate remains unresolved (Li et al., 2021). The improved first-order Trotter bounds based on PF2 structure are currently specialized to two-term decompositions (Layden, 2021). Bounded-strength Hamiltonian simulation does not yet provide general long-time fidelity guarantees (Bookatz et al., 2013). Variational error certificates do not by themselves control discretization and hardware noise (Zoufal et al., 2021). Efficient computation of QRoM remains difficult at large $$P(\mathcal M,\mathcal N):=\max_{\varphi_{RA}} P\!\left((\mathrm{id}_R\otimes\mathcal M)(\varphi_{RA}),(\mathrm{id}_R\otimes\mathcal N)(\varphi_{RA})\right),$$08-count (Lostaglio et al., 2021). These limitations clarify that bounded-error quantum simulation is not a single theorem but a family of operational frameworks for quantifying how accurately different classes of quantum dynamics, channels, and computations can be reproduced under explicit physical and algorithmic constraints.