Inferring the Dynamics of the State Evolution During Quantum Annealing

• URL: http://arxiv.org/abs/2009.06387v2
• Date: Fri, 20 Nov 2020 02:12:21 GMT
• Title: Inferring the Dynamics of the State Evolution During Quantum Annealing
• Abstract summary: We use advanced features of D-Wave 2000Q to indirectly infer information about the dynamics of the state evolution during the anneal process. We obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer, which then returns a user-specified number of low-energy solutions. It would be useful to know what happens in the quantum processor during the anneal process so that one could design better algorithms or suggest improvements to the hardware. However, existing quantum annealers are not able to directly extract such information from the processor. Hence, in this work we propose to use advanced features of D-Wave 2000Q to indirectly infer information about the dynamics of the state evolution during the anneal process. Specifically, D-Wave 2000Q allows the user to customize the anneal schedule, that is, the schedule with which the anneal fraction is changed from the start to the end of the anneal. Using this feature, we design a set of modified anneal schedules whose outputs can be used to generate information about the states of the system at user-defined time points during a standard anneal. With this process, called "slicing", we obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves. We use our technique to obtain a variety of insights into the annealer, such as the state evolution during annealing, when individual bits in an evolving solution flip during the anneal process and when they stabilize, and we introduce a technique to estimate the freeze-out point of both the system as well as of individual qubits.

Related papers

• MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
  We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
  arXiv  Detail & Related papers  (2025-07-06T08:16:50Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Diabatic Quantum Annealing for the Frustrated Ring Model [0.7046417074932257]
  Adiabatic evolutions can lead to evolution times that scale exponentially with the system size. We show that non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown.
  arXiv  Detail & Related papers  (2022-12-05T22:16:17Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Open-system modeling of quantum annealing: theory and applications [0.0]
  We give derivations and numerical recipes for effective parallel simulation methods. We consider the weak-coupling limit to an environment and also the case of $1/f$ noise.
  arXiv  Detail & Related papers  (2021-07-15T10:12:41Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• The quantum annealing gap and quench dynamics in the exact cover problem [0.0]
  Annealing explores equilibrium phases of a Hamiltonian with slowly changing parameters. Quenches are sudden changes of the Hamiltonian, producing a non-equilibrium situation.
  arXiv  Detail & Related papers  (2021-06-15T12:43:23Z)
• Customized quantum annealing schedules [3.633891345356103]
  We show how superconducting circuits, in particular capacitively shunted flux qubits (CSFQs), can be used to construct quantum annealing systems. We use this mapping to find customized annealing schedules, while accounting for the physical limitations of the circuitry.
  arXiv  Detail & Related papers  (2021-03-11T05:09:12Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Advanced anneal paths for improved quantum annealing [0.0]
  We study how advanced features of the D-Wave annealer can help in improving the quality of the solutions returned by the annealer. The h-gain feature stands for time-dependent gain in Hamiltonian linear ($h$) biases and was originally developed to help study freezeout times and phase transitions in spin glasses. We test all techniques on a variety of input problems including the weighted Maximum Cut problem and the weighted Maximum Clique problem.
  arXiv  Detail & Related papers  (2020-09-10T17:15:48Z)

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.