What Is Quantum Simulation?

A quantum simulation uses controllable quantum degrees of freedom to infer a property of a specified target quantum model. The target may represent a molecule, a lattice magnet, an interacting field, a driven open system, or an abstract Hamiltonian. The simulator may be a programmable quantum computer, a purpose-built many-body experiment, or a hybrid quantum–classical system.

The useful output is a specified quantity—such as a magnetization, energy, or correlation—with a controlled relation to the target model. A simulator need not reproduce every microscopic feature of a material, and preparing its quantum state does not provide free access to all of that state’s amplitudes.

Required background. Unitary evolution supplies the Hamiltonian propagator; density operators express mixed-state expectation values; the circuit model explains the digital implementation.

Target dynamics and measured observables

For a closed-system dynamical task, specify a target Hilbert space $\mathcal H_{\mathrm{tar}}$ , an initial state $\rho_{\mathrm{tar}}(0)$ , a Hamiltonian $H_{\mathrm{tar}}$ , and observables $O_\alpha$ . The ideal target prediction is

\mu_\alpha(t) = \operatorname{Tr} \left[ O_\alpha U_{\mathrm{tar}}(t) \rho_{\mathrm{tar}}(0) U_{\mathrm{tar}}^\dagger(t) \right],

for a time-independent Hamiltonian, with

U_{\mathrm{tar}}(t) = e^{-iH_{\mathrm{tar}}t/\hbar}.

An encoding maps the target states and observables to controllable device degrees of freedom. To calculate the same $\mu_\alpha(t)$ , one must specify the initial state, boundaries and couplings, the relation between device and target time, and the detector response. For example, a nearest-neighbor spin chain and a chain with long-range couplings are different target models even if both produce a magnetization trace.

Model adequacy and implementation accuracy

Suppose a real system of interest is represented by a model $M$ , and a device implements an approximation $\widetilde M$ . Two questions follow:

Model validation: does $M$ describe the real system in the claimed regime?
Simulator verification: does the device implement $M$ accurately enough for the declared observable?

These questions do not collapse into one fidelity number. A quantum computer can simulate an ideal lattice Hamiltonian very accurately even if that Hamiltonian is a poor model of a material. An analog experiment can reproduce a qualitative phase pattern while its couplings differ enough from the target to invalidate a quantitative critical point. A prediction about the real material requires both links. A calculation about an abstract Hamiltonian can instead be useful on its own, without claiming that the model describes a particular material.

The distinction also clarifies why simulation can be valuable when it rejects a model. If a verified simulator predicts behavior inconsistent with experiment, the target model may be incomplete. The simulator has still produced useful evidence.

What a Quantum Simulator Returns

A simulator does not normally return the full many-body wavefunction. It returns task-specific classical information extracted from repeated measurements, such as:

an energy or spectral gap;
a local density, magnetization, current, or order parameter;
an equal-time or dynamical correlation function;
samples from a many-body distribution;
a response to a quench, ramp, pulse, or external field;
a phase boundary or critical exponent with finite-size qualifications;
a prepared state for use by another quantum procedure;
a decision between competing models.

For example, a two-point correlation function may be

C_{ij}^{zz}(t) = \operatorname{Tr} \left[ Z_iZ_j\rho(t) \right] - \operatorname{Tr} \left[ Z_i\rho(t) \right] \operatorname{Tr} \left[ Z_j\rho(t) \right].

The ability to prepare $\rho(t)$ does not grant free access to all of its amplitudes or all observables. Each incompatible measurement setting consumes additional preparations, and full tomography generally scales poorly with system size. Output and measurement cost belong in the problem definition, not in a footnote after the evolution has been implemented.

Why Use a Quantum Device?

For $n$ distinguishable subsystems of local dimension $d$ , a generic pure state requires $d^n$ complex amplitudes in a product basis. This exponential state-space growth motivates quantum simulation: a physical quantum system represents its state without storing a classical list of every amplitude.

That observation is important but is not a complexity proof. Many quantum models are classically tractable because of integrability, weak correlations, free-particle structure, stabilizer structure, low entanglement, favorable Monte Carlo weights, or a restricted observable and time regime. Conversely, hard state preparation, long coherent evolution, or expensive readout can remove an apparent quantum benefit.

