<p>Classical simulation of quantum computers is essential for designing and benchmarking quantum algorithms. Here we present <Emphasis FontCategory="NonProportional">phase2</Emphasis>, a full-state-vector simulator optimised for sequences of many-qubit Pauli rotations on distributed CPU and GPU clusters. Exploiting the common-suffix structure of Pauli-rotation circuits, the implementation reduces inter-node communication and achieves two orders of magnitude speedup for grouped rotations. We demonstrate weak and strong scaling to 40 qubits across 512 NVIDIA H100 GPUs using 32 TB of distributed memory. Applying the simulator to Hamiltonian time evolution of ruthenium-ligand active spaces up to 40 qubits, we find that the empirical Trotter error lies more than two orders of magnitude below the rigorous analytic upper bound for every active space in which the fit converged (up to 32 qubits). Practical circuit depths and simulation costs are therefore substantially smaller than the conservative estimates suggest.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

phase2: full-state vector simulation of quantum time evolution at scale

  • Marek Miller,
  • Jakob Günther,
  • Freek Witteveen,
  • Matthew S. Teynor,
  • Mihael Erakovic,
  • Markus Reiher,
  • Gemma C. Solomon,
  • Matthias Christandl

摘要

Classical simulation of quantum computers is essential for designing and benchmarking quantum algorithms. Here we present phase2, a full-state-vector simulator optimised for sequences of many-qubit Pauli rotations on distributed CPU and GPU clusters. Exploiting the common-suffix structure of Pauli-rotation circuits, the implementation reduces inter-node communication and achieves two orders of magnitude speedup for grouped rotations. We demonstrate weak and strong scaling to 40 qubits across 512 NVIDIA H100 GPUs using 32 TB of distributed memory. Applying the simulator to Hamiltonian time evolution of ruthenium-ligand active spaces up to 40 qubits, we find that the empirical Trotter error lies more than two orders of magnitude below the rigorous analytic upper bound for every active space in which the fit converged (up to 32 qubits). Practical circuit depths and simulation costs are therefore substantially smaller than the conservative estimates suggest.