Pith. sign in

REVIEW 4 major objections 5 minor 64 references

Stochastic Analysis of Entanglement-assisted Quantum Communication Channels

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Two-queue quantum channel model has an exact Gaussian fluctuation limit.

desk verdict New stochastic-averaging analysis of a quantum communication queue, with a sound FLLN but an FCLT whose Poisson equation solution doesn't solve the equation—so the fluctuation limit is unsupported. read the letter →

arxiv 2412.16157 v2 pith:V44JN43G submitted 2024-12-20 math.PR cs.NIquant-ph

Karim S. Elsayed , Olga Izyumtseva , Wasiur R. KhudaBukhsh , Amr Rizk This is my paper · ORCID
classification math.PRcs.NIquant-ph MSC 60K2568M2060F1760F05
keywords quantumcommunicationentanglement-assistedchannelqueueingtheorystochasticaveragingfunctionalcentrallimittheoremmulti-scaleMarkovchainsM/M/infinityqueuePoissonequation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper studies a communication system that can use short-lived Bell pairs (entangled qubit pairs) to accelerate the transmission of messages. It models the system as two queues: a slow message queue and a much faster 'service' queue that holds Bell pairs until they decay. The paper's goal is a rigorous asymptotic description of the slow queue when the fast queue evolves on a timescale of order $n$: it proves a Functional Law of Large Numbers (the slow queue converges to a deterministic ODE) and a Functional Central Limit Theorem (the fluctuations around that ODE converge to an explicit Gaussian process). If correct, this gives a tractable, quantitative approximation for the queue-length process in entanglement-assisted networks, including an explicit diffusion coefficient built from the fast queue's stationary structure. The proofs are probabilistic, based on stochastic averaging for martingale problems, occupation measures of the fast process, and an explicitly solved Poisson equation.

What carries the argument

The argument rests on the stochastic averaging principle for fast-slow Markov processes. The fast variable $Y_B^{(n)}$ is a birth-death process with birth rate $n\lambda$ and death rate $n(\mu+r_4(y_1))y_2$, i.e. an $M/M/\infty$ queue whose stationary distribution is Poisson with mean $m(y_1)=\lambda/(r_4(y_1)+\mu)$. Its occupation measure $\Gamma_n$ converges to the product of Lebesgue measure and this stationary distribution, which yields the averaged drift $G$ in the limiting ODE. For the fluctuations, the paper solves the Poisson equation $B_{y_1}F(y_1,\cdot)(y_2)=-h_{y_1}(y_2)$ for the frozen generator $B_{y_1}$ of the fast process, where $h_{y_1}(y_2)=r_3(y_1)(\mathbf{1}_{\{0\}}(y_2)-e^{-m(y_1)})+r_4(y_1)(y_2-m(y_1))$. The solution $F$ is explicitly linear in $y_2$ except at the indicator of zero, and substituting it into the Itô expansion yields the quadratic variation $\sigma_F(t)$ of the martingale part, enabling the Martingale Central Limit Theorem.

What would settle it

Simulate the exact model with geometric generation attempts and deterministic fidelity decay (as described in Section 5) for a range of parameters, and compare the empirical variance of the scaled fluctuations to the predicted $\sigma_F(t)$; a systematic discrepancy that grows with the departure from exponential lifetimes would show that the $M/M/\infty$ averaging limit is not robust.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that the multi-scale queueing system has a well-defined averaging limit with Gaussian fluctuations. Precisely, for the scaled message queue $Y_A^{(n)} = X_A^{(n)}/n$, Theorem 1 shows that $(Y_A^{(n)}, \Gamma_n)$ is relatively compact and every limit point satisfies $\Gamma(ds\times dz) = ds\,\pi(dz)$ with $\pi$ the stationary Poisson distribution $\pi(k)=e^{-m(y_1)}m(y_1)^k/k!$, $m(y_1)=\lambda/(r_4(y_1)+\mu)$, and $y_A$ solving the ODE $d y_A/dt = r_1(y_A)-r_3(y_A)e^{-m(y_A)}-r_4(y_A)m(y_A)$. Theorem 2 then shows that $W_n=\sqrt{n}(Y_A^{(n)}-y_A)$ converges in distribution to the unique solution of $dW(t)=\partial G(y_A(t))W(t)\,dt+\sqrt{\sigma_F(t)}\,dB(t)$, with $\sigma_F$ given by an explicit formula in terms of the solution $F(y_1,y_2)=u_1(y_1)\mathbf{1}_{\{0\}}(y_2)+u_2(y_1)y_2$ of the Poisson equation $B_{y_1}F=-h_{y_1}$. Thus the paper claims that the diffusion approximation is not just a heuristic: it is the exact fluctuation limit under the stated Poisson and exponential assumptions.