Lloyd’s universal-simulation result established efficient digital simulation for broad classes of local quantum systems under explicit locality and accuracy assumptions. It does not imply that every quantum-model question is efficiently solvable. Ground-state preparation may be hard, evolution time can itself be a resource, and extracting a tiny signal can require many repetitions.

A defensible motivation therefore has this form:

For the stated family of inputs, target observable, error tolerance, and access model, the quantum device has a plausible end-to-end resource advantage over the best applicable classical methods.

“The Hilbert space is exponentially large” and “a Monte Carlo method has a sign problem” are warning signs of possible classical difficulty, not stand-alone demonstrations of quantum advantage.

Digital Quantum Simulation

A digital quantum simulator encodes the target degrees of freedom into registers and approximates the desired operation with a sequence of discrete gates. If $V:\mathcal H_{\mathrm{tar}}\to\mathcal H_{\mathrm{sim}}$ is an isometric encoding and $W(t)$ is the implemented circuit, a requirement that also controls leakage out of the encoding is

\left\| W(t)V - V U_{\mathrm{tar}}(t) \right\| \le \epsilon_{\mathrm{sim}}.

Here the operator norm is taken from the target space to the full simulator space. It controls the output vector for every encoded input. Compressing first to $V^\dagger W V$ loses the outgoing leakage amplitude: a small rotation into an unwanted level changes the compressed operator only at second order, although the leakage amplitude is first order (Exercise 1). A state- or observable-specific guarantee can be weaker and cheaper than uniform operator accuracy.

When

H_{\mathrm{tar}} = \sum_{\ell=1}^{L} H_\ell,

one route is a product formula. For two bounded terms and $\Delta t=t/r$ ,

e^{-i(H_A+H_B)t/\hbar} \approx \left( e^{-iH_A\Delta t/\hbar} e^{-iH_B\Delta t/\hbar} \right)^r.

The leading first-order error is controlled by noncommutativity and scales schematically as

\epsilon_{\mathrm{PF}} = O\!\left( \frac{t^2}{r\hbar^2} \left\| [H_A,H_B] \right\| \right),

subject to the bounded-operator assumptions behind the estimate. Higher-order product formulas, linear-combination methods, truncated Taylor series, qubitization, and quantum signal processing provide other tradeoffs. Hamiltonian Simulation compares their access assumptions and costs, while the Trotter Product Formula derives the operator splitting.

Digital simulation offers a common gate-level interface, programmable model changes, and systematic algorithmic error parameters. Those benefits do not make it automatically accurate. Compilation, synthesis, control, crosstalk, leakage, decoherence, logical error correction, state preparation, and measurement each contribute additional error and cost.

Analog Quantum Simulation

An analog quantum simulator engineers a device Hamiltonian whose behavior corresponds directly to a target family. A useful abstract mapping is

P H_{\mathrm{lab}} P = \alpha V H_{\mathrm{tar}} V^\dagger + \beta P + \Delta H,

where:

$V$ is an isometric encoding and $P=VV^\dagger$ projects onto its image;
$\alpha>0$ fixes the energy and time scale;
$\beta$ contributes only a global phase for closed dynamics within $P$ ;
$\Delta H=P\Delta H P$ describes errors within that subspace, such as unwanted encoded couplings or inhomogeneity.

This projected identity must be supplemented by control of leakage. For time-independent $H_{\mathrm{lab}}$ , exact invariance is $[H_{\mathrm{lab}},P]=0$ . With this condition and $\Delta H=0$ , target time $t$ corresponds to laboratory time $t/\alpha$ . Without it, the couplings $(I-P)H_{\mathrm{lab}}P$ can transfer population to unwanted levels even when the projected Hamiltonian is exactly right. The observable must also be mapped: a detector reading $O_{\mathrm{lab}}$ answers the target question only when its relation to $V O_{\mathrm{tar}}V^\dagger$ is controlled.

Analog devices can realize large, continuously evolving systems with fewer compiled operations than a gate-by-gate construction. They can also expose local correlations and nonequilibrium dynamics naturally. Their central difficulty is that the implemented generator is physical rather than symbolic. Long-range tails, trap inhomogeneity, residual levels, finite temperature, loss, and imperfect constraints are part of the actual model.

