arxiv: 2604.19889 · v1 · submitted 2026-04-21 · 🪐 quant-ph · cond-mat.stat-mech

Recognition: unknown

Quantum-to-Classical Computability Transition via Negative Markov Chains

Hugo L\'oio , Jacopo De Nardis , Tony Jin

Authors on Pith no claims yet

Pith reviewed 2026-05-10 02:24 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.stat-mech

keywords negative Markov chainsquantum-to-classical transitiondepolarizing noiseclassical simulabilityopen quantum spin chainsMonte Carlo samplingparticle proliferation

0 comments

The pith

Depolarizing noise above a critical threshold renders quantum spin chain dynamics classically simulable via suppressed particle growth.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper maps generic quantum dynamics to Markov processes by sampling negative chains that track both particles and antiparticles in an exponentially large space. Complexity grows because these particles proliferate under unitary evolution, eventually making exact classical sampling impossible. For any unitary built from linear combinations of local or pairwise terms, the authors show that at least one noise channel always exists to halt this proliferation and restore efficient Monte Carlo sampling. In the concrete setting of depolarizing noise on open spin chains, this produces an exact, model-specific transition point beyond which the dynamics become classically tractable.

Core claim

By representing quantum dynamics as sampling of negative Markov chain processes with particles and antiparticles, the formalism maps generic quantum evolution onto a Markov process over a large configuration space. Quantum complexity arises from stochastic particle proliferation that renders classical simulation intractable. In the presence of noise, for any unitary generated by a linear combination of local or pairwise interactions, there exists at least one noise channel that suppresses particle growth and makes Monte Carlo sampling efficient. As a corollary, open quantum spin chains subject to depolarizing noise undergo an exact transition to classical simulability once the noise strength

What carries the argument

Negative Markov chain representation with particles and antiparticles that maps quantum dynamics to a Markov process over configuration space, where particle number controls classical simulability.

If this is right

Monte Carlo sampling of the dynamics becomes efficient once noise is strong enough to suppress particle growth.
The critical noise threshold for the transition is computable directly from the interaction model without running the full dynamics.
The result holds for any unitary generated by local or pairwise interactions, not just specific cases.
Classical simulability is recovered exactly at and above the threshold for depolarizing noise on open spin chains.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same representation could be used to identify minimal noise levels that restore classical tractability in other open quantum systems.
Small-system numerical tests of the predicted thresholds would provide immediate checks on whether the particle-counting picture matches actual simulation costs.
The approach suggests a concrete way to quantify when noise destroys quantum advantage in simulation tasks.

Load-bearing premise

The negative Markov chain with particles and antiparticles exactly captures generic quantum dynamics without information loss, and suitable noise channels exist to suppress particle growth for any linear combination of local or pairwise interactions.

What would settle it

Numerical Monte Carlo sampling of a small open spin chain under depolarizing noise, compared against exact quantum evolution, showing that sampling accuracy and efficiency switch sharply from intractable to efficient exactly at the predicted critical noise strength.

Figures

Figures reproduced from arXiv: 2604.19889 by Hugo L\'oio, Jacopo De Nardis, Tony Jin.

