Optimizing a parameterized controlled gate with Free Quaternion Selection

• URL: http://arxiv.org/abs/2409.13547v1
• Date: Fri, 20 Sep 2024 14:46:00 GMT
• Title: Optimizing a parameterized controlled gate with Free Quaternion Selection
• Authors: Hiroyoshi Kurogi, Katsuhiro Endo, Yuki Sato, Michihiko Sugawara, Kaito Wada, Kenji Sugisaki, Shu Kanno, Hiroshi C. Watanabe, Haruyuki Nakano,
• Abstract summary: In this study, we propose an algorithm to estimate the optimal parameters for locally minimizing the cost value of a single-qubit gate. To benchmark the performance, we apply the proposed method to various optimization problems, including the Variational Eigensolver (VQE) for Ising and molecular Hamiltonians.
• Score: 0.4353365283165517
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In variational algorithms, quantum circuits are conventionally parametrized with respect to single-qubit gates. In this study, we parameterize a generalized controlled gate and propose an algorithm to estimate the optimal parameters for locally minimizing the cost value, where we extend the free quaternion selection method, an optimization method for a single-qubit gate. To benchmark the performance, we apply the proposed method to various optimization problems, including the Variational Quantum Eigensolver (VQE) for Ising and molecular Hamiltonians, Variational Quantum Algorithms (VQA) for fidelity maximization, and unitary compilation of time evolution operators. In these applications, the proposed method shows efficient optimization and greater expressibility with shallower circuits than other methods. Furthermore, this method is also capable of generalizing and fully optimizing particle-number-conserving gates, which are in demand in chemical systems applications. Taking advantage of this property, we have actually approximated time evolution operators of molecular Hamiltonian and simulated the dynamics with shallower circuits in comparison to the standard implementation by Trotter decomposition.

Related papers

• 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)
• Probabilistic tensor optimization of quantum circuits for the max-$k$-cut problem [0.0]
  We propose a technique for optimizing parameterized circuits in variational quantum algorithms. We illustrate our approach on the example of the quantum approximate optimization algorithm (QAOA) applied to the max-$k$-cut problem.
  arXiv  Detail & Related papers  (2023-10-16T12:56:22Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Full optimization of a single-qubit gate on the generalized sequential quantum optimizer [4.341421846091307]
  We propose a quantum algorithm based on the analytically-optimal selection of a single-qubit gate in quantum circuits. Our method uses matrix factorization whose matrix elements consist of slightly-modified circuit evaluations on the objective function.
  arXiv  Detail & Related papers  (2022-09-18T11:19:56Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Direct Optimal Control Approach to Laser-Driven Quantum Particle Dynamics [77.34726150561087]
  We propose direct optimal control as a robust and flexible alternative to indirect control theory. The method is illustrated for the case of laser-driven wavepacket dynamics in a bistable potential.
  arXiv  Detail & Related papers  (2020-10-08T07:59:29Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.