An analog simulator is therefore not validated by a visual resemblance between two phase diagrams. It needs a quantitative mapping, parameter calibration, regime statement, and observable-level uncertainty.

Hybrid Quantum Simulation

Hybrid simulation combines distinct quantum and classical roles. The label includes at least three different patterns:

Digital–analog simulation: native many-body blocks provide analog evolution, while discrete gates and pulses reconfigure or compose those blocks.
Variational simulation: a parameterized quantum state or process is measured, and a classical optimizer updates the parameters.
Quantum embedding: a quantum device treats a selected correlated subsystem while a classical method supplies an environment, mean field, or self-consistency loop.

The word hybrid is not an error model. A complete description must say which object is represented quantum mechanically, which quantities cross the classical interface, how the loop terminates, and how uncertainty and optimizer failure are handled.

Hybrid Quantum Simulation explains how native evolution blocks, variational updates, and an embedded subsystem can be combined, and how errors propagate through those calculations.

Variational energy estimation, for example, evaluates

E(\boldsymbol\theta) = \langle\psi(\boldsymbol\theta)| H |\psi(\boldsymbol\theta)\rangle

on a quantum device and updates $\boldsymbol\theta$ classically. The method is only as useful as its ansatz expressivity, optimization landscape, measurement allocation, noise sensitivity, and comparison with classical variational states.

Emulator, Simulator, and Universal Computer

Terminology is not perfectly uniform, so capability should be described directly.

Term	Typical meaning	What it does not guarantee
quantum emulator	specialized device reproducing a restricted model family or phenomenon	quantitative accuracy outside the calibrated regime
analog simulator	engineered continuous Hamiltonian or channel with a direct target correspondence	universality or a tunable error parameter
digital simulator	gate-based algorithm approximating target dynamics	low physical overhead or useful output extraction
universal quantum computer	programmable device able, in principle, to approximate arbitrary quantum circuits	that a particular simulation is efficient, verified, or scientifically useful
hybrid simulator	quantum process embedded in digital–analog or quantum–classical workflow	convergence, advantage, or immunity to classical bottlenecks

A universal computer can act as a digital simulator. A specialized analog device can be scientifically valuable without being universal. “Emulation” often emphasizes a restricted correspondence, but it should not be used to evade an error budget.

Errors in the predicted observable

Simulation errors arise at different conceptual layers:

\begin{aligned} \epsilon_{\mathrm{total}} \;\text{depends on}\;& \epsilon_{\mathrm{model}}, \epsilon_{\mathrm{map}}, \epsilon_{\mathrm{prep}}, \epsilon_{\mathrm{dyn}}, \\ & \epsilon_{\mathrm{noise}}, \epsilon_{\mathrm{readout}}, \epsilon_{\mathrm{stat}}, \epsilon_{\mathrm{infer}}. \end{aligned}

These symbols need not be directly additive. Some are norms, some are confidence bounds, and some are model-discrepancy assessments. They should be propagated to the reported quantity in compatible units.

State and observable error

If $\rho$ and $\widetilde\rho$ are normalized ideal and simulated states in the same Hilbert space, and

D(\rho,\widetilde\rho) = \frac{1}{2} \left\| \rho-\widetilde\rho \right\|_1,

then any bounded observable obeys

\left| \operatorname{Tr} \left[ O(\rho-\widetilde\rho) \right] \right| \le 2 \left\|O\right\|_\infty D(\rho,\widetilde\rho).

This converts state distance into a worst-case observable bound. For an encoding with leakage, use the full simulator space, comparing $V\rho V^\dagger$ with the actual output; a projection followed by renormalization would describe a different, postselected experiment. In particular, the digital operator bound above implies output trace distance at most $\epsilon_{\mathrm{sim}}$ and observable error at most $2\lVert O\rVert_\infty\epsilon_{\mathrm{sim}}$ . A task-specific estimate may be substantially tighter.

For channels, a diamond-norm bound can control errors uniformly over inputs, including entangled reference systems. In practice, full channel characterization is expensive, so local generators, selected observables, and structured error models are often tested instead.

Algorithmic and physical errors are different

Increasing the product-formula step count can reduce ideal discretization error while increasing circuit depth and physical noise. A schematic observable error might behave as