Load-bearing premise

The fast queue is assumed to be an $M/M/\infty$ queue: Bell pairs arrive as a Poisson process and have independent exponential lifetimes, and the entanglement-assisted service rate is linear in the number of buffered pairs; if real lifetimes are not exponential, the stationary distribution $\pi$ and hence the averaged drift and diffusion change.

Editorial extensions

If this is right

  • For large $n$, the message queue length can be approximated by the deterministic ODE, with error of order $n^{-1/2}$.
  • The explicit $\sigma_F$ gives a closed-form diffusion coefficient for the fluctuation process, so confidence intervals and queueing performance metrics can be computed without simulating the fast process.
  • The FCLT implies a diffusion approximation for the queue that can be used to study rare events or boundary behavior (e.g., near-empty queues) via Gaussian process theory.
  • The same averaging machinery applies to other two-timescale queueing networks, provided the fast queue has a unique stationary distribution and a solvable Poisson equation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable extension is to replace the exponential lifetime of Bell pairs by a deterministic or geometric decay and compare the exact stationary distribution of the fast queue with the Poisson $\pi$; the FCLT's covariance would then need correction.
  • The explicit Gaussian limit suggests that performance metrics such as the probability of buffer emptiness or the hitting time to a large queue can be approximated using Volterra Gaussian process local times, a direction the authors point to but do not develop.
  • The model's reparametrization for quantum switch and graph-state distribution indicates the averaging limit may extend beyond entanglement-assisted communication to general buffered quantum-network services, but the load-bearing $M/M/\infty$ assumption would have to be re-examined for those settings.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. This paper develops a two-timescale continuous-time Markov chain model for an entanglement-assisted quantum communication system. Queue A stores messages and is served either classically (rate r3) or, when Bell pairs are available, with entanglement-assisted service (rate r4 times the number of buffered pairs); queue B stores Bell pairs, with generation rate nλ and decay rate nμ per pair. After scaling A by n and keeping B unscaled, the authors prove a functional law of large numbers (Theorem 1) in which A converges to the solution of the ODE ẏ_A = r1(y_A) − r3(y_A)e^{−m(y_A)} − r4(y_A)m(y_A), with m = λ/(r4 + μ), and a functional central limit theorem (Theorem 2) for the √n fluctuations around this ODE, with an explicit diffusion coefficient σ_F obtained from a Poisson equation for the frozen fast process. The proofs use martingale methods, occupation measures, and stochastic averaging results of Kurtz, supplemented by simulation and engineering discussion.

Significance. Should the FCLT be correct, the paper would provide a rigorous stochastic-averaging/QSSA treatment of a practically motivated quantum queueing model, with the explicit variance formula being a useful engineering prediction that can be checked by simulation. The paper is transparent about the physical approximations (Poisson generation attempts, exponential entanglement lifetimes), and the FLLN proof strategy is standard and plausible. The main caveat is that the explicit Poisson equation solution underlying Theorem 2 is incorrect for r3 > 0, so the paper's central fluctuation result and its variance formula are not currently established. The strengths—explicit stationary distribution, martingale decomposition, and simulation support—do not compensate for this gap.

