Switching Time Optimization for Binary Quantum Optimal Control

• URL: http://arxiv.org/abs/2308.03132v1
• Date: Sun, 6 Aug 2023 14:51:11 GMT
• Title: Switching Time Optimization for Binary Quantum Optimal Control
• Authors: Xinyu Fei, Lucas T. Brady, Jeffrey Larson, Sven Leyffer, Siqian Shen
• Abstract summary: 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.
• Score: 2.887393074590696
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum optimal control is a technique for controlling the evolution of a quantum system and has been applied to a wide range of problems in quantum physics. We study a binary quantum control optimization problem, where control decisions are binary-valued and the problem is solved in diverse quantum algorithms. In this paper, we utilize classical optimization and computing techniques to develop an algorithmic framework that sequentially optimizes the number of control switches and the duration of each control interval on a continuous time horizon. Specifically, we first solve the continuous relaxation of the binary control problem based on time discretization and then use a heuristic to obtain a controller sequence with a penalty on the number of switches. Then, we formulate a switching time optimization model and apply sequential least-squares programming with accelerated time-evolution simulation to solve the model. We demonstrate that our computational framework can obtain binary controls with high-quality performance and also reduce computational time via solving a family of quantum control instances in various quantum physics applications.

Related papers

• 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)
• 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)
• Efficient Quantum Algorithms for Quantum Optimal Control [2.9370710299422607]
  We present efficient quantum algorithms for solving the quantum optimal control problem. Our algorithms are based on a time-dependent Hamiltonian simulation method and a fast gradient-estimation algorithm. Our quantum algorithms require fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-04-05T17:33:57Z)
• Time-optimal control of quantum state preparation and entanglement creation in two-qubit quantum system with bounded amplitude [0.0]
  We study the time-optimal control problem in a two-qubit system with bounded amplitude. Two problems are considered: quantum state preparation and entanglement creation.
  arXiv  Detail & Related papers  (2022-11-17T03:55:50Z)
• Binary Control Pulse Optimization for Quantum Systems [2.887393074590696]
  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.
  arXiv  Detail & Related papers  (2022-04-12T12:58:55Z)
• 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)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• 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)
• Efficient exploration of Hamiltonian parameter space for optimal control of non-Markovian open quantum systems [0.0]
  We present a general method to efficiently design optimal control sequences for non-Markovian open quantum systems. We illustrate it by optimizing the shape of a laser pulse to prepare a quantum dot in a specific state.
  arXiv  Detail & Related papers  (2021-01-08T16:02:31Z)
• 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.