Simulated Quantum Annealing is Efficient on the Spike Hamiltonian

• URL: http://arxiv.org/abs/2011.15094v1
• Date: Mon, 30 Nov 2020 18:30:15 GMT
• Title: Simulated Quantum Annealing is Efficient on the Spike Hamiltonian
• Authors: Thiago Bergamaschi
• Abstract summary: We study the convergence of a classical algorithm called Simulated Quantum Annealing (SQA) on the Spike Hamiltonian. This toy model Hamiltonian encodes a simple bit-symmetric cost function f in the computational basis.
• Score: 0.15229257192293202
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work we study the convergence of a classical algorithm called Simulated Quantum Annealing (SQA) on the Spike Hamiltonian, a specific toy model Hamiltonian for quantum-mechanical tunneling introduced by [FGG02]. This toy model Hamiltonian encodes a simple bit-symmetric cost function f in the computational basis, and is used to emulate local minima in more complex optimization problems. In previous work [CH16] showed that SQA runs in polynomial time in much of the regime of spikes that QA does, pointing to evidence against an exponential speedup through tunneling. In this paper we extend their analysis to the remaining polynomial regime of energy gaps of the spike Hamiltonian, to show that indeed QA presents no exponential speedup with respect to SQA on this family of toy models.

Related papers

• Enhancing Quantum Field Theory Simulations on NISQ Devices with Hamiltonian Truncation [0.0]
  This paper presents an alternative to traditional methods for simulating the real-time evolution in Quantum Field Theories (QFTs) by leveraging Hamiltonian Truncation (HT) We study the Schwinger model, systematically reducing the complexity of the Hamiltonian via HT while preserving essential physical properties. For the observables studied in this paper, the HT approach converges quickly with the number of qubits, allowing for the interesting physics processes to be captured without needing many qubits.
  arXiv  Detail & Related papers  (2024-07-26T18:03:20Z)
• Optimal Clifford Initial States for Ising Hamiltonians [0.40015650275668363]
  CAFQA is a classical bootstrap for Variational Quantum Algorithms. We analyze the Clifford states that minimization for a new type of Hamiltonian, namely Transverse Field Ising Hamiltonians.
  arXiv  Detail & Related papers  (2023-12-02T05:43:59Z)
• Quantum Simulations for Strong-Field QED [0.0]
  We perform quantum simulations of strong-field QED (SFQED) in $3+1$ dimensions. The interactions relevant for Breit-Wheeler pair-production are transformed into a quantum circuit. Quantum simulations of a "null double slit" experiment are found to agree well with classical simulations.
  arXiv  Detail & Related papers  (2023-11-30T03:05:26Z)
• 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)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• 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)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)
• Dynamical Self-energy Mapping (DSEM) for quantum computing [0.0]
  For noisy intermediate-scale quantum (NISQ) devices only a moderate number of qubits with a limited coherence is available. We present how to bypass this challenge in practical molecular chemistry simulations on NISQ devices by employing a classical-quantum hybrid algorithm.
  arXiv  Detail & Related papers  (2020-10-12T04:12:21Z)
• Momentum Q-learning with Finite-Sample Convergence Guarantee [49.38471009162477]
  This paper analyzes a class of momentum-based Q-learning algorithms with finite-sample guarantee. We establish the convergence guarantee for MomentumQ with linear function approximations and Markovian sampling. We demonstrate through various experiments that the proposed MomentumQ outperforms other momentum-based Q-learning algorithms.
  arXiv  Detail & Related papers  (2020-07-30T12:27:03Z)

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.