major comments (4)
  1. [Sec. 4, Lemma 2, Eq. (18) and Theorem 2] For y2 ≥ 2, using the ansatz F = u1 1_{0} + u2 y2, a direct calculation gives B_{y1}F(y2) = λu2 − (r4(y1) + μ)y2 u2. Equation (18) requires this to equal −h_{y1}(y2) = r3(y1)e^{−m(y1)} − r4(y1)y2 + r4(y1)m(y1) for every y2 ≥ 2. Matching the coefficient of y2 forces u2 = r4/(r4 + μ); the constant term then requires λu2 = r3 e^{−m} + r4 m, which, because λu2 = r4 m, reduces to r3 e^{−m} = 0. Thus for r3 > 0 no solution of the stated linear-plus-indicator form exists, and the displayed u1, u2 in Lemma 2 do not satisfy Eq. (18). Since the FCLT proof uses nB_{Y_A}F = −nh inside the Itô expansion and builds σ_F from u1, u2, Theorem 2 and the formula for σ_F are not justified as stated. The authors need to recompute the Poisson equation solution (which will not be of this simple form when r3 > 0) and the corresponding σ_F, or restrict the FCLT to r3 = 0.
  2. [Sec. 4, proof of Theorem 2, around Eq. (21)] The displayed substitution has a sign error. From the Itô expansion F(Y^{(n)}(t)) − F(Y^{(n)}(0)) = −n∫h ds + ∫δ^{(n)}_F ds + M^{(n)}_F(t), one obtains √n∫h ds = −(1/√n)(F(t) − F(0)) + (1/√n)∫δ^{(n)}_F ds + (1/√n)M^{(n)}_F(t). The paper instead writes the opposite signs, and consequently defines \tilde M^{(n)} = M_A^{(n)} + (1/√n)M_F^{(n)} with the wrong sign; the correct martingale is M_A^{(n)} − (1/√n)M_F^{(n)}. Because quadratic variation is unaffected by the sign, the limiting SDE is unchanged, but the displayed equation (21) and the martingale definition should be corrected.
  3. [Sec. 3, Identification of the limit, proof of Theorem 1] The identification Γ(ds × dz) = ds × π(dz) is asserted by reference to [46, Example 2.3] without verifying the hypotheses of that result: the required continuity/Feller properties of the frozen generator in y1, the integrability conditions, and the uniqueness of the martingale problem for the averaged limit. Since this product-form identification is the central step that converts the limit martingale into the ODE (11), the authors should either verify these conditions explicitly or state and prove a self-contained averaging lemma adapted to their model.
  4. [Sec. 4, convergence of (1/√n)F(Y^{(n)})] The proof that (1/√n)∥Y^{(n)}_B∥_{C[0,T]} → 0 in probability uses P(sup Y^{(n)}_B/√n > k) ≤ e^{βT}\barϕ(n, √n k) and then refers to Remark 1. Remark 1 only treats \barϕ(n, k) for fixed k, whereas here the second argument is √n k, so the claimed limit does not follow from the cited remark. A separate estimate—for example using Y^{(n)}_B(t) ≤ N(nλt) with N a unit-rate Poisson process and a large-deviation/Chebyshev bound—is needed to justify this step.
minor comments (5)
  1. [Lemma 2] The formula for u1 contains exp(m(1)) where m(y1) is evidently intended; as written the expression is not a function of y1 in the exponent and is internally inconsistent.
  2. [Acronyms and abstract] The acronym list contains typos 'FCL T' and 'MCL T'; the abstract contains 'probablistic'; these should be corrected.
  3. [Theorem 2, statement of σ_F] The theorem calls σ_F 'positive increasing'; since σ_F(t) is an integral of a nonnegative function, 'nondecreasing' would be the accurate term.
  4. [Section 5] The relation of the CTMC model to physical entanglement generation (geometric attempt times, deterministic fidelity decay) is acknowledged as an approximation; the paper should state explicitly in Theorem 1 and Theorem 2 that the theorems concern the idealized CTMC model, not the physical process.
  5. [Lemma 1 proof] In the proof of Lemma 1, the function g^{(n)}_α(t, y) is independent of y1 although the generator L^n acts on functions of (y1, y2); this is not an error, but the dependence should be clarified to avoid confusion.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the FLLN and FCLT are derived from the stated Markov model, the frozen generator, and an explicitly solved Poisson equation, with no fitted or re-imported quantities.

full rationale

The derivation chain is self-contained. Theorem 1 is proved from the generator L^n in Eq. (4), the frozen generator B_{y_1} in Eq. (7), its stationary distribution in Eq. (8), and the stochastic averaging theorem [46, Theorem 2.1], with all quantities defined in the paper. Theorem 2 is proved by centring the slow variable around the ODE (11), solving the Poisson equation (18) in Lemma 2, and applying the martingale CLT; the diffusion coefficient sigma_F is computed explicitly from r1, r3, r4, lambda, mu and the Poisson solution, not calibrated to data. The skeptical concern that Lemma 2's claimed solution does not satisfy Eq. (18) for y2 >= 2 unless r3 = 0 would be a mathematical error or an unsupported claim, not a circular reduction: Lemma 2 is an asserted computation inside the proof, not an input that is later renamed as a prediction. The self-citations are peripheral and non-load-bearing: [22,23] motivate the purification-based form of r4 in the discussion section, [26,38] are contextual citations on quasi-steady-state approximations, and [35] is a pointer in Remark 3 for local times of Volterra Gaussian processes. None of these enter the proofs of Theorem 1 or Theorem 2. The paper also explicitly acknowledges the M/M/infinity approximation of the fast queue in Section 5, which is a modelling limitation rather than a circular step. There is no fitted-input-called-prediction, no uniqueness theorem imported from the authors' prior work, and no ansatz smuggled in via self-citation. The central claims therefore stand or fall on the correctness of the proofs as written, not on circularity.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters are fitted to data; lambda, mu, and the rate functions r1, r3, r4 are abstract model inputs, and the simulation parameter M is illustrative only and does not enter the limit statements. No new physical entities are postulated; the model is a queueing abstraction of known Bell-pair generation, storage, and consumption processes.