\epsilon_{\mathrm{obs}}(r) \lesssim \frac{A}{r^p} + B r + \epsilon_0,

where $A/r^p$ is algorithmic error, $Br$ is accumulated hardware error, and $\epsilon_0$ collects preparation and readout floors. Minimizing this envelope gives a finite recommended $r$ , rather than $r\to\infty$ . A minimum of an upper bound need not locate the minimum of the actual error; measured convergence and the validity of the noise model still matter.

For an analog device, the corresponding control parameter may be evolution time, detuning, interaction range, or protection strength. Error can grow nonlinearly near resonances, critical points, unstable dynamics, or leakage thresholds.

Finite sampling is part of the algorithm

Suppose $N$ independent repetitions of the same preparation and measurement give outcomes in $[-1,1]$ , with common mean $\mu$ and sample mean $\widehat\mu$ . Hoeffding’s inequality gives

\Pr \left( \left| \widehat\mu-\mu \right| \ge \epsilon \right) \le 2e^{-N\epsilon^2/2}.

Thus a sufficient shot count for failure probability at most $\delta$ is

N \ge \frac{2}{\epsilon^2} \ln \frac{2}{\delta}.

Total cost includes all separately sampled parameter points, times, bases, and mitigation variants. Compatible observables can sometimes be estimated from the same shots—for example, a joint $Z$ readout supplies both magnetizations and $Z_iZ_j$ correlations. For several simultaneous confidence statements, the failure probabilities must also be combined. Efficient evolution can still have an expensive measurement layer.

Open-System Simulation

The target need not be unitary. A Markovian open-system target may obey

\frac{d\rho}{dt} = -\frac{i}{\hbar}[H,\rho] + \sum_\mu \gamma_\mu \left( L_\mu\rho L_\mu^\dagger - \frac{1}{2} \left\{ L_\mu^\dagger L_\mu,\rho \right\} \right).

For a time-independent Markov semigroup, the rates $\gamma_\mu$ are nonnegative; here $L_\mu$ is dimensionless and $\gamma_\mu$ has units of inverse time. Ancillas and gates, stochastic unravelings, collision models, or engineered dissipation can implement such dynamics. The Lindblad–GKSL Equation explains the generator and its assumptions.

Uncontrolled hardware decoherence is not automatically a faithful simulation of target dissipation. The noise operators, rates, correlations, initial system–environment conditions, and Markov approximations must match the declared open-system model. “The device is noisy, so it naturally simulates an open system” is usually too weak to support a quantitative claim.

Worked Example: Transverse-Field Ising Dynamics

Consider the open-chain target

H_{\mathrm{tar}} = -J \sum_{j=1}^{n-1} Z_jZ_{j+1} - h \sum_{j=1}^{n} X_j.

Prepare $\lvert0\rangle^{\otimes n}$ , quench to nonzero $J$ and $h$ , and ask for

m_z(t) = \frac{1}{n} \sum_{j=1}^{n} \langle Z_j(t)\rangle

and selected connected correlations $C_{ij}^{zz}(t)$ . This is already a complete task only after $n$ , boundaries, parameter ranges, time grid, precision, and confidence level are fixed.

Digital realization

With $\Delta t=t/r$ , a first-order circuit is

W_r(t) = \Bigg[ \prod_{j=1}^{n-1} e^{\,iJ\Delta t Z_jZ_{j+1}/\hbar} \times \prod_{j=1}^{n} e^{\,ih\Delta t X_j/\hbar} \Bigg]^r.

The two-body terms commute with one another, as do the one-body terms, but the two groups do not commute. Varying $r$ tests product-formula convergence until physical gate errors dominate. The Transverse-Field Ising Model page develops the model’s phases and correlations.

Analog realization

An analog platform may implement

H_{\mathrm{lab}} = - \sum_{i<j} J_{ij}Z_iZ_j - \sum_i h_iX_i + H_{\mathrm{res}}.

To claim nearest-neighbor Ising simulation, the measured $J_{ij}$ , field inhomogeneity $h_i-h$ , residual term $H_{\mathrm{res}}$ , boundary conditions, and time rescaling must be included. Long-range interactions are not merely “noise” if they materially change the model; the honest target may instead be a long-range Ising model.

Analytic limits and numerical comparisons

