Circumventing superexponential runtimes for hard instances of quantum
adiabatic optimization
- URL: http://arxiv.org/abs/2306.13131v1
- Date: Thu, 22 Jun 2023 18:00:02 GMT
- Title: Circumventing superexponential runtimes for hard instances of quantum
adiabatic optimization
- Authors: Benjamin F. Schiffer, Dominik S. Wild, Nishad Maskara, Madelyn Cain,
Mikhail D. Lukin, Rhine Samajdar
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Classical optimization problems can be solved by adiabatically preparing the
ground state of a quantum Hamiltonian that encodes the problem. The performance
of this approach is determined by the smallest gap encountered during the
evolution. Here, we consider the maximum independent set problem, which can be
efficiently encoded in the Hamiltonian describing a Rydberg atom array. We
present a general construction of instances of the problem for which the
minimum gap decays superexponentially with system size, implying a
superexponentially large time to solution via adiabatic evolution. The small
gap arises from locally independent choices, which cause the system to
initially evolve and localize into a configuration far from the solution in
terms of Hamming distance. We investigate remedies to this problem.
Specifically, we show that quantum quenches in these models can exhibit
signatures of quantum many-body scars, which in turn, can circumvent the
superexponential gaps. By quenching from a suboptimal configuration, states
with a larger ground state overlap can be prepared, illustrating the utility of
quantum quenches as an algorithmic tool.
Related papers
- Optimizing random local Hamiltonians by dissipation [44.99833362998488]
We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum.
Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
arXiv Detail & Related papers (2024-11-04T20:21:16Z) - Observation of disorder-free localization and efficient disorder averaging on a quantum processor [117.33878347943316]
We implement an efficient procedure on a quantum processor, leveraging quantum parallelism, to efficiently sample over all disorder realizations.
We observe localization without disorder in quantum many-body dynamics in one and two dimensions.
arXiv Detail & Related papers (2024-10-09T05:28:14Z) - Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale.
Our experiments show that this approach significantly outperforms the adiabatic algorithm.
arXiv Detail & Related papers (2024-05-31T17:07:43Z) - 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) - Dense outputs from quantum simulations [5.295277584890625]
The quantum dense output problem is the process of evaluating time-accumulated observables from time-dependent quantum dynamics.
This problem arises frequently in applications such as quantum control and spectroscopic computation.
We present a range of algorithms designed to operate on both early and fully fault-tolerant quantum platforms.
arXiv Detail & Related papers (2023-07-26T18:16:51Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Diabatic Quantum Annealing for the Frustrated Ring Model [0.7046417074932257]
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.
arXiv Detail & Related papers (2022-12-05T22:16:17Z) - QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum
machines [81.4597482536073]
Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution.
We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines.
Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
arXiv Detail & Related papers (2022-05-24T03:49:10Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Unraveling the origin of higher success probabilities in quantum versus
semi-classical annealing [0.0]
We study whether and when a full quantum representation of the dynamics leads to higher probability to end up in the desired ground.
We find strong evidence for the importance of entanglement to end close to the optimal solution.
arXiv Detail & Related papers (2020-10-27T12:52:09Z) - 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)
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.