Binary Control Pulse Optimization for Quantum Systems

• URL: http://arxiv.org/abs/2204.05773v3
• Date: Thu, 8 Dec 2022 01:56:36 GMT
• Title: Binary Control Pulse Optimization for Quantum Systems
• Authors: Xinyu Fei and Lucas T. Brady and Jeffrey Larson and Sven Leyffer and Siqian Shen
• Abstract summary: Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. We apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.
• Score: 2.887393074590696
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared $L_2$-penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

Related papers

• Quantum control by the environment: Turing uncomputability, Optimization over Stiefel manifolds, Reachable sets, and Incoherent GRAPE [56.47577824219207]
  In many practical situations, the controlled quantum systems are open, interacting with the environment. In this note, we briefly review some results on control of open quantum systems using environment as a resource.
  arXiv  Detail & Related papers  (2024-03-20T10:09:13Z)
• Machine-learning-inspired quantum optimal control of nonadiabatic geometric quantum computation via reverse engineering [3.3216171033358077]
  We propose a promising average-fidelity-based machine-learning-inspired method to optimize the control parameters. We implement a single-qubit gate by cat-state nonadiabatic geometric quantum computation via reverse engineering. We demonstrate that the neural network possesses the ability to expand the model space.
  arXiv  Detail & Related papers  (2023-09-28T14:36:26Z)
• Switching Time Optimization for Binary Quantum Optimal Control [2.887393074590696]
  We develop an algorithmic framework that sequentially optimize the number of control switches and the duration of each control interval on a continuous time horizon. We demonstrate that our computational framework can obtain binary controls with high-quality performance and also reduce computational time.
  arXiv  Detail & Related papers  (2023-08-06T14:51:11Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Solving quantum optimal control problems using projection-operator-based Newton steps [0.25602836891933073]
  The paper significantly improves prior versions of the quantum projection operator by introducing a regulator that stabilizes the solution estimate at every iteration. This modification is shown to not only improve the convergence rate of the algorithm, but also steer the solver towards better local minima.
  arXiv  Detail & Related papers  (2023-05-28T04:30:35Z)
• Optimal solutions to quantum annealing using two independent control functions [0.0]
  We show that an optimal solution consists of both controls tuned at their upper bound for the whole evolution time. We propose the use of a quantum optimal control technique adapted to limit the amplitude of the controls. We show that the scheme with two-control functions yields a higher fidelity than the other schemes for the same evolution time.
  arXiv  Detail & Related papers  (2021-10-26T16:54:17Z)
• Optimizing quantum control pulses with complex constraints and few variables through Tensorflow [0.0]
  We show how to apply optimal control algorithms on realistic quantum systems by incorporating multiple constraints into the gradient optimization. We test our algorithm by finding smooth control pulses to implement single-qubit and two-qubit gates for superconducting transmon qubits with always-on interaction. Our algorithm provides a promising optimal quantum control approach that is friendly to complex and optional physical constraints.
  arXiv  Detail & Related papers  (2021-10-11T14:59:28Z)
• 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)
• 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)
• Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
  We review and extend the application of deep learning to quantum geometric control problems. We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems. Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
  arXiv  Detail & Related papers  (2020-06-19T19:12:14Z)

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.