Cache Hierarchy and Vectorization Analysis of Lindblad Master Equation Simulation for Near-Term Quantum Control
Rylan Malarchick

TL;DR
This paper analyzes cache hierarchy effects and vectorization techniques to optimize Lindblad master equation simulations for near-term quantum control, providing practical recommendations for improving computational performance.
Contribution
It systematically evaluates cache-aware data layouts and compiler optimizations, offering concrete guidelines for efficient quantum simulation code on modern CPUs.
Findings
SoA layout with -O3 -march=native -ffast-math yields 2-4x speedup.
-ffast-math enables auto-vectorization of complex arithmetic.
Cache-aware optimizations significantly improve simulation performance.
Abstract
Simulation of open quantum systems via the Lindblad master equation is a computational bottleneck in near-term quantum control workflows, including optimal pulse engineering (GRAPE), trajectory-based robustness analysis, and feedback controller design. For the system sizes relevant to near-term quantum control ( for a single transmon with leakage, for two-qubit, and for three-qubit), the dominant cost per timestep is a complex matrix-vector multiplication: a , , or dense matvec, respectively. The working set sizes (1.5 KB, 105 KB, and 8.1 MB) straddle the L1, L2, and L3 cache boundaries of modern CPUs, making this an ideal system for cache-hierarchy performance analysis. We characterize the arithmetic intensity ( FLOP/byte in the large- limit), construct a Roofline model for the propagation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Parallel Computing and Optimization Techniques
