Robustness of optimal quantum annealing protocols

• URL: http://arxiv.org/abs/2408.06782v2
• Date: Mon, 16 Sep 2024 15:03:51 GMT
• Title: Robustness of optimal quantum annealing protocols
• Authors: Niklas Funcke, Julian Berberich,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Noise in quantum computing devices poses a key challenge in their realization. In this paper, we study the robustness of optimal quantum annealing protocols against coherent control errors, which are multiplicative Hamlitonian errors causing detrimental effects on current quantum devices. 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, showing that robust protocols admit larger smooth annealing sections. This suggests that quantum annealing admits improved robustness in comparison to bang-bang solutions such as the quantum approximate optimization algorithm. Finally, we perform numerical simulations to verify our analytical results and demonstrate the improved robustness of the proposed approach.

Related papers

• 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)
• Enhancing Quantum Computation via Superposition of Quantum Gates [1.732837834702512]
  We present different protocols, which we denote as "superposed quantum error mitigation" We show that significant noise suppression can be achieved for most kinds of decoherence and standard experimental parameter regimes. We analyze our approach for gate-based, measurement-based and interferometric-based models.
  arXiv  Detail & Related papers  (2023-04-17T18:01:05Z)
• 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)
• Robustness of quantum algorithms against coherent control errors [0.5407319151576265]
  We present a framework for analyzing the robustness of quantum algorithms against coherent control errors using Lipschitz bounds. We derive worst-case fidelity bounds which show that the resilience against coherent control errors is mainly influenced by the norms of the Hamiltonians generating the individual gates.
  arXiv  Detail & Related papers  (2023-03-01T16:18:38Z)
• 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)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• 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)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Benchmarking Quantum Annealing Controls with Portfolio Optimization [0.0]
  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.
  arXiv  Detail & Related papers  (2020-07-06T18:46:55Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.