The quantum annealing gap and quench dynamics in the exact cover problem

• URL: http://arxiv.org/abs/2106.08101v3
• Date: Tue, 11 Jan 2022 22:24:05 GMT
• Title: The quantum annealing gap and quench dynamics in the exact cover problem
• Authors: Bernhard Irsigler and Tobias Grass
• Abstract summary: Annealing explores equilibrium phases of a Hamiltonian with slowly changing parameters. Quenches are sudden changes of the Hamiltonian, producing a non-equilibrium situation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quenching and annealing are extreme opposites in the time evolution of a quantum system: Annealing explores equilibrium phases of a Hamiltonian with slowly changing parameters and can be exploited as a tool for solving complex optimization problems. In contrast, quenches are sudden changes of the Hamiltonian, producing a non-equilibrium situation. Here, we investigate the relation between the two cases. Specifically, we show that the minimum of the annealing gap, which is an important bottleneck of quantum annealing algorithms, can be revealed from a dynamical quench parameter which describes the dynamical quantum state after the quench. Combined with statistical tools including the training of a neural network, the relation between quench and annealing dynamics can be exploited to reproduce the full functional behavior of the annealing gap from the quench data. We show that the partial or full knowledge about the annealing gap which can be gained in this way can be used to design optimized quantum annealing protocols with a practical time-to-solution benefit. Our results are obtained from simulating random Ising Hamiltonians, representing hard-to-solve instances of the exact cover problem.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Variational Coherent Quantum Annealing [0.0]
  We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer. We introduce auxiliary Hamiltonians that vanish at the beginning and end of the evolution to increase the energy gap during the process. We achieve a substantial reduction in the ground-state error with just six variational parameters and a duration within the device coherence times.
  arXiv  Detail & Related papers  (2023-10-03T17:53:03Z)
• Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing [0.0]
  We use a perturbative expansion to derive a condition for the occurrence of an avoided level crossing during the annealing process. We show that no exponentially small gaps arise for regular bipartite graphs, implying that QA can efficiently solve MaxCut in that case.
  arXiv  Detail & Related papers  (2023-04-25T14:42:20Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• Assessing the performance of quantum annealing with nonlinear driving [0.0]
  We report studies of the diabatic excitations arising from nonlinear protocols applied to the transverse field Ising chain. We find that the paradigmatic Kibble-Zurek behavior can be suppressed with pauses'' in the evolution.
  arXiv  Detail & Related papers  (2022-03-31T13:08:00Z)
• Quantum and classical annealing in a continuous space with multiple local minima [0.0]
  We show that quantum annealing yields a power law convergence, thus an exponential improvement over simulated annealing. We also reveal how diabatic quantum dynamics, quantum tunneling in particular, steers the systems toward the global minimum.
  arXiv  Detail & Related papers  (2022-03-22T02:02:23Z)
• 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)
• Open-system modeling of quantum annealing: theory and applications [0.0]
  We give derivations and numerical recipes for effective parallel simulation methods. We consider the weak-coupling limit to an environment and also the case of $1/f$ noise.
  arXiv  Detail & Related papers  (2021-07-15T10:12:41Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)

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.