assumptions (5)
  • domain assumption Fast queue B evolves as an M/M/infinity birth-death process with birth rate n*lambda and death rate n*mu per customer (Eq. 7), implying exponential lifetimes and Poisson generation.
    Section 5 acknowledges actual entanglement generation attempts follow a geometric distribution and fidelity decay is deterministic; the exponential and Poisson model is an approximation, so the stationary distribution pi in Eq. (8) is a model input.
  • standard math The stochastic averaging theorem of Kurtz [46, Theorem 2.1] is valid for the two-timescale process (Y_A, Gamma_n).
    Invoked in the Theorem 1 proof to obtain the martingale problem for limit points; the paper verifies conditions heuristically but does not prove all of them.
  • domain assumption The assisted service rate scales as n*r4(y1)*x2, linearly in the number of buffered Bell pairs.
    Section 5 states each entanglement acts as an additional server consumed upon use; this linearity enters the frozen generator and the ODE drift.
  • domain assumption Classical service applies only when the entanglement queue is empty, via the indicator 1_{0}(x2) in Eq. (1).
    This protocol assumption, entanglement use whenever available, is core to the form of the averaged drift G.
  • domain assumption Rate functions r1, r3, r4 are Lipschitz, twice differentiable for the FCLT, with r1(0) > 0 and r3(0) = r4(0) = 0.
    Stated in Section 2 to avoid trivialities and absorbing states; needed for moment estimates and Gronwall arguments.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Stochastic Analysis of Entanglement-assisted Quantum Communication Channels." pith.science (2026). https://pith.science/paper/V44JN43G

@misc{pith2026241216157,
  author       = {Pith},
  title        = {Pith review of: Stochastic Analysis of Entanglement-assisted Quantum Communication Channels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/V44JN43G}},
  note         = {Machine review of arXiv:2412.16157}
}
read the original abstract

We present a queueing model for a quantum communication network consisting of a primary queue and a service queue in which Bell pairs are formed and stored. The Bell pairs are inherently extremely short-lived rendering the service queue (the quantum queue) much faster than the primary queue. We study the asymptotic behaviour of this multi-scale queueing system via a stochastic averaging principle. We prove a Functional Law of Large Numbers (FLLN) and a Functional Central Limit Theorem (FCLT) for the standard queue averaging the dynamics of the fast service queue.

Figures

Figures reproduced from arXiv: 2412.16157 by the authors.

Figure 2
Figure 2. (Left) Accuracy of the FLLN approximation for the scaled queue lengths Y (n) A by the deterministic function yA solving the ODE in Equation (11) in Theorem 1. The stochastic simulations are performed using the standard Doob–Gillespie’s algorithm [1, 63]. A total of 100 trajectories are shown in this figure. (Right) Steady state values of the scaled queue length at queue A as a function of the arrival rate λB at the … view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

