Genetic optimization of quantum annealing

• URL: http://arxiv.org/abs/2108.03185v2
• Date: Tue, 30 Nov 2021 18:46:06 GMT
• Title: Genetic optimization of quantum annealing
• Authors: Pratibha Raghupati Hegde, Gianluca Passarelli, Annarita Scocco, Procolo Lucignano
• Abstract summary: We present a numerical approach based on genetic algorithms to improve the performance of quantum annealing. We also explore shortcuts to abaticity by computing a practically feasible $k$-local optimal driving operator.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The study of optimal control of quantum annealing by modulating the pace of evolution and by introducing a counterdiabatic potential has gained significant attention in recent times. In this work, we present a numerical approach based on genetic algorithms to improve the performance of quantum annealing, which evades the Landau-Zener transitions to navigate to the ground state of the final Hamiltonian with high probability. We optimize the annealing schedules starting from polynomial ansatz by treating their coefficients as chromosomes of the genetic algorithm. We also explore shortcuts to adiabaticity by computing a practically feasible $k$-local optimal driving operator, showing that even for $k=1$ we achieve substantial improvement of the fidelity over the standard annealing solution. With these genetically optimized annealing schedules and/or optimal driving operators, we are able to perform quantum annealing in relatively short time-scales and with larger fidelity compared to traditional approaches.

Related papers

• Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
  A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently. In this study, we employ the Langevin equation with a QNG force to demonstrate that its discrete-time solution gives a generalized form, which we call Momentum-QNG.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• General approach to realize optimized nonadiabatic holonomic quantum computation [0.0]
  We put forward the general form of reverse Hamiltonian to realize the optimized nonadiabatic holonomic quantum computation gate. Our approach might give a new horizon to realize high-fidelity quantum gate.
  arXiv  Detail & Related papers  (2023-10-17T02:10: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)
• 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)
• Optimizing Counterdiabaticity by Variational Quantum Circuits [3.4092751295027997]
  We propose a technique of finding optimal coefficients of the CD terms using a variational quantum circuit. By classical optimizations routines, the parameters of this circuit are optimized to provide the coefficients corresponding to the CD terms. Their improved performance is exemplified in Greenberger-Horne-Zeilinger state preparation on nearest-neighbor Ising model.
  arXiv  Detail & Related papers  (2022-08-03T14:12:26Z)
• Digitized-Counterdiabatic Quantum Optimization [4.336065967298193]
  We propose digitized-diabatic quantum optimization (DCQO) to achieve enhancement over adiabatic quantum optimization for the general Ising spin-glass model. This is accomplished via the digitization of adiabatic quantum algorithms that are catalysed by the addition of non-stoquastic counterdiabatic terms.
  arXiv  Detail & Related papers  (2022-01-03T18:21:54Z)
• Analog Quantum Approximate Optimization Algorithm [3.5558885788605332]
  We present an analog version of the quantum approximate optimization algorithm suitable for current quantum annealers. The central idea of this algorithm is to optimize the schedule function, which defines the adiabatic evolution. It is achieved by choosing a suitable parametrization of the schedule function based on methods for a fixed time, with the potential to generate any function.
  arXiv  Detail & Related papers  (2021-12-14T15:16:46Z)
• Quantum annealing with twisted fields [0.0]
  We propose a method for suppressing the effects of decoherence and non-adiabatic transition. Our results can pave the way to a new approach for realizing practical quantum annealing.
  arXiv  Detail & Related papers  (2021-11-30T11:00:44Z)
• Generalization Properties of Stochastic Optimizers via Trajectory Analysis [48.38493838310503]
  We show that both the Fernique-Talagrand functional and the local powerlaw are predictive of generalization performance. We show that both our Fernique-Talagrand functional and the local powerlaw are predictive of generalization performance.
  arXiv  Detail & Related papers  (2021-08-02T10:58:32Z)
• 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)

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.