Blockwise optimization for projective variational quantum dynamics (BLOP-VQD): Algorithm and implementation for lattice systems

We present an efficient approach to simulate real-time quantum dynamics using projected variational quantum dynamics, where the computational cost is reduced by strategically optimizing only a subset of the variational parameters at each time step. Typically, the variational Ansatz consists of repeated blocks of parameterized quantum circuits, where all parameters are updated in a standard optimization procedure. In contrast, our method selectively optimizes one block at a time while keeping the others fixed, allowing for significant reductions in computational overhead. This semi-global optimization strategy ensures that all qubits are still involved in the evolution, but the optimization is localized to specific blocks, thus avoiding the need to update all parameters simultaneously. We propose different approaches for choosing the next block for optimization, including sequential, random, and fidelity-based updation. We demonstrate the performance of the proposed methods in a series of spin-lattice models with varying sizes and complexity. Our method preserves the accuracy of the time evolution with a much lower computational cost. This new optimization strategy provides a promising path toward high-fidelity simulation of the time evolution of complex quantum systems with reduced computational resources.

Authors

Institutions

Publication Details

Journal
The Journal of Chemical Physics
Published
2025-09-22
DOI
https://doi.org/10.1063/5.0289105
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Blockwise optimization for projective variational quantum dynamics (BLOP-VQD): Algorithm and implementation for lattice systems

Harshdeep Singh, Sabyashachi Mishra, Sonjoy Majumder
The Journal of Chemical Physics
Quantum Computing Algorithms and Architecture
article

Blockwise optimization for projective variational quantum dynamics (BLOP-VQD): Algorithm and implementation for lattice systems

Harshdeep Singh, Sabyashachi Mishra, Sonjoy Majumder
article en

Abstract

We present an efficient approach to simulate real-time quantum dynamics using projected variational quantum dynamics, where the computational cost is reduced by strategically optimizing only a subset of the variational parameters at each time step. Typically, the variational Ansatz consists of repeated blocks of parameterized quantum circuits, where all parameters are updated in a standard optimization procedure. In contrast, our method selectively optimizes one block at a time while keeping the others fixed, allowing for significant reductions in computational overhead. This semi-global optimization strategy ensures that all qubits are still involved in the evolution, but the optimization is localized to specific blocks, thus avoiding the need to update all parameters simultaneously. We propose different approaches for choosing the next block for optimization, including sequential, random, and fidelity-based updation. We demonstrate the performance of the proposed methods in a series of spin-lattice models with varying sizes and complexity. Our method preserves the accuracy of the time evolution with a much lower computational cost. This new optimization strategy provides a promising path toward high-fidelity simulation of the time evolution of complex quantum systems with reduced computational resources.

The Journal of Chemical PhysicsVol. 163(12)
Indian Institute of Technology Kharagpur (IN)
Openalex Percentile: Top 86%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.