Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The Journal of Chemical Physics

Matching-pursuit for simulations of quantum processes

Yinghua Wu, Víctor S. Batista

Published Apr 3, 2003• 89 citations
Publisher

Abstract

The matching-pursuit algorithm is implemented to develop an extension of the split-operator Fourier transform method to a nonorthogonal, nonuniform and dynamically adaptive coherent-state representation. The accuracy and efficiency of the computational approach are demonstrated in simulations of deep tunneling and long time dynamics by comparing our simulation results with the corresponding benchmark calculations.

DOI
10.1063/1.1560636

Related papers

Quantum tunneling dynamics in multidimensional systems: A matching-pursuit description

Yinghua Wu, Víctor S. Batista

Rigorous simulations of quantum tunneling dynamics in model systems with up to 20 coupled degrees of freedom are reported. The simulations implement an extension of the recently developed matching-pursuit/split-operator Fourier-transform method to complex-valued coherent-state representations. The resulting method recursively applies the time-evolution operator, as defined by the Trotter expansion to second order accuracy, in dynamically adaptive coherent-state representations generated by an approach that combines the matching-pursuit algorithm with a gradient-based optimization method.

The Journal of Chemical Physics•Jul 8, 2004•59 citations

Quantum dynamics using a discretized coherent state representation: An adaptive phase space method

L. Mauritz Andersson

We introduce a discretized coherent state representation (DCSR) for quantum dynamics. Expansion of a wave function in the nonorthogonal slightly overcomplete set is made with an identity operator computed using an iterative refinement method. Calculating the inverse of the overlap matrix is not necessary. The result is an accurate and efficient representation, where you only put basis functions in the region of phase space where the wave function is nonvanishing. Compared to traditional spatial grid methods, fewer grid points are needed. The DCSR can be viewed as an application of the Weyl–Heisenberg frame and extends it into a useful computational method. A scheme for fully quantum mechanical propagation is constructed and applied to the realistic problem of highly excited vibration in the heavy diatomic molecule Rb2. Compared to split-operator propagation in a conventional spatial grid, an order of magnitude longer time steps can be taken and fewer grid points are needed. The computational effort scales linearly with the number of basis functions. Nonreflecting boundary conditions are a natural property of the representation and is illustrated in a model of predissociation.

The Journal of Chemical Physics•Jul 15, 2001•33 citations

Topological Quantum Simulation Adaptive Subspace

Jincheng Zhang

This paper presents a novel quantum simulation algorithm, termed the Adaptive Subspace Quantum Simulation (ASQS), designed to enhance the accuracy of quantum system simulations through dynamic sub-space adjustment. Traditional quantum simulation methods frequently rely on fixed sub-spaces, limiting the potential for nuanced modeling and accurate results. This research introduces a framework where the quantum system's sub-space is continuously adapted to the input data, optimizing the simulation process. We detail the algorithm's design, implementation, and validation through a series of benchmark simulations. The results demonstrate a significant improvement in simulation accuracy and computational efficiency compared to existing approaches.

•Sep 3, 2026•0 citations

Adaptive Dynamic Topology Transformation of Quantum States

Jincheng Zhang

This paper investigates the application of adaptive dynamic topology transformations to quantum states, aiming to enhance the precision and efficiency of quantum computation and simulation. Traditional methods often rely on static transformations, limiting the algorithm's flexibility. We propose a novel approach that dynamically alters the quantum state through a series of carefully designed transformations, offering improved accuracy and potential for novel quantum phenomena. This work explores the fundamental principles behind this dynamic approach and outlines a preliminary implementation demonstrating enhanced performance in specific quantum algorithms.

•Aug 31, 2026•0 citations

Matching-pursuit/split-operator-Fourier-transform computations of thermal correlation functions

Xin Chen, Yinghua Wu, Víctor S. Batista

A rigorous and practical methodology for evaluating thermal-equilibrium density matrices, finite-temperature time-dependent expectation values, and time-correlation functions is described. The method involves an extension of the matching-pursuit/split-operator-Fourier-transform method to the solution of the Bloch equation via imaginary-time propagation of the density matrix and the evaluation of Heisenberg time-evolution operators through real-time propagation in dynamically adaptive coherent-state representations.

The Journal of Chemical Physics•Feb 1, 2005•11 citations

基于多尺度量子过程的计算模型

Jincheng Zhang