64 extracted references · 49 canonical work pages

  1. [46]

    Averaging for martingale problems and stochastic ap- proximation, in: Karatzas, I., Ocone, D

    Kurtz, T.G., 1992. Averaging for martingale problems and stochastic ap- proximation, in: Karatzas, I., Ocone, D. (Eds.), Applied Stochastic Anal- ysis, Springer Berlin Heidelberg, Berlin, Heidelberg. pp. 186–209

    work page 1992

  2. [1]

    Continuous time markov chain models for chemical reaction networks, in: Design and Analysis of Biomolecular Circuits

    Anderson, D.F., Kurtz, T.G., 2011. Continuous time markov chain models for chemical reaction networks, in: Design and Analysis of Biomolecular Circuits. Springer, pp. 3–42

    work page 2011

  3. [2]

    Lévy Processes and Stochastic Calculus

    Applebaum, D., 2009. Lévy Processes and Stochastic Calculus. Cambridge Studies in Advanced Mathematics. 2 ed., Cambridge University Press

    work page 2009

  4. [3]

    Quantum repeaters: From quantum networks to the quantum internet

    Azuma, K., Economou, S.E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.K., Tzitrin, I., 2023. Quantum repeaters: From quantum networks to the quantum internet. Reviews of Modern Physics 95, 045006

    work page 2023

  5. [4]

    Asymptotic anal- ysis of multiscale approximations to reaction networks

    Ball, K., Kurtz, T.G., Popovic, L., Rempala, G.A., 2006. Asymptotic anal- ysis of multiscale approximations to reaction networks. Annals of Applied Probability 16, 1925–1961

    work page 2006

  6. [5]

    Fusion-based quantum computation

    Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno- Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., Pastawski, F., Rudolph, T., Sparrow, C., 2023. Fusion-based quantum computation. Nat Commun 14

    work page 2023

  7. [6]

    Switch net- works for photonic fusion-based quantum computingarXiv:2109.13760

    Bartolucci, S., Birchall, P., Bonneau, D., Cable, H., Gimeno-Segovia, M., Kieling, K., Nickerson, N., Rudolph, T., Sparrow, C., 2021. Switch net- works for photonic fusion-based quantum computingarXiv:2109.13760

    arXiv 2021

  8. [7]

    Entanglement-assisted classical capacity of noisy quantum channels

    Bennett, C.H., Shor, P.W., Smolin, J.A., Thapliyal, A.V., 1999. Entanglement-assisted classical capacity of noisy quantum channels. Phys- ical Review Letters 83, 3081

    work page 1999

