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

arXiv:1206.3830 · IEEE Congress on Evolutionary Computation (CEC)

Optimizing qubit Hamiltonian parameter estimation algorithm using PSO

Alexandr Sergeevich, Stephen D. Bartlett

Published Jun 1, 2012• 10 citations
arXivHTMLPDF

Abstract

In this paper we develop qubit Hamiltonian single parameter estimation techniques using Bayesian approach. The algorithms considered are restricted to projective measurements in a fixed basis, and are derived under the assumption that the qubit measurement is much slower than the characteristic qubit evolution. The non-adaptive algorithm is optimized using particle swarm optimization and compared to previously developed locally-optimal scheme.

DOI
10.1109/cec.2012.6252948

Related papers

Adaptive Hamiltonian estimation using Bayesian experimental design

Christopher Ferrie, Christopher Granade, David G. Cory

Using Bayesian experimental design techniques, we have shown that for a single twolevel quantum mechanical system under strong (projective) measurement, the dynamical parameters of a model Hamiltonian can be estimated with exponentially improved accuracy over offline estimation strategies. To achieve this, we derive an adaptive protocol which finds the optimal experiments based on previous observations. We show that the risk associated with this algorithm is close to the global optimum, given a uniform prior. Additionally, we show that sampling at the Nyquist rate is not optimal.

arXiv:1111.0935•AIP conference proceedings•Jan 1, 2012•16 citations

Characterization of a qubit Hamiltonian using adaptive measurements in a fixed basis

Alexandr Sergeevich, Anushya Chandran, Joshua Combes +2 more

We investigate schemes for Hamiltonian parameter estimation of a two-level system using repeated measurements in a fixed basis. The simplest (Fourier based) schemes yield an estimate with a mean-square error (MSE) that decreases at best as a power law $\ensuremath{\sim}{N}^{\ensuremath{-}2}$ in the number of measurements $N$. By contrast, we present numerical simulations indicating that an adaptive Bayesian algorithm, where the time between measurements can be adjusted based on prior measurement results, yields a MSE which appears to scale close to $\mathrm{exp}(\ensuremath{-}0.3N)$. That is, measurements in a single fixed basis are sufficient to achieve exponential scaling in $N$.

arXiv:1102.3700•Physical Review A•Nov 15, 2011•78 citations

Bayesian Approach to Hamiltonian Parameter Estimation and Measurement of Double Quantum Dot

Alexandr Sergeevich, Joshua Combes, Anushya Chandran +2 more

We analyze and optimize double-quantum-dot qubit Hamiltonian parameter estimation algorithms based on the Bayesian updating approach. The theoretical framework for measurement and parameter estimation processes are developed, and we provide numerical simulations showing the algorithms' performance.

•Jan 1, 2011•1 citation

Bayesian approach to Hamiltonian parameter estimation and measurement of double quantum dot

Alexandr Sergeevich, Joshua Combes, Anushya Chandran +2 more

We analyze and optimize double-quantum-dot qubit Hamiltonian parameter estimation algorithms based on the Bayesian updating approach. The theoretical framework for measurement and parameter estimation processes are developed, and we provide numerical simulations showing the algorithms' performance.

•Aug 1, 2011•0 citations

Quantum particle swarm optimization based on Bloch coordinates of qubits

Xiande Liu, Xiaoming Liu

To improve the efficiency of particle swarm optimization, a quantum particle swarm optimization algorithm is proposed on the basis of analyzing the search process of particle swarm optimization algorithm. In the proposed algorithm, particles are endoded by qubits described on the Bloch sphere, each particle occupy three locations of the search space, and each location represents a optimization solution. By employing the search method of general PSO to adjust the two parameters of qubit, the qubits rotation are performed on the Bloch sphere, which can simultaneously update three locations occupied by a qubit and quickly approach the global optimal solution. The experimental results of standard test function extreme optimization and fuzzy controller parameters optimization show that the proposed algorithm is superior to other similar algorithm in optimization ability and optimization efficiency.

International Conference on Natural Computation (ICNC)•Jul 1, 2013•2 citations

Particle swarm optimization for a variational quantum eigensolver

Hao Mei, Jianyu Zhao, Qing-Song Li +5 more

