Digitized-Counterdiabatic Quantum Optimization
- URL: http://arxiv.org/abs/2201.00790v1
- Date: Mon, 3 Jan 2022 18:21:54 GMT
- Title: Digitized-Counterdiabatic Quantum Optimization
- Authors: Narendra N. Hegade, Xi Chen, Enrique Solano
- Abstract summary: 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.
- Score: 4.336065967298193
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose digitized-counterdiabatic quantum optimization (DCQO) to achieve
polynomial enhancement over adiabatic quantum optimization for the general
Ising spin-glass model, which includes the whole class of combinatorial
optimization problems. This is accomplished via the digitization of adiabatic
quantum algorithms that are catalysed by the addition of non-stoquastic
counterdiabatic terms. The latter are suitably chosen, not only for escaping
classical simulability, but also for speeding up the performance. Finding the
ground state of a general Ising spin-glass Hamiltonian is used to illustrate
that the inclusion of k-local non-stoquastic counterdiabatic terms can always
outperform the traditional adiabatic quantum optimization with stoquastic
Hamiltonians. In particular, we show that a polynomial enhancement in the
ground-state success probability can be achieved for a finite-time evolution,
even with the simplest 2-local counterdiabatic terms. Furthermore, the
considered digitization process, within the gate-based quantum computing
paradigm, provides the flexibility to introduce arbitrary non-stoquastic
interactions. Along these lines, using our proposed paradigm on current NISQ
computers, quantum speed-up may be reached to find approximate solutions for
NP-complete and NP-hard optimization problems. We expect DCQO to become a
fast-lane paradigm towards quantum advantage in the NISQ era.
Related papers
- 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) - Truncation technique for variational quantum eigensolver for Molecular
Hamiltonians [0.0]
variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for noisy quantum devices.
We propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian.
This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer.
arXiv Detail & Related papers (2024-02-02T18:45:12Z) - Challenges of variational quantum optimization with measurement shot noise [0.0]
We study the scaling of the quantum resources to reach a fixed success probability as the problem size increases.
Our results suggest that hybrid quantum-classical algorithms should possibly avoid a brute force classical outer loop.
arXiv Detail & Related papers (2023-07-31T18:01:15Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - 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) - Accelerated Convergence of Contracted Quantum Eigensolvers through a
Quasi-Second-Order, Locally Parameterized Optimization [0.0]
A contracted quantum eigensolver (CQE) finds a solution to the many-electron Schr"odinger equation on a quantum computer.
In this work, we accelerate the convergence of the CQE and its wavefunction ansatz via tools from classical optimization theory.
arXiv Detail & Related papers (2022-05-03T18:48:04Z) - Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time.
As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware.
We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
arXiv Detail & Related papers (2022-02-17T18:59:20Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Digitized-counterdiabatic quantum approximate optimization algorithm [3.0638256603183054]
We propose a digitized version of QAOA enhanced via the use of shortcuts to adiabaticity.
We apply our digitized-counterdiabatic QAOA to Ising models, classical optimization problems, and the P-spin model, demonstrating that it outperforms standard QAOA in all cases.
arXiv Detail & Related papers (2021-07-06T17:57:32Z) - 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) - 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.