Benchmarking Quantum Annealing Controls with Portfolio Optimization

• URL: http://arxiv.org/abs/2007.03005v1
• Date: Mon, 6 Jul 2020 18:46:55 GMT
• Title: Benchmarking Quantum Annealing Controls with Portfolio Optimization
• Authors: Erica Grant, Travis Humble, Benjamin Stump
• Abstract summary: We compare empirical results from the D-Wave 2000Q quantum annealer to the computational ground truth for a variety of portfolio optimization instances. We identify control variations that yield optimal performance in terms of probability of success and probability of chain breaks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum annealing offers a novel approach to finding the optimal solutions for a variety of computational problems, where the quantum annealing controls influence the observed performance and error mechanisms by tuning the underlying quantum dynamics. However, the influence of the available controls is often poorly understood, and methods for evaluating the effects of these controls are necessary to tune quantum computational performance. Here we use portfolio optimization as a case study by which to benchmark quantum annealing controls and their relative effects on computational accuracy. We compare empirical results from the D-Wave 2000Q quantum annealer to the computational ground truth for a variety of portfolio optimization instances. We evaluate both forward and reverse annealing methods and we identify control variations that yield optimal performance in terms of probability of success and probability of chain breaks.

Related papers

• FOCQS: Feedback Optimally Controlled Quantum States [0.0]
  Feedback-based quantum algorithms, such as FALQON, avoid fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. We develop an analytic framework to use it to perturbatively update previous control layers. This perturbative methodology, which we call Feedback Optimally Controlled Quantum States (FOCQS), can be used to improve the results of feedback-based algorithms.
  arXiv  Detail & Related papers  (2024-09-23T18:00:06Z)
• Robustness of optimal quantum annealing protocols [0.0]
  We show that the norm of the Hamiltonian quantifies the robustness against these errors, motivating the introduction of an additional regularization term in the cost function. We analyze the optimality conditions of the resulting robust quantum optimal control problem based on Pontryagin's maximum principle.
  arXiv  Detail & Related papers  (2024-08-13T10:10:56Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Binary Quantum Control Optimization with Uncertain Hamiltonians [4.194844657284146]
  We consider a discrete optimization formulation of a binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimize both risk-neutral and risk-averse measurements of control policies. We demonstrate that the controls of our model achieve significantly higher quality and robustness compared to the controls of a deterministic model.
  arXiv  Detail & Related papers  (2024-01-18T16:51:01Z)
• Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational Quantum Systems [65.268245109828]
  We compare the performance of classicals across a series of partially-randomized tasks. We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
  arXiv  Detail & Related papers  (2023-10-14T02:13:26Z)
• Performance Bounds for Quantum Control [0.06999740786886534]
  Quantum feedback controllers often lack performance targets and optimality certificates. We combine quantum filtering theory and moment-sum-of-squares techniques to construct a hierarchy of convex optimization problems.
  arXiv  Detail & Related papers  (2023-04-06T20:48:51Z)
• Optimization Applications as Quantum Performance Benchmarks [0.0]
  Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. Inspired by existing methods to characterize classical optimization algorithms, we analyze the solution quality obtained by solving Max-Cut problems. This is used to guide the development of an advanced benchmarking framework for quantum computers.
  arXiv  Detail & Related papers  (2023-02-05T01:56:06Z)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.