Tutorial: Calibration refinement in quantum annealing

• URL: http://arxiv.org/abs/2304.10352v1
• Date: Thu, 20 Apr 2023 14:48:37 GMT
• Title: Tutorial: Calibration refinement in quantum annealing
• Authors: Kevin Chern, Kelly Boothby, Jack Raymond, Pau Farr\'e, and Andrew D. King
• Abstract summary: Quantum annealers are susceptible to nonidealities including crosstalk, device variation, and environmental noise. "shimming" can significantly improve performance, but often relies on ad-hoc methods that exploit symmetries in both the problem being solved and the quantum annealer itself. We introduce methods for finding exploitable symmetries in Ising models, and discuss how to use these symmetries to suppress unwanted bias.
• Score: 0.3425341633647624
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum annealing has emerged as a powerful platform for simulating and optimizing classical and quantum Ising models. Quantum annealers, like other quantum and/or analog computing devices, are susceptible to nonidealities including crosstalk, device variation, and environmental noise. Compensating for these effects through calibration refinement or "shimming" can significantly improve performance, but often relies on ad-hoc methods that exploit symmetries in both the problem being solved and the quantum annealer itself. In this tutorial we attempt to demystify these methods. We introduce methods for finding exploitable symmetries in Ising models, and discuss how to use these symmetries to suppress unwanted bias. We work through several examples of increasing complexity, and provide complete Python code. We include automated methods for two important tasks: finding copies of small subgraphs in the qubit connectivity graph, and automatically finding symmetries of an Ising model via generalized graph automorphism. Code is available at https://github.com/dwavesystems/shimming-tutorial.

Related papers

• Discrete Randomized Smoothing Meets Quantum Computing [40.54768963869454]
  We show how to encode all the perturbations of the input binary data in superposition and use Quantum Amplitude Estimation (QAE) to obtain a quadratic reduction in the number of calls to the model. In addition, we propose a new binary threat model to allow for an extensive evaluation of our approach on images, graphs, and text.
  arXiv  Detail & Related papers  (2024-08-01T20:21:52Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• A Modified Depolarization Approach for Efficient Quantum Machine Learning [0.0]
  We propose a modified representation for a single-qubit depolarization channel with two Kraus operators. Our approach reduces the computational complexity from six to four matrix multiplications per execution of a channel. This simplified noise model enables more scalable simulations of quantum circuits under depolarization.
  arXiv  Detail & Related papers  (2024-04-10T20:17:40Z)
• Applications of model-aware reinforcement learning in Bayesian quantum metrology [0.6138671548064355]
  In Belliardo et al., arXiv:2312.16985 (2023), we introduced a procedure capable of optimizing a wide range of tasks in quantum metrology and estimation. We take a model-based approach to the optimisation where the physics describing the system is explicitly taken into account in the training. This exposition showcases the broad applicability of the method, which has been implemented in the qsensoropt library released on PyPI.
  arXiv  Detail & Related papers  (2024-03-08T22:48:07Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Variational quantum simulation of critical Ising model with symmetry averaging [0.2578242050187029]
  We investigate the use of deep multi-scale entanglement renormalization circuits as a variational ansatz for ground states of gapless systems. We find that DMERA strongly outperforms a standard QAOA-style ansatz, and that a major source of systematic error in correlation functions approximated using DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model.
  arXiv  Detail & Related papers  (2022-10-26T21:37:14Z)
• Automatic and effective discovery of quantum kernels [43.702574335089736]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. We present a different approach, which employs optimization techniques, similar to those used in neural architecture search and AutoML. The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Learning quantum symmetries with interactive quantum-classical variational algorithms [0.0]
  A symmetry of a state $vert psi rangle$ is a unitary operator of which $vert psi rangle$ is an eigenvector. symmetries provide key physical insight into the quantum system. We develop a variational hybrid quantum-classical learning scheme to systematically probe for symmetries of $vert psi rangle$.
  arXiv  Detail & Related papers  (2022-06-23T20:41:26Z)
• Ion native variational ansatz for quantum approximate optimization [0.0]
  We show that symmetry can be broken to solve all problem instances of the Sherrington-Kirkpatrick Hamiltonian. Specifically these findings widen the class problem instances which might be solved by ion based quantum processors.
  arXiv  Detail & Related papers  (2022-06-23T18:00:01Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• 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.