Quantum annealing with longitudinal bias fields

Abstract

Quantum annealing aims at solving hard computational problems through adiabatic state preparation. Here, I propose to use inhomogeneous longitudinal magnetic fields to enhance the efficiency of the annealing. Such fields are able to bias the annealing dynamics into the desired solution, and in many cases, suitable field configurations can be found iteratively. Alternatively, the longitudinal fields can also be applied as an antibias which filters out unwanted contributions from the final state. This strategy is particularly well suited for instances which are difficult to solve within the standard quantum annealing approach. By numerically simulating the dynamics for small instances of the exact cover problem, the performance of these different strategies is investigated.

5 pages, 3 figures

References in corpus (32)

• Quantum Annealing in the Transverse Ising Model
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computing
• Quantum Annealing and Analog Quantum Computation
• Perspectives of quantum annealing: Methods and implementations
• Emergence and Frustration of Magnetic Order with Variable-Range Interactions in a Trapped Ion Quantum Simulator
• Anderson localization casts clouds over adiabatic quantum optimization
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Experimental implementation of an adiabatic quantum optimization algorithm
• First order phase transition in the Quantum Adiabatic Algorithm
• Quantum annealing with antiferromagnetic fluctuations
• First Order Quantum Phase Transition in Adiabatic Quantum Computation
• Reverse annealing for the fully connected $p$-spin model
• Simple Glass Models and their Quantum Annealing
• Modernizing Quantum Annealing using Local Searches
• First-order transitions and the performance of quantum algorithms in random optimization problems
• Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
• A Coherent Quantum Annealer with Rydberg Atoms
• Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
• Does Adiabatic Quantum Optimization Truly Fail for NP-complete problems?
• Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
• Quantum annealing for the number partitioning problem using a tunable spin glass of ions
• Quantum algorithm for energy matching in hard optimization problems
• Quantum annealing with ultracold atoms in a multimode optical resonator
• Experimental demonstration of perturbative anticrossing mitigation using non-uniform driver Hamiltonians
• Algorithmic approach to adiabatic quantum optimization
• Quantum Catalysis of Magnetic Phase Transitions in a Quantum Simulator
• Probing Entanglement in Adiabatic Quantum Optimization with Trapped Ions
• The Phase Transition in Exact Cover
• Hybrid annealing using a quantum simulator coupled to a classical computer
• Optimization by a quantum reinforcement algorithm
• Inhomogeneous driving in quantum annealers can result in orders-of-magnitude improvements in performance

Cited by in corpus (35)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Applying the Quantum Approximate Optimization Algorithm to the Tail Assignment Problem
• Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
• Programmable Quantum Annealing Architectures with Ising Quantum Wires
• Finding spin-glass ground states using quantum walks
• An energetic perspective on rapid quenches in quantum annealing
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• Search range in experimental quantum annealing
• Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
• Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Counterdiabatic Reverse Annealing
• Fluctuation guided search in quantum annealing
• Initial State Encoding via Reverse Quantum Annealing and h-gain Features
• Bias-field digitized counterdiabatic quantum optimization
• Theoretical survey of unconventional quantum annealing methods applied to adifficult trial problem
• Locally Suppressed Transverse-Field Protocol for Diabatic Quantum Annealing
• Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
• Modernizing Quantum Annealing II: Genetic algorithms with the Inference Primitive Formalism
• Petri Net Modeling for Ising Model Formulation in Quantum Annealing
• Why adiabatic quantum annealing is unlikely to yield speed-up
• The quantum annealing gap and quench dynamics in the exact cover problem
• A Quantum Annealing Protocol to Solve the Nuclear Shell Model
• Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions
• Noise-tolerant quantum speedups in quantum annealing without fine tuning
• Quantum annealing sampling with a bias field
• Toward a standardized methodology for constructing quantum computing use cases
• Zeno-effect Computation: Opportunities and Challenges
• Warm Start Adaptive-Bias Quantum Approximate Optimization Algorithm
• Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement
• Performance of Domain-Wall Encoding for Quantum Annealing
• Pattern Description of Quantum Phase Transitions in the Transverse Antiferromagnetic Ising Model with a Longitudinal Field
• First-Order Excited-State Quantum Phase Transition in the Transverse Ising Model with a Longitudinal Field
• A loop Quantum Approximate Optimization Algorithm with Hamiltonian updating