The same task admits several checks:

At $J=0$ , each spin undergoes an independent rotation and
$m_z(t) = \cos \left( \frac{2ht}{\hbar} \right).$
At $h=0$ , $\lvert0\rangle^{\otimes n}$ is an eigenstate, so $m_z(t)=1$ .
Small systems can be compared with exact diagonalization.
Digital results should converge over a range of $r$ before hardware noise reverses the trend.
The global spin-flip operator $\prod_j X_j$ commutes with the ideal Hamiltonian. Its expectation remains zero for this initial state; drift detects some symmetry-breaking errors, but zero expectation alone is a weak check and does not certify a definite symmetry sector.
Independently calibrated couplings can be used to make held-out predictions at times or parameters not used in fitting.

No single check proves correctness everywhere. Their sensitivity to different errors is what makes them useful together.

Testing predictions beyond calibration

Full tomography is usually unnecessary for a large simulator. Tests of the relevant generator, symmetries, and observables can be more informative, provided their limitations are understood. Small-system agreement need not survive at large size; conservation laws can hold despite substantial symmetry-preserving errors; two platforms can share the same incorrect model assumptions.

Predicting data not used to fit the model tests more than fit quality. For example, couplings inferred from early magnetization traces can predict later connected correlations from a different initial state. Re-fitting after seeing those data turns that comparison into additional calibration. Verification of Quantum Simulation develops these distinctions and quantitative certification methods.

Resource Accounting and Advantage Claims

At least three claims are often conflated:

Classically challenging operation: the device reaches a regime that is difficult for a named classical method.
Computational quantum advantage: the quantum workflow solves the same formal input–output task at the same error with better scaling or resources than the best applicable classical workflow.
Scientific utility: the simulation produces reliable insight, prediction, or model discrimination that matters for science.

None implies the other two automatically. A classically difficult sample distribution may answer no useful physical question. A scientifically valuable analog simulator may not have a proved asymptotic advantage. A formal algorithmic speedup may require fault-tolerant resources beyond the experiment being discussed.

A comparison should count:

target size, parameter domain, and requested observable;
error tolerance and success probability;
state preparation and equilibration time;
logical gates, analog evolution, or coherent interrogation time;
repetitions and measurement settings;
calibration, mitigation, and discarded runs;
classical compilation, optimization, inference, and verification;
hardware parallelism and energy only when compared on a common boundary;
the strongest classical algorithm available for the same structured instance.

The Reading Quantum-Technology Claims page supplies the broader vocabulary for separating theorem, algorithm, resource estimate, demonstration, benchmark, and application.

Exercises

1. Detect leakage hidden by projection

Encode a qubit in the first two states of a three-level device, with an unwanted level $\lvert\ell\rangle$ . The target evolution is the identity. Let a unitary $W$ rotate the $\lvert0\rangle,\lvert\ell\rangle$ plane by $0\le\theta\le\pi/2$ , so that

W\lvert0\rangle=\cos\theta\lvert0\rangle+\sin\theta\lvert\ell\rangle, \qquad W\lvert1\rangle=\lvert1\rangle.

Compare $\lVert V^\dagger WV-I\rVert$ , $\lVert WV-V\rVert$ , and the leakage probability for input $\lvert0\rangle$ .

Solution

The compressed operator is $\operatorname{diag}(\cos\theta,1)$ , giving $1-\cos\theta\simeq\theta^2/2$ . The full output difference has norm

\sqrt{(1-\cos\theta)^2+\sin^2\theta} =2\sin(\theta/2)\simeq\theta,

and the leaked population is $\sin^2\theta\simeq\theta^2$ . Thus compressed error, amplitude error, and leakage probability are different quantities. The analogous Hamiltonian $H_{\mathrm{lab}}=g(\lvert\ell\rangle\langle0\rvert+\lvert0\rangle\langle\ell\rvert)$ has $PH_{\mathrm{lab}}P=0$ , exactly the zero target Hamiltonian, yet leaks probability $\sin^2(gt/\hbar)$ . The off-diagonal block cannot be ignored.

2. Classify three simulators

Classify each workflow as digital, analog, or hybrid:

