The Snake Optimizer for Learning Quantum Processor Control Parameters
- URL: http://arxiv.org/abs/2006.04594v1
- Date: Mon, 8 Jun 2020 13:42:35 GMT
- Title: The Snake Optimizer for Learning Quantum Processor Control Parameters
- Authors: Paul V. Klimov, Julian Kelly, John M. Martinis, Hartmut Neven
- Abstract summary: In some cases, the learning procedure requires non-dimensional system problems that are highly constrained astronomical search spaces.
Such problems pose an obstacle for scalability since traditional qubits are often too slow for small-scale control.
In practice, the Snake has been applied to optimize the at which quantum gates are optimized.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: High performance quantum computing requires a calibration system that learns
optimal control parameters much faster than system drift. In some cases, the
learning procedure requires solving complex optimization problems that are
non-convex, high-dimensional, highly constrained, and have astronomical search
spaces. Such problems pose an obstacle for scalability since traditional global
optimizers are often too inefficient and slow for even small-scale processors
comprising tens of qubits. In this whitepaper, we introduce the Snake Optimizer
for efficiently and quickly solving such optimization problems by leveraging
concepts in artificial intelligence, dynamic programming, and graph
optimization. In practice, the Snake has been applied to optimize the
frequencies at which quantum logic gates are implemented in frequency-tunable
superconducting qubits. This application enabled state-of-the-art system
performance on a 53 qubit quantum processor, serving as a key component of
demonstrating quantum supremacy. Furthermore, the Snake Optimizer scales
favorably with qubit number and is amenable to both local re-optimization and
parallelization, showing promise for optimizing much larger quantum processors.
Related papers
- Distributed Variational Quantum Algorithm with Many-qubit for Optimization Challenges [0.25782420501870296]
Existing quantum algorithms struggle with scalability and accuracy due to excessive reliance on entanglement.
We propose variational quantum optimization algorithm (VQOA), which leverages many-qubit (MQ) operations in an ansatz solely employing quantum superposition.
We also introduce distributed VQOA, which integrates high-performance computing with quantum computing to achieve superior performance across MQ systems and classical nodes.
arXiv Detail & Related papers (2025-02-28T22:13:23Z) - Symmetry-preserved cost functions for variational quantum eigensolver [0.0]
Hybrid quantum-classical variational algorithms are considered ideal for noisy quantum computers.
We propose encoding symmetry preservation directly into the cost function, enabling more efficient use of Hardware-Efficient Ans"atze.
arXiv Detail & Related papers (2024-11-25T20:33:47Z) - 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) - Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance.
Here we report on a strategy that can overcome such problems.
We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
arXiv Detail & Related papers (2023-08-04T13:39:46Z) - Quantum approximate optimization via learning-based adaptive
optimization [5.399532145408153]
Quantum approximate optimization algorithm (QAOA) is designed to solve objective optimization problems.
Our results demonstrate that the algorithm greatly outperforms conventional approximations in terms of speed, accuracy, efficiency and stability.
This work helps to unlock the full power of QAOA and paves the way toward achieving quantum advantage in practical classical tasks.
arXiv Detail & Related papers (2023-03-27T02:14:56Z) - An Empirical Review of Optimization Techniques for Quantum Variational
Circuits [0.0]
Quantum Variational Circuits (QVCs) are often claimed as one of the most potent uses of both near term and long term quantum hardware.
Standard approaches to optimizing these circuits rely on a classical system to compute the new parameters at every optimization step.
We empirically evaluate the potential of many common gradient and frees on a variety of optimization tasks.
arXiv Detail & Related papers (2022-02-03T03:20:54Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - 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) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial
Optimization [0.14755786263360526]
We explore which quantum algorithms for optimization might be most practical to try out on a small fault-tolerant quantum computer.
Our results discourage the notion that any quantum optimization realizing only a quadratic speedup will achieve an advantage over classical algorithms.
arXiv Detail & Related papers (2020-07-14T22:54:04Z)
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.