**Figure 2.** Figure 2: Numerical results for the 2D TFIM (J = 1/2, h = 1) with noise given by (23) with a prefactor γ (yielding classical dynamics for γ ≥ 1). The initial state is given by (24), with pairs randomly chosen and fixed for all samples, except for those specifically selected for the curves in (b). (a) Particle growth rate as a function of γ for different qubit numbers N. Dashed lines show the prediction of (13). (a… view at source ↗

**Figure 3.** Figure 3: (a) Time-evolution of ⟨σz(t)⟩ for the Lindblad evolution (A1) with initial state |ψ (t = 0)⟩ = |+z⟩ and τ = 1/2. We compare the exact solution with the one obtained from the simulation of the (negative) Markov process defined in (A4) and see perfect agreement. (b) Growth of the total particle number as a function of time. We see that above the critical value for which γ = τ , all the transition weights bec… view at source ↗

**Figure 4.** Figure 4: Illustration of the procedure rendering the Markov transition matrix classical for the example of the TFIM (22) with 2 [PITH_FULL_IMAGE:figures/full_fig_p013_4.png] view at source ↗

**Figure 5.** Figure 5: Saturation particle number for the TFIM ( [PITH_FULL_IMAGE:figures/full_fig_p014_5.png] view at source ↗

read the original abstract

We develop a recently introduced representation of quantum dynamics based on sampling negative Markov chain processes. By introducing particles and antiparticles, this formalism maps generic quantum dynamics onto a Markov process defined over an exponentially large configuration space. Within this framework, quantum complexity arises from the proliferation of stochastic particles, which ultimately renders classical simulation and sampling intractable beyond a certain timescale. In the presence of noise, we demonstrate that for any unitary evolution generated by a linear combination of local or pairwise interactions, there exists at least one noise channel that effectively classicalizes the system by suppressing particle growth and making Monte Carlo sampling efficient. As a corollary, we show that for this class of unitaries, the dynamics of an open quantum spin chain subject to depolarizing noise undergoes an exact transition to classical simulability once the noise strength exceeds a critical threshold which can be efficiently determined for any model.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper maps quantum dynamics to a negative Markov chain with particles and antiparticles, then claims depolarizing noise above a computable threshold makes the dynamics classically simulable for local unitaries.

read the letter

The core contribution is a signed-measure representation that turns quantum evolution into a Markov process over an exponential space, with complexity tied to particle growth. For depolarizing noise on spin chains with local or pairwise interactions, they identify a threshold where particle proliferation stops and Monte Carlo sampling becomes efficient. This gives a model-specific, efficiently determinable boundary between quantum and classical regimes under noise, which is a clean framing not directly in the prior literature they cite.

Referee Report

1 major / 0 minor

Summary. The paper develops a representation of quantum dynamics based on sampling negative Markov chain processes using particles and antiparticles. This maps generic quantum dynamics to a Markov process over an exponentially large configuration space, with quantum complexity arising from stochastic particle proliferation. The authors demonstrate that for unitaries generated by linear combinations of local or pairwise interactions, there exists a noise channel that suppresses particle growth, making Monte Carlo sampling efficient. They show that for open quantum spin chains with depolarizing noise, there is an exact transition to classical simulability above a critical threshold that can be efficiently determined for any model.

Significance. If the central claims are rigorously established, this work provides a valuable framework for identifying the boundary between quantum and classical simulability in open systems. The ability to efficiently determine the critical noise threshold for any model is a significant practical advantage. It also highlights how noise can be used to 'classicalize' certain quantum dynamics, which could have implications for understanding decoherence and designing classical simulation algorithms for noisy quantum circuits.

major comments (1)

[Abstract] Abstract: The assertion of an 'exact transition to classical simulability' via depolarizing noise is load-bearing on the assumption that particle suppression leads to efficient sampling. However, the negative weights in the Markov chain representation may persist, leading to potential exponential variance in Monte Carlo estimators due to cancellations, even with O(1) particle numbers. The manuscript must explicitly demonstrate either non-negativity of weights or polynomially bounded variance above the threshold to support this claim.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive evaluation of the work and for identifying a key point that requires clarification. We address the major comment below and have revised the manuscript to strengthen the supporting arguments for the claimed transition.

read point-by-point responses

Referee: [Abstract] Abstract: The assertion of an 'exact transition to classical simulability' via depolarizing noise is load-bearing on the assumption that particle suppression leads to efficient sampling. However, the negative weights in the Markov chain representation may persist, leading to potential exponential variance in Monte Carlo estimators due to cancellations, even with O(1) particle numbers. The manuscript must explicitly demonstrate either non-negativity of weights or polynomially bounded variance above the threshold to support this claim.

Authors: We agree that the efficiency claim requires an explicit treatment of the variance induced by negative weights, which was not developed in sufficient detail in the original text. In the revised manuscript we have added a new subsection (III.D) together with a short appendix proof establishing that, for any local or pairwise unitary and depolarizing noise above the critical threshold, the negative Markov chain admits an equivalent non-negative representation. The construction absorbs the signs into a modified initial measure whose total variation is bounded by a constant independent of system size; the resulting Monte Carlo estimator then has variance that scales at most polynomially with the number of sites. This follows from the locality of the interactions, which prevents exponential accumulation of cancellations once particle proliferation is suppressed. We have also updated the abstract to read “efficient classical simulability with polynomially bounded variance.” revision: yes

Circularity Check

0 steps flagged

No significant circularity detected in the derivation.

full rationale

The paper develops a negative Markov chain representation (with particles/antiparticles) for quantum dynamics and shows that, for unitaries from local/pairwise interactions, a suitable noise channel exists that suppresses particle growth, yielding an exact transition to classical simulability under depolarizing noise above a model-dependent critical threshold. This threshold is stated to be efficiently determinable from the model rather than fitted to simulation data or defined circularly. No equations or steps reduce the claimed transition to a tautology, self-definition, or load-bearing self-citation chain; the mapping and noise-suppression argument retain independent content from the inputs. The representation is described as recently introduced, but the transition result does not collapse to that prior definition by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on the existence of an exact mapping from unitary quantum evolution to a negative-probability Markov process and on the ability of noise to control particle proliferation without additional fitted constants.

axioms (2)

domain assumption Quantum dynamics generated by linear combinations of local or pairwise interactions can be represented exactly as sampling from a negative Markov chain over an exponentially large configuration space
This is the foundational representation introduced in the paper and invoked for all subsequent claims.
domain assumption Depolarizing noise acts as a channel that can suppress stochastic particle growth in the mapped process
Required for the existence of a classicalizing noise channel for any such unitary.

invented entities (1)

Stochastic particles and antiparticles no independent evidence
purpose: To encode signs and negative probabilities in the Markov chain representation of quantum evolution
New entities introduced to make the quantum-to-Markov mapping possible; no independent evidence outside the formalism is provided.

pith-pipeline@v0.9.0 · 5446 in / 1541 out tokens · 37619 ms · 2026-05-10T02:24:55.639105+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

68 extracted references · 10 canonical work pages

[1]

Aaronson and A

S. Aaronson and A. Arkhipov, The computational complex- ity of linear optics, inProceedings of the 43rd Annual ACM Symposium on Theory of Computing(Association for Com- puting Machinery, 2011) pp. 333–342

2011
[2]

M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-case complexity versus approximate simulation of commuting quantum computations, Physical Review Let- ters117, 080501 (2016)

2016
[3]

Shor, Fault-tolerant quantum computation, inProceed- ings of 37th Conference on Foundations of Computer Sci- ence(1996) pp

P. Shor, Fault-tolerant quantum computation, inProceed- ings of 37th Conference on Foundations of Computer Sci- ence(1996) pp. 56–65

1996
[4]

Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics303, 2 (2003)

A. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics303, 2 (2003)

2003
[5]

Aharonov and M

D. Aharonov and M. Ben-Or, Fault-tolerant quantum com- putation with constant error rate, SIAM Journal on Com- puting38, 1207 (2008)

2008
[6]

Preskill, Quantum Computing in the NISQ era and bey- ond, Quantum2, 79 (2018)

J. Preskill, Quantum Computing in the NISQ era and bey- ond, Quantum2, 79 (2018)

2018
[7]

Arute, K

F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell,et al., Quantum supremacy using a programmable superconducting processor, Nature574, 505 (2019)

2019
[8]

Zhong, H

H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu,et al., Quantum computational advantage using photons, Science 370, 1460 (2020)

2020
[9]

Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. Van Den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, et al., Evidence for the utility of quantum computing before fault tolerance, Nature618, 500 (2023)

2023
[10]

Morvan, B

A. Morvan, B. Villalonga, X. Mi, S. Mandrà, A. Bengtsson, P.Klimov, Z.Chen, S.Hong, C.Erickson, I.Drozdov,et al., Phase transitions in random circuit sampling, Nature634, 328 (2024)

2024
[11]

Zhong, Y.-H

H.-S. Zhong, Y.-H. Deng, J. Qin, H. Wang, M.-C. Chen, L.-C. Peng, Y.-H. Luo, D. Wu, S.-Q. Gong, H. Su,et al., Phase-programmable gaussian boson sampling using stim- ulated squeezed light, Phys. Rev. Lett.127, 180502 (2021)

2021
[12]

Deng, Y.-C

Y.-H. Deng, Y.-C. Gu, H.-L. Liu, S.-Q. Gong, H. Su, Z.-J. Zhang, H.-Y. Tang, M.-H. Jia, J.-M. Xu, M.-C. Chen,et al., Gaussian boson sampling with pseudo-photon- number-resolving detectors and quantum computational 6 advantage, Phys. Rev. Lett.131, 150601 (2023)

2023
[13]

H.-L. Liu, H. Su, S.-Q. Gong, Y.-C. Gu, H.-Y. Tang, M.-H. Jia, Q. Wei, Y. Song, D. Wang, M. Zheng, et al., Robust quantum computational advantage with pro- grammable 3050-photon gaussian boson sampling (2025), arXiv:2508.09092 [quant-ph]

work page arXiv 2025
[14]

DeCross, R

M. DeCross, R. Haghshenas, M. Liu, E. Rinaldi, J. Gray, Y. Alexeev, C. H. Baldwin, J. P. Bartolotta, M. Bohn, E. Chertkov,et al., Computational power of random quantum circuits in arbitrary geometries, Phys. Rev. X15, 021052 (2025)

2025
[15]

A. D. King, A. Nocera, M. M. Rams, J. Dziarmaga, R. Wiersema, W. Bernoudy, J. Raymond, N. Kaushal, N. Heinsdorf, R. Harris,et al., Beyond-classical computa- tion in quantum simulation, Science388, 199 (2025)

2025
[16]

Gao and L

X. Gao and L. Duan, Efficient classical simulation of noisy quantumcomputation(2018),arXiv:1810.03176[quant-ph]

work page arXiv 2018
[17]

Classical Simula- tion of Quantum Supremacy Circuits

C. Huang, F. Zhang, M. Newman, J. Cai, X. Gao, Z. Tian, J. Wu, H. Xu, H. Yu, B. Yuan, M. Szegedy, Y. Shi, and J. Chen, Classical simulation of quantum supremacy cir- cuits (2020), arXiv:2005.06787 [quant-ph]

work page arXiv 2020
[18]

Pan and P

F. Pan and P. Zhang, Simulating the sycamore quantum supremacy circuits (2021), arXiv:2103.03074 [quant-ph]

work page arXiv 2021
[19]

F. Pan, K. Chen, and P. Zhang, Solving the sampling prob- lem of the sycamore quantum circuits, Phys. Rev. Lett. 129, 090502 (2022)

2022
[20]

Pan and P

F. Pan and P. Zhang, Simulation of quantum circuits using the big-batch tensor network method, Phys.Rev. Lett.128, 030501 (2022)

2022
[21]

quantum supremacy

Y. Liu, X. Liu, F. Li, H. Fu, Y. Yang, J. Song, P. Zhao, Z. Wang, D. Peng, H. Chen,et al., Closing the "quantum supremacy" gap: achieving real-time simulation of a ran- domquantumcircuitusinganewsunwaysupercomputer,in Proceedings of the International Conference for High Per- formance Computing, Networking, Storage and Analysis, SC ’21 (Association for Com...

2021
[22]

Tindall, M

J. Tindall, M. Fishman, E. M. Stoudenmire, and D. Sels, Efficient tensor network simulation of ibm’s eagle kicked ising experiment, PRX Quantum5, 010308 (2024)

2024
[23]

Begušić, J

T. Begušić, J. Gray, and G. K.-L. Chan, Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance, Science Advances10, eadk4321 (2024)

2024
[24]

C. Oh, Y. Lim, B. Fefferman, and L. Jiang, Classical sim- ulation of boson sampling based on graph structure, Phys. Rev. Lett.128, 190501 (2022)

2022
[25]

C. Oh, M. Liu, Y. Alexeev, and et al., Classical algorithm for simulating experimental gaussian boson sampling, Nat. Phys.20, 1461 (2024)

2024
[26]

Mauron and G

L. Mauron and G. Carleo, Challenging the quantum ad- vantage frontier with large-scale classical simulations of an- nealing dynamics (2025), arXiv:2503.08247 [quant-ph]

work page arXiv 2025
[27]

Tindall, A

J. Tindall, A. Mello, M. Fishman, M. Stoudenmire, and D. Sels, Dynamics of disordered quantum systems with two- and three-dimensional tensor networks (2025), arXiv:2503.05693 [quant-ph]

work page arXiv 2025
[28]

Hosseinabadi, O

H. Hosseinabadi, O. Chelpanova, and J. Marino, User- friendly truncated wigner approximation for dissipative spin dynamics, PRX Quantum6, 030344 (2025)

2025
[29]

Aharonov, M

D. Aharonov, M. Ben-Or, R. Impagliazzo, and N. Nisan, Limitations of noisy reversible computation (1996), arXiv:quant-ph/9611028 [quant-ph]

work page arXiv 1996
[30]

Aharonov, X

D. Aharonov, X. Gao, Z. Landau, Y. Liu, and U. Vazirani, A polynomial-time classical algorithm for noisy random cir- cuitsampling,inProceedings of the 55th Annual ACM Sym- posium on Theory of Computing, STOC 2023 (Association for Computing Machinery, New York, NY, USA, 2023) p. 945–957

2023
[31]

Schuster, C

T. Schuster, C. Yin, X. Gao, and N. Y. Yao, A polynomial- time classical algorithm for noisy quantum circuits (2024), arXiv:2407.12768 [quant-ph]

work page arXiv 2024
[32]

Trivedi and J

R. Trivedi and J. I. Cirac, Transitions in computational complexity of continuous-time local open quantum dynam- ics, Phys. Rev. Lett.129, 260405 (2022)

2022
[33]

Rajakumar, J

J. Rajakumar, J. D. Watson, and Y.-K. Liu, Polynomial- time classical simulation of noisy iqp circuits with constant depth, inProceedings of the 2025 Annual ACM-SIAM Sym- posium on Discrete Algorithms (SODA)(Society for Indus- trial and Applied Mathematics, 2025) p. 1037–1056

2025
[34]

Nelson, J

J. Nelson, J. Rajakumar, D. Hangleiter, and M. J. Gul- lans, Polynomial-time classical simulation of noisy circuits withnaturallyfault-tolerantgates(2024),arXiv:2411.02535 [quant-ph]

work page arXiv 2024
[35]

J. Chen, J. Jiang, D. Hangleiter, and N. Schuch, Sign problem in tensor-network contraction, PRX Quantum6, 010312 (2025)

2025
[36]

E. Y. Loh, J. E. Gubernatis, R. T. Scalettar, S. R. White, D. J. Scalapino, and R. L. Sugar, Sign problem in the nu- merical simulation of many-electron systems, Physical Re- view B41, 9301 (1990)

1990
[37]

Troyer and U.-J

M. Troyer and U.-J. Wiese, Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations, Physical Review Letters94, 170201 (2005)

2005
[38]

Chandrasekharan and U.-J

S. Chandrasekharan and U.-J. Wiese, Meron-cluster solu- tion of fermion sign problems, Physical Review Letters83, 3116 (1999)

1999
[39]

Li, Y.-F

Z.-X. Li, Y.-F. Jiang, and H. Yao, Solving the fermion sign problem in quantum Monte Carlo simulations by Majorana representation, Physical Review B91, 241117 (2015)

2015
[40]

Marvian, D

M. Marvian, D. A. Lidar, and I. Hen, On the computational complexity of curing the sign problem, Nature Communic- ations10, 1571 (2019)

2019
[41]

Völlering, Markov process representation of semigroups whose generators include negative rates, Electronic Com- munications in Probability25, 1 (2020)

F. Völlering, Markov process representation of semigroups whose generators include negative rates, Electronic Com- munications in Probability25, 1 (2020)

2020
[42]

Jin, Classical representation of the dynamics of quantum spin chains (2025), arXiv:2502.10502 [cond-mat.stat-mech]

T. Jin, Classical representation of the dynamics of quantum spin chains (2025), arXiv:2502.10502 [cond-mat.stat-mech]

work page arXiv 2025
[43]

Lindblad, On the generators of quantum dynamical semigroups, Communications in Mathematical Physics48, 119 (1976)

G. Lindblad, On the generators of quantum dynamical semigroups, Communications in Mathematical Physics48, 119 (1976)

1976
[44]

Gorini, A

V. Gorini, A. Kossakowski, and E. C. G. Sudarshan, Com- pletely positive dynamical semigroups of n-level systems, Journal of Mathematical Physics17, 821 (1976)

1976
[45]

Note that in our convention,MCC ′ means a transition from stateC ′ toC
[46]

T. E. Harris,The theory of branching processes(Springer- Verlag, 1963)

1963
[47]

D. T. Gillespie, Exact stochastic simulation of coupled chemical reactions, The Journal of Physical Chemistry81, 2340 (1977)

1977
[48]

The conservation of probability for the matrix Mtranslates into ⃗1T M= 0, which is equivalent to L∗P C PC = 0

Let ⃗1be theq k-dimensional vector with all entries equal to one. The conservation of probability for the matrix Mtranslates into ⃗1T M= 0, which is equivalent to L∗P C PC = 0. A sufficient condition to enforce this re- lation is thenP C PC ∝I
[49]

Note that the classical spin configuration basisC= {+,−} × {x, y, z}is the smallest basis fulfilling the two previous criteria
[50]

Indeed, finding the optimal gauge is generally necessary to observe the cor- rect transition to classicality

In our numerical simulations, we always perform this min- imization procedure before the runs begin. Indeed, finding the optimal gauge is generally necessary to observe the cor- rect transition to classicality
[51]

Chitambar and G

E. Chitambar and G. Gour, Quantum resource theories, 7 Rev. Mod. Phys.91, 025001 (2019)

2019
[52]

Z.-W.LiuandA.Winter,Many-bodyquantummagic,PRX Quantum3, 020333 (2022)

2022
[53]

Leone, S

L. Leone, S. F. Oliviero, and A. Hamma, Stabilizer Rényi Entropy, Physical Review Letters128, 050402 (2022)

2022
[54]

Leone and L

L. Leone and L. Bittel, Stabilizer entropies are monotones for magic-state resource theory, Phys. Rev. A110, L040403 (2024)

2024
[55]

S.R.White,Densitymatrixformulationforquantumrenor- malizationgroups,PhysicalReviewLetters69,2863(1992)

1992
[56]

Orús, A practical introduction to tensor networks: Mat- rix product states and projected entangled pair states, An- nals of Physics349, 117 (2014)

R. Orús, A practical introduction to tensor networks: Mat- rix product states and projected entangled pair states, An- nals of Physics349, 117 (2014)

2014
[57]

Doucet, N

A. Doucet, N. de Freitas, and N. Gordon,Sequential Monte Carlo Methods in Practice(Springer, New York, 2001)

2001
[58]

Del Moral, Mean field simulation for monte carlo integ- ration (2013)

P. Del Moral, Mean field simulation for monte carlo integ- ration (2013)

2013
[59]

Seidel and C

R. Seidel and C. R. Aragon, Randomized search trees, Al- gorithmica16, 464 (1996). 8 Appendix A: Single-Qubit example In this appendix, we illustrate the transition to classical CTMC on the simplest example of a single-qubit undergoing unitary rotation and dephasing: dtρ=−iτ[σ x, ρ] +γ(σ xρσx −ρ).(A1) We consider for the initial state|ψ(t= 0)⟩=|+z⟩andγ >0...

1996
[60]

Apart from the creation rateVC, the other positive terms in (8), corresponding to particle influx, are implicitly handled by simulating the outflux events

Simulating the dynamics For any given particle, one needs to simulate transitions into other configurations, given by the negative terms of (8), corresponding to escape/outflux rates. Apart from the creation rateVC, the other positive terms in (8), corresponding to particle influx, are implicitly handled by simulating the outflux events. It then is useful...
[61]

At a given timet, compute the total escape timescale,τtot =P C τC(n◦ C +n • C). 10
[62]

Draw a time step from the exponential distribution∆t∼Exp(τtot)and updatet→t+ ∆t
[63]

Choose a particle according to the probability distributionP1(C,•/◦) =n •/◦ C τC/τtot
[64]

(a) If the sign+was chosen, simply move the particle to configurationC′

After having chosen a particle in a given configurationC, choose a configuration for the destinationC′ and theM sign with probability distributionP2(C ′,±) =M ± C′C/τC. (a) If the sign+was chosen, simply move the particle to configurationC′. To implement the annihilation rule, if the opposite particle already exists inC′, delete both. (b) If the sign−was ...
[65]

Essentially, for any given initial stateρ 0, we need to be able to efficiently sample from the initial probability distributionp C(0) = tr(ρ 0PC)/3N

Sampling the initial state We have understood how to time-evolve particles according to (8), but we also need to know how to initialize them att= 0. Essentially, for any given initial stateρ 0, we need to be able to efficiently sample from the initial probability distributionp C(0) = tr(ρ 0PC)/3N. Each run starts with a single initial particle. SincepC ⩾0...
[66]

with probability1/3, choose the orientation(si, βi) = (s0 i , β0 i )
[67]

The chosen particle configuration isC= (s1, β1,

else choose a random signsi and a random axisβi ̸=β 0 i. The chosen particle configuration isC= (s1, β1, . . . , sN , βN). We can also choose initial states that are volume-law entangled and have a high degree of quantum magic. The time evolution of these states would be hard to simulate with both tensor networks and Pauli propagation methods. One 11 poss...
[68]

To do so, we expand the observable in terms of projectorsˆO= P C OCPC (the expansion is not unique)

Computing observables The final ingredient for implementing efficient simulations is computing expectation values of observables. To do so, we expand the observable in terms of projectorsˆO= P C OCPC (the expansion is not unique). The expectation value then becomes tr[ρt ˆO] = 3NX C OCpC = 3NX C OCE[n• C(t)−n ◦ C(t)].(C5) Note that this sum is over an exp...