a gate circuit applies product-formula steps for a molecular Hamiltonian;
atoms in an optical lattice realize a Bose–Hubbard Hamiltonian directly;
a parameterized circuit measures an energy and a classical optimizer updates its angles.

Solution

The first is digital because a discrete gate sequence approximates target evolution. The second is analog because an engineered physical Hamiltonian directly realizes the target model over a calibrated regime. The third is hybrid because quantum state preparation and measurement are embedded in a classical optimization loop. The labels do not establish accuracy; each workflow still needs its own mapping and error budget.

3. Show why the analog energy offset is harmless

Assume

P H_{\mathrm{lab}}P = \alpha V H_{\mathrm{tar}}V^\dagger + \beta P

with no leakage. Show that $\beta$ does not affect expectation values of encoded observables.

Solution

Within the encoded subspace,

e^{-iH_{\mathrm{lab}}t_{\mathrm{lab}}/\hbar} = e^{-i\beta t_{\mathrm{lab}}/\hbar} V e^{-iH_{\mathrm{tar}}t/\hbar} V^\dagger,

where $t=\alpha t_{\mathrm{lab}}$ . The first factor is a global phase. It cancels between the ket and bra in a density operator and therefore cancels from

\operatorname{Tr} \left[ V O V^\dagger \rho_{\mathrm{lab}}(t_{\mathrm{lab}}) \right].

The offset is harmless only while evolution remains within $P$ ; subspace-dependent offsets or leakage need not be.

4. Recover the product-formula error scaling

Use the Baker–Campbell–Hausdorff expansion to explain why repeating

e^{-iH_A\Delta t/\hbar} e^{-iH_B\Delta t/\hbar}

for $r=t/\Delta t$ steps gives a leading global error proportional to $t^2\lVert[H_A,H_B]\rVert/(r\hbar^2)$ .

Solution

Let $A=-iH_A\Delta t/\hbar$ and $B=-iH_B\Delta t/\hbar$ . The Baker–Campbell–Hausdorff expansion gives

e^Ae^B = \exp \left( A+B+\frac{1}{2}[A,B]+O(\Delta t^3) \right).

Because

[A,B] = -\frac{\Delta t^2}{\hbar^2} [H_A,H_B],

the local error is $O(\Delta t^2\lVert[H_A,H_B]\rVert/\hbar^2)$ . Accumulating $r$ steps gives the schematic global scale

r\Delta t^2 \frac{\lVert[H_A,H_B]\rVert}{\hbar^2} = \frac{t^2}{r} \frac{\lVert[H_A,H_B]\rVert}{\hbar^2}.

Rigorous constants and long-time growth require the assumptions developed on the product-formula page.

5. Solve two Ising validation limits

For the worked Ising example with initial state $\lvert0\rangle^{\otimes n}$ , find $m_z(t)$ when (a) $J=0$ and (b) $h=0$ .

Solution

When $J=0$ , each spin evolves under $-hX$ . The single-spin unitary is

e^{\,ihtX/\hbar},

which rotates the Bloch vector about the $x$ axis by the signed angle $-2ht/\hbar$ . Therefore

m_z(t) = \cos \left( \frac{2ht}{\hbar} \right).

When $h=0$ , the initial computational-basis state is an eigenstate of every $Z_jZ_{j+1}$ term. Evolution adds only a phase, so every $\langle Z_j\rangle=1$ and $m_z(t)=1$ .

6. Convert trace distance to observable error

Suppose $D(\rho,\widetilde\rho)\le0.015$ and $\lVert O\rVert_\infty=1$ . What worst-case bias in $\langle O\rangle$ follows from the trace-distance bound?

Solution

Using

\left| \operatorname{Tr} \left[ O(\rho-\widetilde\rho) \right] \right| \le 2\lVert O\rVert_\infty D(\rho,\widetilde\rho),

the bias is at most

2(1)(0.015)=0.030.

This is a uniform worst-case bound. Knowledge of the observable and error structure may yield a tighter task-specific estimate.

7. Budget the number of shots

For independent outcomes in $[-1,1]$ with a common mean, use Hoeffding’s inequality to find a sufficient $N$ for additive error $\epsilon=0.02$ and failure probability $\delta=0.01$ .

Solution

The sufficient condition is

N \ge \frac{2}{\epsilon^2} \ln \frac{2}{\delta}.

