Diabatic Quantum Annealing for the Frustrated Ring Model

• URL: http://arxiv.org/abs/2212.02624v1
• Date: Mon, 5 Dec 2022 22:16:17 GMT
• Title: Diabatic Quantum Annealing for the Frustrated Ring Model
• Authors: Jeremy C\^ot\'e, Fr\'ed\'eric Sauvage, Mart\'in Larocca, Mat\'ias Jonsson, Lukasz Cincio and Tameem Albash
• Abstract summary: Adiabatic evolutions can lead to evolution times that scale exponentially with the system size. We show that non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown.
• Score: 0.7046417074932257
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable quantum annealing to circumvent bottlenecks associated with the standard implementation of quantum annealing.

Related papers

• Ancillary entangling Floquet kicks for accelerating quantum algorithms [0.21990652930491855]
  We accelerate quantum simulation using digital multi-qubit gates that entangle primary system qubits with the ancillary qubits. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent.
  arXiv  Detail & Related papers  (2024-08-23T19:40:24Z)
• Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem [0.0]
  We show that adiabatic evolution can be performed with a fixed, finite Trotter step. We give numerical evidence using matrix-product-state simulations that it can optimally solve the Max-Cut problem. Extrapolating our numerical results, we estimate the resources needed for a quantum computer to compete with classical exact or approximate solvers.
  arXiv  Detail & Related papers  (2024-04-24T17:29:03Z)
• Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization [0.0]
  We present a general construction of instances of the problem for which the minimum gap decays superexponentially with system size. The small gap arises from locally independent choices, which cause the system to initially evolve and localize into a configuration far from the solution. We show that quantum quenches in these models can exhibit signatures of quantum many-body scars, which in turn, can circumvent the superexponential gaps.
  arXiv  Detail & Related papers  (2023-06-22T18:00:02Z)
• Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond [0.0]
  Simulation of continuous time evolution requires time discretization on both classical and quantum computers. We introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables. Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.
  arXiv  Detail & Related papers  (2022-09-26T12:54:32Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• 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)
• Bridging the Gap Between the Transient and the Steady State of a Nonequilibrium Quantum System [58.720142291102135]
  Many-body quantum systems in nonequilibrium remain one of the frontiers of many-body physics. Recent work on strongly correlated electrons in DC electric fields illustrated that the system may evolve through successive quasi-thermal states. We demonstrate an extrapolation scheme that uses the short-time transient calculation to obtain the retarded quantities.
  arXiv  Detail & Related papers  (2021-01-04T06:23:01Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Optimizing adiabatic quantum pathways via a learning algorithm [10.664271328456728]
  We propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.
  arXiv  Detail & Related papers  (2020-06-27T06:57:59Z)

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.