Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm

• URL: http://arxiv.org/abs/2103.01226v2
• Date: Thu, 7 Apr 2022 20:26:10 GMT
• Title: Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
• Authors: Benjamin F. Schiffer, Jordi Tura, J. Ignacio Cirac
• Abstract summary: We propose a method to obtain information about the spectral profile of the adiabatic evolution. We present the concept of a variational quantum adiabatic algorithm (VQAA) for optimized adiabatic paths.
• Score: 0.7734726150561088
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long preparation times which depend on the a priori unknown spectral gap. Our work relates in a twofold way. First, we propose a method to obtain information about the spectral profile of the adiabatic evolution. Second, we present the concept of a variational quantum adiabatic algorithm (VQAA) for optimized adiabatic paths. We aim at combining the strengths of the adiabatic and the variational approaches for fast and high-fidelity ground state preparation while keeping the number of measurements as low as possible. Our algorithms build upon ancilla protocols which we present that allow to directly evaluate the ground state overlap. We benchmark for a non-integrable spin-1/2 transverse and longitudinal Ising chain with $N=53$ sites using tensor network techniques. Using a black box, gradient-based approach, we report a reduction in the total evolution time for a given desired ground state fidelity by a factor of ten, which makes our method suitable for the limited decoherence time of noisy-intermediate scale quantum devices.

Related papers

• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• A non-Hermitian Ground State Searching Algorithm Enhanced by Variational Toolbox [13.604981031329453]
  Ground-state preparation for a given Hamiltonian is a common quantum-computing task of great importance. We consider an approach to simulate dissipative non-Hermitian quantum dynamics using Hamiltonian simulation techniques. The proposed method facilitates the energy transfer by repeatedly projecting ancilla qubits to the desired state.
  arXiv  Detail & Related papers  (2022-10-17T12:26:45Z)
• Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
  We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system. Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
  arXiv  Detail & Related papers  (2022-10-16T05:57:43Z)
• Simulating scalar field theories on quantum computers with limited resources [62.997667081978825]
  We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers. The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
  arXiv  Detail & Related papers  (2022-10-14T17:28:15Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• 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)
• Ab initio nuclear structure via quantum adiabatic algorithm [0.7449724123186384]
  We explore the application of the quantum algorithm of adiabatic state preparation with quantum phase estimation in ab initio nuclear structure theory. We focus on solving the low-lying spectra (including both the ground and excited states) of simple nuclear systems.
  arXiv  Detail & Related papers  (2021-05-19T03:51:17Z)
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation [7.247285982078057]
  We introduce hybrid quantum-classical algorithms for two distance measures on near-term quantum devices. First, we introduce the Variational Trace Distance Estimation (VTDE) algorithm. Second, we introduce the Variational Fidelity Estimation (VFE) algorithm.
  arXiv  Detail & Related papers  (2020-12-10T15:56:58Z)
• 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.