Path Integral Quantum Control for Quantum Chemistry Applications
- URL: http://arxiv.org/abs/2509.24104v1
- Date: Sun, 28 Sep 2025 22:42:06 GMT
- Title: Path Integral Quantum Control for Quantum Chemistry Applications
- Authors: Peyman Najafi, Aarón Villanueva, Hilbert Kappen,
- Abstract summary: We adapt the PiQC algorithm to optimize parametrized quantum circuits.<n>We benchmark the gate-based and pulse-based versions of PiQC against the Variational Quantum Eigensolver (VQE)<n>Both PiQC algorithms exhibit greater robustness than SPSA to variations in the target Hamiltonian induced by changes in molecular bond distances.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Path integral Quantum Control (PiQC) algorithm was recently introduced by Villanueva et al. (2025) as a new approach for computing optimal controls in open and closed quantum systems. Originally proposed for pulse-based quantum control, PiQC estimates optimal controls through global averages over quantum trajectories. In this work, we adapt the PiQC algorithm to optimize parametrized quantum circuits by showing that the quantum circuit can be randomized using a continuous dynamics governed by a stochastic Schr\"odinger equation that is compatible with the path integral control framework. In this adaptation, the circuit parameters become the controls to be optimized within PiQC. We refer to this instance of PiQC as the Gate-based PiQC (GB-PiQC) algorithm. We apply GB-PiQC for ground state preparation of electronic structure problems. We benchmark the gate-based and pulse-based versions of PiQC against the Variational Quantum Eigensolver (VQE), which is optimized using the common Simultaneous Perturbation Stochastic Approximation (SPSA) optimizer, on a set of standard molecular Hamiltonians: H2, LiH, BeH2, and H4, mapped to 2-, 4-, 6-, and 6-qubit systems, respectively. For each molecule, the benchmark is implemented at different bond distances, after performing a hyperparameter tuning of each algorithm at a fixed bond distance near the equilibrium geometry. We find that both PiQC algorithms exhibit greater robustness than SPSA to variations in the target Hamiltonian induced by changes in molecular bond distances. Furthermore, PiQC algorithms also achieve superior performance compared to SPSA in most instances, particularly at stretched bond lengths, where the Hartree-Fock solution becomes less accurate and its error grows relative to equilibrium.
Related papers
- Efficient implementation of quantum signal processing via the adiabatic-impulse model [0.0]
We investigate analogy between quantum signal processing (QSP) and the adiabatic-impulse model (AIM)<n>AIM effectively describes the evolution of a two-level quantum system under strong external driving field.<n>We can map parameters from QSP to AIM to implement to QSP-like evolution with nonadiabatic, high-amplitude external drives.
arXiv Detail & Related papers (2025-06-26T10:35:58Z) - Towards Non-Abelian Quantum Signal Processing: Efficient Control of Hybrid Continuous- and Discrete-Variable Architectures [0.0]
Quantum Signal Processing (QSP) transforms a unitary parameterized by $theta$ into one governed by a function $f(theta)$.<n>We extend QSP to a new class, non-abelian QSP, which utilizes non-commuting control parameters.
arXiv Detail & Related papers (2025-04-28T17:10:27Z) - Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - GRAPE optimization for open quantum systems with time-dependent
decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control.
We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls.
The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z) - Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence.
We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
arXiv Detail & Related papers (2023-03-07T22:15:43Z) - Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent
and Incoherent Photons Found with Gradient Search [77.34726150561087]
We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control.
We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
arXiv Detail & Related papers (2023-02-28T07:36:02Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Pulse based Variational Quantum Optimal Control for hybrid quantum
computing [0.0]
This work studies pulse based variational quantum algorithms (VQAs)
VQAs are designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware.
arXiv Detail & Related papers (2022-02-17T21:43:54Z) - Simulating Many-Body Systems with a Projective Quantum Eigensolver [0.0]
We present a new hybrid quantum-classical algorithm for optimizing unitary coupled-cluster wave functions.
We also introduce a selected variant of PQE (SPQE) that uses an adaptive ansatz built from arbitrary-order particle-hole operators.
arXiv Detail & Related papers (2021-01-31T00:31:12Z) - Gate-free state preparation for fast variational quantum eigensolver
simulations: ctrl-VQE [0.0]
VQE is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers.
We propose an alternative algorithm where the quantum circuit used for state preparation is removed entirely and replaced by a quantum control routine.
As with VQE, the objective function optimized is the expectation value of the qubit-mapped molecular Hamiltonian.
arXiv Detail & Related papers (2020-08-10T17:53:09Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.