Fluctuation guided search in quantum annealing

• URL: http://arxiv.org/abs/2009.06335v3
• Date: Mon, 9 Nov 2020 20:36:11 GMT
• Title: Fluctuation guided search in quantum annealing
• Abstract summary: I discuss the tendency of quantum annealers to seek solutions where more quantum fluctuations are allowed. I show how local controls on the qubits can be used to control the levels of fluctuations and guide the search. I discuss places where leveraging this tradeoff could be practically important, namely in hybrid algorithms.
• Score: 1.52292571922932
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum annealing has great promise in leveraging quantum mechanics to solve combinatorial optimisation problems. However, to realize this promise to it's fullest extent we must appropriately leverage the underlying physics. In this spirit, I examine how the well known tendency of quantum annealers to seek solutions where more quantum fluctuations are allowed can be used to trade off optimality of the solution to a synthetic problem for the ability to have a more flexible solution, where some variables can be changed at little or no cost. I demonstrate this tradeoff experimentally using the reverse annealing feature a D-Wave Systems QPU for both problems composed of all binary variables, and those containing some higher-than-binary discrete variables. I further demonstrate how local controls on the qubits can be used to control the levels of fluctuations and guide the search. I discuss places where leveraging this tradeoff could be practically important, namely in hybrid algorithms where some penalties cannot be directly implemented on the annealer and provide some proof-of-concept evidence of how these algorithms could work.

Related papers

• Quantum Annealing with Qubit-Resonator Systems for Simultaneous Optimization of Binary and Continuous Variables [0.0]
  We propose a hybrid system composed of qubits and resonators, aiming to minimize cost functions that contain both binary and continuous variables.<n>We present a general framework for hybrid quantum annealing using such systems, and investigate its feasibility and effectiveness through numerical simulations.
  arXiv  Detail & Related papers  (2025-06-25T03:42:51Z)
• Formulation and evaluation of ocean dynamics problems as optimization problems for quantum annealing machines [0.0]
  Recent advancements in quantum computing suggest the potential to revolutionize computational algorithms across various scientific domains. Quantum computation is so different from classical computation that suitable frameworks to represent oceanic and atmospheric dynamics are yet to be explored.
  arXiv  Detail & Related papers  (2024-05-20T04:55:32Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Variational waveguide QED simulators [58.720142291102135]
  Waveguide QED simulators are made by quantum emitters interacting with one-dimensional photonic band-gap materials. Here, we demonstrate how these interactions can be a resource to develop more efficient variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-02-03T18:55:08Z)
• Using a quantum computer to solve a real-world problem -- what can be achieved today? [0.0]
  Quantum computing is an important developing technology with the potential to revolutionise the landscape of scientific and business problems. The widespread excitement derives from the potential for a fault tolerant quantum computer to solve previously intractable problems. We are currently in the so-called NISQ era where more quantum approaches are being applied to early versions of quantum hardware.
  arXiv  Detail & Related papers  (2022-11-23T16:10:53Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits [0.0]
  We show that long term trends in solution quality exist on the D-Wave device, and that the unused qubits can be used to measure the current level of noise of the quantum system. In this work, we embed a disjoint random QUBO on the unused parts of the chip alongside the QUBO to be solved, which acts as an indicator of the solution quality of the device over time.
  arXiv  Detail & Related papers  (2022-09-12T23:06:51Z)
• Post-Error Correction for Quantum Annealing Processor using Reinforcement Learning [9.267156820352996]
  We show how to correct states output by quantum annealers using reinforcement learning. Our preliminary results show how to correct states output by quantum annealers using reinforcement learning.
  arXiv  Detail & Related papers  (2022-03-03T21:31:06Z)
• Understanding domain-wall encoding theoretically and experimentally [1.2891210250935146]
  We analyze the method of encoding pairwise interactions of higher-than-binary discrete variables into binary variables based on domain walls on one dimensional Ising chains. We show that for problems of practical interest for quantum computing it is not possible to have a more efficient general encoding in terms of number of binary variables per discrete variable.
  arXiv  Detail & Related papers  (2021-08-26T19:15:40Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)

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.