Substitution gives

\begin{aligned} N &\ge \frac{2}{0.02^2} \ln(200) \\ &\approx 5000(5.298) \\ &\approx 26492. \end{aligned}

Thus $N=26492$ shots suffice after rounding up. This conservative bound applies per independently estimated bounded observable and setting.

8. Find the optimal digital step count

Suppose a simplified error model is

\epsilon(r) = \frac{0.8}{r} + 0.002r + 0.01.

Treating $r$ as continuous, find the minimizing step count and explain why $r\to\infty$ is not optimal.

Solution

Differentiate:

\frac{d\epsilon}{dr} = -\frac{0.8}{r^2} + 0.002.

Setting this to zero gives

r^2 = \frac{0.8}{0.002} = 400, \qquad r=20.

The product-formula term decreases with $r$ , but hardware error grows with circuit depth. The constant $0.01$ floor does not affect the optimum. Here the continuous minimum is already an integer. This conclusion concerns the stated model; an upper error bound alone would only identify its own minimum.

9. Remove finite-shot bias in a connected correlation

Each of $N>1$ independent joint measurements returns $x_k,z_k\in\{-1,1\}$ . Show that $\overline{xz}-\bar x\bar z$ has expectation $(1-1/N)C$ , where $C=\mathbb E[xz]-\mathbb E[x]\mathbb E[z]$ . Give an unbiased estimator.

Solution

The $N$ same-shot terms in $\bar x\bar z=N^{-2}\sum_{k,l}x_kz_l$ have expectation $\mathbb E[xz]$ ; the $N(N-1)$ different-shot terms factor by independence. Therefore

\mathbb E[\bar x\bar z] =\frac{\mathbb E[xz]}{N} +\left(1-\frac1N\right)\mathbb E[x]\mathbb E[z].

Subtracting this from $\mathbb E[\overline{xz}]$ gives the claimed factor. The unbiased estimator is $N(\overline{xz}-\bar x\bar z)/(N-1)$ . The two magnetizations and the joint moment can share the same shots, but their statistical correlations must be retained in the uncertainty calculation.

10. Does Hilbert-space size establish an advantage?

A paper states: “Our 100-qubit analog simulator has quantum advantage because exact diagonalization would require $2^{100}$ amplitudes.” Give four reasons this does not yet establish computational quantum advantage.

Solution

First, exact diagonalization is not necessarily the strongest classical method; tensor networks, Monte Carlo, symmetries, or specialized approximations may apply. Second, the input–output task and accuracy are unspecified, so the compared computations are not defined. Third, state preparation, repetitions, readout, calibration, and classical postprocessing are omitted from the quantum resource count. Fourth, the result has not been verified in the claimed regime. A finite-instance resource comparison needs a matched classical baseline; an asymptotic speedup additionally needs scaling over a problem family. Neither follows from Hilbert-space dimension alone.

References

E. Altman et al., “Quantum simulators: Architectures and opportunities,” PRX Quantum 2, 017003 (2021), doi:10.1103/PRXQuantum.2.017003.
J. I. Cirac and P. Zoller, “Goals and opportunities in quantum simulation,” Nature Physics 8, 264–266 (2012), doi:10.1038/nphys2275.
J. Eisert et al., “Quantum certification and benchmarking,” Nature Reviews Physics 2, 382–390 (2020), doi:10.1038/s42254-020-0186-4.
R. P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics 21, 467–488 (1982), doi:10.1007/BF02650179.
I. M. Georgescu, S. Ashhab, and F. Nori, “Quantum simulation,” Reviews of Modern Physics 86, 153–185 (2014), doi:10.1103/RevModPhys.86.153.
P. Hauke, F. M. Cucchietti, L. Tagliacozzo, I. H. Deutsch, and M. Lewenstein, “Can one trust quantum simulators?” Reports on Progress in Physics 75, 082401 (2012), doi:10.1088/0034-4885/75/8/082401.
T. H. Johnson, S. R. Clark, and D. Jaksch, “What is a quantum simulator?” EPJ Quantum Technology 1, 10 (2014), doi:10.1140/epjqt10.
S. Lloyd, “Universal quantum simulators,” Science 273, 1073–1078 (1996), doi:10.1126/science.273.5278.1073.