This research explores the development of a novel computational model predicated on the principles of quantum processes. The core aim is to create a framework capable of simulating complex systems' evolution and behavior with enhanced accuracy and predictive power compared to existing computational methods. We propose a model that leverages the inherent characteristics of quantum processes – such as superposition, entanglement, and tunneling – to provide a more nuanced and realistic representation of system dynamics. This model will be designed to quantitatively assess and predict outcomes across a range of scenarios, offering a significant advancement in the analysis of dynamic systems. This work addresses the limitations of current approaches by explicitly incorporating quantum mechanical elements into a computational framework.

•Aug 31, 2026•0 citations
The matching-pursuit algorithm is implemented to develop an extension of the split-operator Fourier transform method to a nonorthogonal, nonuniform and dynamically adaptive coherent-state representation. The accuracy and efficiency of the computational approach are demonstrated in simulations of deep tunneling and long time dynamics by comparing our simulation results with the corresponding benchmark calculations.
Rigorous simulations of quantum tunneling dynamics in model systems with up to 20 coupled degrees of freedom are reported. The simulations implement an extension of the recently developed matching-pursuit/split-operator Fourier-transform method to complex-valued coherent-state representations. The resulting method recursively applies the time-evolution operator, as defined by the Trotter expansion to second order accuracy, in dynamically adaptive coherent-state representations generated by an approach that combines the matching-pursuit algorithm with a gradient-based optimization method.
We introduce a discretized coherent state representation (DCSR) for quantum dynamics. Expansion of a wave function in the nonorthogonal slightly overcomplete set is made with an identity operator computed using an iterative refinement method. Calculating the inverse of the overlap matrix is not necessary. The result is an accurate and efficient representation, where you only put basis functions in the region of phase space where the wave function is nonvanishing. Compared to traditional spatial grid methods, fewer grid points are needed. The DCSR can be viewed as an application of the Weyl–Heisenberg frame and extends it into a useful computational method. A scheme for fully quantum mechanical propagation is constructed and applied to the realistic problem of highly excited vibration in the heavy diatomic molecule Rb2. Compared to split-operator propagation in a conventional spatial grid, an order of magnitude longer time steps can be taken and fewer grid points are needed. The computational effort scales linearly with the number of basis functions. Nonreflecting boundary conditions are a natural property of the representation and is illustrated in a model of predissociation.
This paper presents a novel quantum simulation algorithm, termed the Adaptive Subspace Quantum Simulation (ASQS), designed to enhance the accuracy of quantum system simulations through dynamic sub-space adjustment. Traditional quantum simulation methods frequently rely on fixed sub-spaces, limiting the potential for nuanced modeling and accurate results. This research introduces a framework where the quantum system's sub-space is continuously adapted to the input data, optimizing the simulation process. We detail the algorithm's design, implementation, and validation through a series of benchmark simulations. The results demonstrate a significant improvement in simulation accuracy and computational efficiency compared to existing approaches.
This paper investigates the application of adaptive dynamic topology transformations to quantum states, aiming to enhance the precision and efficiency of quantum computation and simulation. Traditional methods often rely on static transformations, limiting the algorithm's flexibility. We propose a novel approach that dynamically alters the quantum state through a series of carefully designed transformations, offering improved accuracy and potential for novel quantum phenomena. This work explores the fundamental principles behind this dynamic approach and outlines a preliminary implementation demonstrating enhanced performance in specific quantum algorithms.
A rigorous and practical methodology for evaluating thermal-equilibrium density matrices, finite-temperature time-dependent expectation values, and time-correlation functions is described. The method involves an extension of the matching-pursuit/split-operator-Fourier-transform method to the solution of the Bloch equation via imaginary-time propagation of the density matrix and the evaluation of Heisenberg time-evolution operators through real-time propagation in dynamically adaptive coherent-state representations.
This research explores the development of a novel computational model predicated on the principles of quantum processes. The core aim is to create a framework capable of simulating complex systems' evolution and behavior with enhanced accuracy and predictive power compared to existing computational methods. We propose a model that leverages the inherent characteristics of quantum processes – such as superposition, entanglement, and tunneling – to provide a more nuanced and realistic representation of system dynamics. This model will be designed to quantitatively assess and predict outcomes across a range of scenarios, offering a significant advancement in the analysis of dynamic systems. This work addresses the limitations of current approaches by explicitly incorporating quantum mechanical elements into a computational framework.