Show all 64 references
  1. [8]

    Entanglement-assisted capacity of a quantum channel and the reverse shan- non theorem

    Bennett, C.H., Shor, P.W., Smolin, J.A., Thapliyal, A.V., 2002. Entanglement-assisted capacity of a quantum channel and the reverse shan- non theorem. IEEE transactions on Information Theory 48, 2637–2655. 35

    2002

  2. [9]

    Convergence of Probability Measures

    Billingsley, P., 1999. Convergence of Probability Measures. Wi- ley. URL: https://doi.org/10.1002/9780470316962, doi: 10.1002/ 9780470316962

    1999 doi

  3. [10]

    Generators of Markov Chains: From a Walk in the Interior to a Dance on the Boundary

    Bobrowski, A., 2020. Generators of Markov Chains: From a Walk in the Interior to a Dance on the Boundary. Cambridge University Press. URL: http://dx.doi.org/10.1017/9781108863070, doi:10.1017/ 9781108863070

    2020 doi

  4. [11]

    Mixed state dense coding and its relation to entanglement measures

    Bose, S., Plenio, M.B., Vedral, V., 2000. Mixed state dense coding and its relation to entanglement measures. Journal of Modern Optics 47, 291–310

    2000

  5. [12]

    Point process calculus in time and space— an introduction with applications

    Brémaud, P., [2020] ©2020. Point process calculus in time and space— an introduction with applications. volume 98 of Probability Theory and Stochastic Modelling. Springer, Cham. URL:https://doi.org/10.1007/ 978-3-030-62753-9, doi:10.1007/978-3-030-62753-9

    2020 doi

  6. [13]

    Analysis and Approximation of Rare Events: Representations and Weak Convergence Methods

    Budhiraja, A., Dupuis, P., 2019. Analysis and Approximation of Rare Events: Representations and Weak Convergence Methods. Springer US. doi:10.1007/978-1-4939-9579-0

    2019 doi

  7. [14]

    When entanglement meets classical communications: Quantum teleportation for the quantum internet

    Cacciapuoti, A.S., Caleffi, M., Van Meter, R., Hanzo, L., 2020. When entanglement meets classical communications: Quantum teleportation for the quantum internet. IEEE Transactions on Communications 68, 3808– 3833

    2020

  8. [15]

    On the poisson equation for piecewise-deterministic markov processes

    Costa, O.L.V., Dufour, F., 2003. On the poisson equation for piecewise-deterministic markov processes. SIAM Journal on Control and Optimization 42, 985–1001. URL: http://dx.doi.org/10.1137/ S0363012901393523, doi:10.1137/s0363012901393523

    2003 doi

  9. [16]

    Convergence of stochastic gene networks to hybrid piecewise deterministic processes

    Crudu, A., Debussche, A., Muller, A., Radulescu, O., 2012. Convergence of stochastic gene networks to hybrid piecewise deterministic processes. The Annals of Applied Probability 22. doi:10.1214/11-aap814

    2012 doi

  10. [17]

    A link layer protocol for quantum networks, in: Proceedings of the ACM special interest group on data communication, pp

    Dahlberg, A., Skrzypczyk, M., Coopmans, T., , et al., 2019. A link layer protocol for quantum networks, in: Proceedings of the ACM special interest group on data communication, pp. 159–173

    2019

  11. [18]

    Quantum queuing delay

    Dai, W., Peng, T., Win, M.Z., 2020. Quantum queuing delay. IEEE Journal on Selected Areas in Communications 38, 605–618. doi: 10.1109/JSAC. 2020.2969000

    2020

  12. [19]

    Tools for the analysis of quantum protocols requiring state generation within a time window

    Davies, B., Beauchamp, T., Vardoyan, G., Wehner, S., 2023a. Tools for the analysis of quantum protocols requiring state generation within a time window. arXiv preprint arXiv:2304.12673

    arXiv

  13. [20]

    Entanglement buffering with two quantum memories

    Davies, B., Iñesta, Á.G., Wehner, S., 2023b. Entanglement buffering with two quantum memories. arXiv preprint arXiv:2311.10052 . 36

    arXiv

  14. [21]

    Quantum privacy amplification and the security of quantum cryptography over noisy channels

    Deutsch, D., et al., 1996. Quantum privacy amplification and the security of quantum cryptography over noisy channels. Physical review letters 77, 2818

    1996

  15. [22]

    On the fidelity dis- tribution of link-level entanglements under purification

    Elsayed, K., KhudaBukhsh, W.R., Rizk, A., 2023. On the fidelity dis- tribution of link-level entanglements under purification. arXiv preprint arXiv:2310.18198

    2023 arXiv

  16. [23]

    On the fidelity distri- bution of purified link-level entanglements, in: IEEE International Confer- ence on Communications (ICC), pp

    Elsayed, K.S., KhudaBukhsh, W.R., Rizk, A., 2024. On the fidelity distri- bution of purified link-level entanglements, in: IEEE International Confer- ence on Communications (ICC), pp. 485–490

    2024

  17. [24]

    A unified framework for limit results in chemical reaction networks on multiple time-scales

    Enger, T., Pfaffelhuber, P., 2023. A unified framework for limit results in chemical reaction networks on multiple time-scales. Electronic Journal of Probability 28. doi:10.1214/22-ejp897

    2023 doi

  18. [25]

    Markov Processes: Characterization and Convergence

    Ethier, S.N., Kurtz, T.G., 1986. Markov Processes: Characterization and Convergence. volume 282. John Wiley & Wiley

    1986

  19. [26]

    Enzyme kinetic reactions as in- teracting particle systems: Stochastic averaging and parameter inference

    Ganguly, A., KhudaBukhsh, W.R., 2024. Enzyme kinetic reactions as in- teracting particle systems: Stochastic averaging and parameter inference. URL: https://arxiv.org/abs/2409.06565, arXiv:2409.06565

    2024 arXiv

  20. [27]

    Generation and distributionofghzstatesinquantumnetworks, in: 2023IEEEInternational Conference on Quantum Computing and Engineering (QCE), IEEE

    Ghaderibaneh, M., Gupta, H., Ramakrishnan, C., 2023. Generation and distributionofghzstatesinquantumnetworks, in: 2023IEEEInternational Conference on Quantum Computing and Engineering (QCE), IEEE. pp. 1120–1131

    2023

  21. [28]

    A Liapounov bound for solutions of the Poisson equation

    Glynn, P.W., Meyn, S.P., 1996. A Liapounov bound for solutions of the Poisson equation. Annals of Probability 24, 916–931. doi:10.1214/aop/ 1039639370

    1996 doi

  22. [29]

    Entanglement-assisted communication surpassing the ultimate classical ca- pacity

    Hao, S., Shi, H., Li, W., Shapiro, J.H., Zhuang, Q., Zhang, Z., 2021. Entanglement-assisted communication surpassing the ultimate classical ca- pacity. Physical Review Letters 126, 250501

    2021

  23. [30]

    On stochastic processes defined by differential equations with a small parameter

    Has’minskii, R.Z., 1966. On stochastic processes defined by differential equations with a small parameter. Theory of Probability & Its Applications 11, 211–228. URL: http://dx.doi.org/10.1137/1111018, doi:10.1137/ 1111018

    1966 doi

  24. [31]

    Canonical representations of Gaussian processes and their applications

    Hida, T., 1960/61. Canonical representations of Gaussian processes and their applications. Mem. Coll. Sci. Univ. Kyoto Ser. A. Math. 33, 109–

    1960

  25. [32]

    Channels with cooperation links that may be absent

    Huleihel, W., Steinberg, Y., 2017. Channels with cooperation links that may be absent. IEEE Transactions on Information Theory 63, 5886–5906. 37

    2017

  26. [33]

    (Eds.), 2014

    Ikeda, N., Watanabe, S. (Eds.), 2014. Stochastic Differential Equations and Diffusion Processes. North Holland

    2014

  27. [34]

    On the existence and uniqueness of solutions of stochastic integral equations of the Volterra type

    Ito, I., 1979. On the existence and uniqueness of solutions of stochastic integral equations of the Volterra type. Kodai Math. J. 2, 158–170. URL: http://projecteuclid.org/euclid.kmj/1138036013

    1979

  28. [35]

    Local times of self-intersection and sample path properties of volterra gaussian processes

    Izyumtseva, O., KhudaBukhsh, W.R., 2024. Local times of self-intersection and sample path properties of volterra gaussian processes. URL:https: //arxiv.org/abs/2409.04377, arXiv:2409.04377

    2024 arXiv

  29. [36]

    Limit Theorems for Stochastic Processes

    Jacod, J., Shiryaev, A.N., 2003. Limit Theorems for Stochastic Processes. Springer-Verlag Berlin Heidelberg

    2003

  30. [37]

    Random Measures, Theory and Applications

    Kallenberg, O., 2017. Random Measures, Theory and Applications. Springer International Publishing. URL: http://dx.doi.org/10.1007/ 978-3-319-41598-7, doi:10.1007/978-3-319-41598-7

    2017 doi

  31. [38]

    Quasi-Steady-State Approximations Derived from the Stochastic Model of Enzyme Kinetics

    Kang, H.W., KhudaBukhsh, W.R., Koeppl, H., Rempała, G.A., 2019. Quasi-Steady-State Approximations Derived from the Stochastic Model of Enzyme Kinetics. Bulletin of Mathematical Biology 81, 1303–1336

    2019

  32. [39]

    Separation of time-scales and model re- duction for stochastic reaction networks

    Kang, H.W., Kurtz, T.G., 2013. Separation of time-scales and model re- duction for stochastic reaction networks. Annals of Applied Probability 23, 529–583

    2013

  33. [40]

    Central limit theorems and diffusion approximations for multiscale Markov chain models

    Kang, H.W., Kurtz, T.G., Popovic, L., 2014. Central limit theorems and diffusion approximations for multiscale Markov chain models. Annals of Applied Probability 24, 721–759

    2014

  34. [41]

    Brownian Motion and Stochastic Calculus

    Karatzas, I., Shreve, S.E., 1991. Brownian Motion and Stochastic Calculus. 2 ed., Springer-Verlag New York

    1991

  35. [42]

    A limit theorem for the solutions of differen- tial equations with random right-hand sides

    Khas’minskii, R.Z., 1966. A limit theorem for the solutions of differen- tial equations with random right-hand sides. Theory of Probability & Its Applications 11, 390–406. URL: http://dx.doi.org/10.1137/1111038, doi:10.1137/1111038

    1966 doi

  36. [43]

    The validity of quasi-steady-state approximations in discrete stochastic simulations

    Kim, J., Josić, K., Bennett, M., 2014. The validity of quasi-steady-state approximations in discrete stochastic simulations. Biophysical Journal 107, 783–793. doi:10.1016/j.bpj.2014.06.012

    2014 doi

  37. [44]

    Misuse of the michaelis–menten rate law for protein interaction networks and its remedy

    Kim, J.K., Tyson, J.J., 2020. Misuse of the michaelis–menten rate law for protein interaction networks and its remedy. PLOS Computational Biology 16, e1008258. doi:10.1371/journal.pcbi.1008258

    2020 doi

  38. [45]

    Scaling Limits of Interacting Particle Sys- tems

    Kipnis, C., Landim, C., 1999. Scaling Limits of Interacting Particle Sys- tems. Springer Berlin Heidelberg. URL: http://dx.doi.org/10.1007/ 978-3-662-03752-2, doi:10.1007/978-3-662-03752-2. 38

    1999 doi

  39. [47]

    Equivalence of Stochastic Equations and Martin- gale Problems

    Kurtz, T.G., 2010. Equivalence of Stochastic Equations and Martin- gale Problems. Springer Berlin Heidelberg. p. 113–130. doi: 10.1007/ 978-3-642-15358-7_6

    2010

  40. [48]

    Stochastic approximation: a survey

    Kushner, H., 2009. Stochastic approximation: a survey. WIREs Compu- tational Statistics 2, 87–96. URL:http://dx.doi.org/10.1002/wics.57, doi:10.1002/wics.57

    2009 doi

  41. [49]

    Analysis of stochastic chemical reaction networks with a hierarchy of timescales

    Laurence, L., Robert, P., 2024. Analysis of stochastic chemical reaction networks with a hierarchy of timescales. URL:https://arxiv.org/abs/ 2408.15697, arXiv:2408.15697

    2024 arXiv

  42. [50]

    A quan- tum router architecture for high-fidelity entanglement flows in quantum networks

    Lee, Y., Bersin, E., Dahlberg, A., Wehner, S., Englund, D., 2022. A quan- tum router architecture for high-fidelity entanglement flows in quantum networks. npj Quantum Inf 8

    2022

  43. [51]

    Quantum Computation and Quan- tum Information: 10th Anniversary Edition

    Nielsen, M.A., Chuang, I.L., 2010. Quantum Computation and Quan- tum Information: 10th Anniversary Edition. Cambridge University Press. doi:10.1017/CBO9780511976667

    2010 doi

  44. [52]

    Markov Chains

    Norris, J.R., 1997. Markov Chains. Cambridge University Press. doi:10. 1017/cbo9780511810633

    1997

  45. [53]

    Communication with unreliable entanglement assistance

    Pereg, U., Deppe, C., Boche, H., 2023. Communication with unreliable entanglement assistance. IEEE Transactions on Information Theory

    2023

  46. [54]

    Realization of a multin- ode quantum network of remote solid-state qubits

    Pompili, M., Hermans, S.L., Baier, S., et al., 2021. Realization of a multin- ode quantum network of remote solid-state qubits. Science 372, 259–264

    2021

  47. [55]

    Deterministic enhancement of co- herent photon generation from a nitrogen-vacancy center in ultrapure dia- mond

    Riedel, D., Söllner, I., Shields, B.J., Starosielec, S., Appel, P., Neu, E., Maletinsky, P., Warburton, R.J., 2017. Deterministic enhancement of co- herent photon generation from a nitrogen-vacancy center in ultrapure dia- mond. Phys. Rev. X 7, 031040

    2017

  48. [56]

    Stochastic networks and queues

    Robert, P., 2003. Stochastic networks and queues. volume 52 of Ap- plications of Mathematics (New York) . French ed., Springer-Verlag, Berlin. URL: https://doi.org/10.1007/978-3-662-13052-0, doi:10. 1007/978-3-662-13052-0. stochastic Modelling and Applied Probability

    2003 doi

  49. [57]

    Diffusions, Markov processes, and mar- tingales

    Rogers, L.C.G., Williams, D., 2000. Diffusions, Markov processes, and mar- tingales. Vol. 2. Cambridge Mathematical Library, Cambridge University Press, Cambridge. URL: https://doi.org/10.1017/CBO9781107590120, doi:10.1017/CBO9781107590120. itô calculus, Reprint of the second ...

    1994 doi

  50. [58]

    Decoherence: and the quantum-to-classical tran- sition

    Schlosshauer, M.A., 2007. Decoherence: and the quantum-to-classical tran- sition. Springer Science & Business Media

    2007

  51. [59]

    Validity of the michaelis–menten equation – steady-state or reactant stationary assumption: that is the question

    Schnell, S., 2013. Validity of the michaelis–menten equation – steady-state or reactant stationary assumption: that is the question. The FEBS Journal 281, 464–472. doi:10.1111/febs.12564

    2013 doi

  52. [60]

    On the stochastic analysis of a quantum entanglement switch

    Vardoyan, G., Guha, S., Nain, P., Towsley, D., 2019. On the stochastic analysis of a quantum entanglement switch. ACM SIGMETRICS Perfor- mance Evaluation Review 47, 27–29

    2019

  53. [61]

    On the exact anal- ysis of an idealized quantum switch

    Vardoyan, G., Guha, S., Nain, P., Towsley, D., 2021. On the exact anal- ysis of an idealized quantum switch. ACM SIGMETRICS Performance Evaluation Review 48, 79–80

    2021

  54. [62]

    Proofs of the martingale FCLT

    Whitt, W., 2007. Proofs of the martingale FCLT. Probab. Surv. 4, 268–302. URL: https://doi.org/10.1214/07-PS122, doi:10.1214/07-PS122

    2007 doi

  55. [63]

    Stochastic Modelling for Systems Biology

    Wilkinson, D.J., 2018. Stochastic Modelling for Systems Biology. Chapman and Hall/CRC. 40

    2018

  56. [155]

    URL: https://doi.org/10.1215/kjm/1250776062, doi: 10.1215/ kjm/1250776062

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.