Metraipolis › archive › dc_68ca9458c820

Explicit block encodings of rate matrices for simulating polymerization kinetics on quantum computers — arXiv:2609.08432

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08432
License (as archived)
CC0-1.0
Archived
2026-10-16T15:44:41.425Z
SHA-256 of the archived text
cc858b2b7481042b86592680db1eb2b4998d97f2828625ab55eaa50ef31d0449
Stable URL of this page
https://metraipolis.com/documento/dc_68ca9458c820

How to cite

Explicit block encodings of rate matrices for simulating polymerization kinetics on quantum computers — arXiv:2609.08432 — arXiv (en), https://arxiv.org/abs/2609.08432 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_68ca9458c820 (Metraipolis archive dc_68ca9458c820, sha256 cc858b2b7481042b86592680db1eb2b4998d97f2828625ab55eaa50ef31d0449)
BibTeX
@misc{dc68ca9458c820,
  title = {Explicit block encodings of rate matrices for simulating polymerization kinetics on quantum computers — arXiv:2609.08432},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08432},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_68ca9458c820; sha256 cc858b2b7481042b86592680db1eb2b4998d97f2828625ab55eaa50ef31d0449},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08432. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Predicting how molecular weight distribution and monomer sequence evolve during polymerization is central to polymer science, yet classical approaches face a trade-off between molecular resolution and computational cost: for copolymers, the number of distinguishable species grows exponentially with chain length. Quantum computing offers a potential alternative, provided the non-unitary rate matrices governing the kinetics can be embedded into unitary quantum circuits, a task known as block encoding. Here we construct explicit block-encoding circuits for two kinetic models of living polymerization: Model A, single-monomer polymerization, whose lower-bidiagonal rate matrix is encoded via a sparse-oracle construction and a two-term linear combination of unitaries (LCU) decomposition; and Model B, two-monomer copolymerization, where a bijective labeling of polymer species by an integer index (the m-index) yields a structured sparse matrix encoded via either a five-term LCU or a sparse-oracle construction. Numerical simulations with the sparse-oracle encodings reproduce the classical time evolution for reactivity ratios drawn from reported olefin copolymerization systems spanning near-random ($r_1 r_2 \simeq 1$) and blocky ($r_1 r_2 > 1$) microstructures, and the LCU encodings are verified by explicit reconstruction of the encoded matrix block. Resource estimation shows that both implementations require only $O(\log N)$ qubits in the matrix dimension $N$ (an exponential memory saving over the classical state space), with gate counts growing gradually, reaching $10^4$ to $10^5$ gates at $10^3$ system qubits. These results establish a concrete quantum circuit foundation for simulating polymerization kinetics on fault-tolerant quantum hardware, and a first step toward exploiting exponential state-space compression for high-dimensional polymer reaction networks.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-09 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Chemical Physics (physics.chem-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.08432 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T15:32:34.852Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).