In the field of finding ground and excited states, where quantum computation holds significant promise, using a variational quantum eigensolver (VQE) is a typical approach. However, the success of this approach is vulnerable to two factors: classical optimization for the ansätz parameters and noise from quantum devices. To address these challenges, we adopted particle swarm optimization (PSO) based on swarm intelligence for VQE and presented its performance. Furthermore, a modified PSO, gradient-based adaptive quantum-behaved particle swarm optimization (GAQPSO), is proposed. This algorithm adaptively upgrades parameters based on gradients or shared information within the swarm, enhancing optimization capability and noise resistance. We tested this algorithm using VQE simulations on several molecular systems with different geometries and found that, when using random initial values, GAQPSO achieves accurate results even in the presence of noise, whereas traditional PSO, QPSO, COBYLA, and gradient-based algorithms (GD and L-BFGS-B) fail. The GAQPSO algorithm presents a novel approach to optimizing VQE, demonstrating superior performance in parameter optimization and noise resilience compared to traditional optimization algorithms. This effectively advances the process of achieving a quantum advantage for quantum computing in quantum chemistry problems.

Physical Chemistry Chemical Physics•Jan 1, 2024•4 citations
In this paper we develop qubit Hamiltonian single parameter estimation techniques using Bayesian approach. The algorithms considered are restricted to projective measurements in a fixed basis, and are derived under the assumption that the qubit measurement is much slower than the characteristic qubit evolution. The non-adaptive algorithm is optimized using particle swarm optimization and compared to previously developed locally-optimal scheme.
Using Bayesian experimental design techniques, we have shown that for a single twolevel quantum mechanical system under strong (projective) measurement, the dynamical parameters of a model Hamiltonian can be estimated with exponentially improved accuracy over offline estimation strategies. To achieve this, we derive an adaptive protocol which finds the optimal experiments based on previous observations. We show that the risk associated with this algorithm is close to the global optimum, given a uniform prior. Additionally, we show that sampling at the Nyquist rate is not optimal.
We investigate schemes for Hamiltonian parameter estimation of a two-level system using repeated measurements in a fixed basis. The simplest (Fourier based) schemes yield an estimate with a mean-square error (MSE) that decreases at best as a power law $\ensuremath{\sim}{N}^{\ensuremath{-}2}$ in the number of measurements NNN. By contrast, we present numerical simulations indicating that an adaptive Bayesian algorithm, where the time between measurements can be adjusted based on prior measurement results, yields a MSE which appears to scale close to $\mathrm{exp}(\ensuremath{-}0.3N)$. That is, measurements in a single fixed basis are sufficient to achieve exponential scaling in NNN.
To improve the efficiency of particle swarm optimization, a quantum particle swarm optimization algorithm is proposed on the basis of analyzing the search process of particle swarm optimization algorithm. In the proposed algorithm, particles are endoded by qubits described on the Bloch sphere, each particle occupy three locations of the search space, and each location represents a optimization solution. By employing the search method of general PSO to adjust the two parameters of qubit, the qubits rotation are performed on the Bloch sphere, which can simultaneously update three locations occupied by a qubit and quickly approach the global optimal solution. The experimental results of standard test function extreme optimization and fuzzy controller parameters optimization show that the proposed algorithm is superior to other similar algorithm in optimization ability and optimization efficiency.
In the field of finding ground and excited states, where quantum computation holds significant promise, using a variational quantum eigensolver (VQE) is a typical approach. However, the success of this approach is vulnerable to two factors: classical optimization for the ansätz parameters and noise from quantum devices. To address these challenges, we adopted particle swarm optimization (PSO) based on swarm intelligence for VQE and presented its performance. Furthermore, a modified PSO, gradient-based adaptive quantum-behaved particle swarm optimization (GAQPSO), is proposed. This algorithm adaptively upgrades parameters based on gradients or shared information within the swarm, enhancing optimization capability and noise resistance. We tested this algorithm using VQE simulations on several molecular systems with different geometries and found that, when using random initial values, GAQPSO achieves accurate results even in the presence of noise, whereas traditional PSO, QPSO, COBYLA, and gradient-based algorithms (GD and L-BFGS-B) fail. The GAQPSO algorithm presents a novel approach to optimizing VQE, demonstrating superior performance in parameter optimization and noise resilience compared to traditional optimization algorithms. This effectively advances the process of achieving a quantum advantage for quantum computing in quantum chemistry problems.