Full optimization of a single-qubit gate on the generalized sequential quantum optimizer

• URL: http://arxiv.org/abs/2209.08535v3
• Date: Tue, 18 Oct 2022 02:12:31 GMT
• Title: Full optimization of a single-qubit gate on the generalized sequential quantum optimizer
• Authors: Kaito Wada, Rudy Raymond, Yuki Sato, Hiroshi C. Watanabe
• Abstract summary: 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.
• Score: 4.341421846091307
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We propose a quantum algorithm based on the analytically-optimal selection of a single-qubit gate in parameterized quantum circuits (PQCs). Our algorithm optimizes the PQC structure by sequentially replacing a single-qubit gate in the PQC with the optimal one minimizing the objective function in the variational quantum algorithm. To directly find local optima, our method uses matrix factorization whose matrix elements consist of slightly-modified circuit evaluations on the objective function, which is in contrast to conventional sequential optimizers that utilize sinusoidal properties. Optimal selection over single-qubit gates based on this matrix factorization leads to more efficient optimization of PQCs. Moreover, we show that the framework of matrix factorization utilized in our method unifies and extends the existing sequential methods. We perform numerical experiments demonstrating the efficacy of the framework.

Related papers

• Optimizing a parameterized controlled gate with Free Quaternion Selection [0.4353365283165517]
  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.
  arXiv  Detail & Related papers  (2024-09-20T14:46:00Z)
• 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)
• Optimal Parameter Configurations for Sequential Optimization of Variational Quantum Eigensolver [5.005447280753645]
  Variational Quantum Eigensolver (VQE) is a hybrid algorithm for finding the minimum eigenvalue/vector of a given Hamiltonian. This paper focuses on the case where the components to be optimized are single-qubit gates.
  arXiv  Detail & Related papers  (2023-03-13T13:07:27Z)
• 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)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Bilevel Optimization: Convergence Analysis and Enhanced Design [63.64636047748605]
  Bilevel optimization is a tool for many machine learning problems. We propose a novel stoc-efficientgradient estimator named stoc-BiO.
  arXiv  Detail & Related papers  (2020-10-15T18:09:48Z)
• 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.