Gradient Ascent Pulse Engineering with Feedback

• URL: http://arxiv.org/abs/2203.04271v2
• Date: Sun, 7 May 2023 22:24:19 GMT
• Title: Gradient Ascent Pulse Engineering with Feedback
• Authors: Riccardo Porotti, Vittorio Peano, Florian Marquardt
• Abstract summary: We introduce feedback-GRAPE, which borrows some concepts from model-free reinforcement learning to incorporate the response to strong measurements. Our method yields interpretable feedback strategies for state preparation and stabilization in the presence of noise.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient approaches to quantum control and feedback are essential for quantum technologies, from sensing to quantum computation. Open-loop control tasks have been successfully solved using optimization techniques, including methods like gradient-ascent pulse engineering (GRAPE), relying on a differentiable model of the quantum dynamics. For feedback tasks, such methods are not directly applicable, since the aim is to discover strategies conditioned on measurement outcomes. In this work, we introduce feedback-GRAPE, which borrows some concepts from model-free reinforcement learning to incorporate the response to strong stochastic (discrete or continuous) measurements, while still performing direct gradient ascent through the quantum dynamics. We illustrate its power considering various scenarios based on cavity QED setups. Our method yields interpretable feedback strategies for state preparation and stabilization in the presence of noise. Our approach could be employed for discovering strategies in a wide range of feedback tasks, from calibration of multi-qubit devices to linear-optics quantum computation strategies, quantum-enhanced sensing with adaptive measurements, and quantum error correction.

Related papers

• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• In Search of Quantum Advantage: Estimating the Number of Shots in Quantum Kernel Methods [30.565491081930997]
  We develop an approach for estimating desired precision of kernel values, which is translated into the number of circuit runs. We stress that quantum kernel methods should not only be considered from the machine learning performance perspective, but also from the context of the resource consumption.
  arXiv  Detail & Related papers  (2024-07-22T16:29:35Z)
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
  Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages. The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost. We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
  arXiv  Detail & Related papers  (2023-07-19T08:07:53Z)
• Variational preparation of entangled states on quantum computers [0.0]
  We propose a variational approach for preparing entangled quantum states on quantum computers. We employ various gradient-based optimization techniques to enhance performance. We demonstrate the effectiveness of the variational algorithm in maximizing the efficiency of quantum state preparation.
  arXiv  Detail & Related papers  (2023-06-30T06:29:24Z)
• Quantum Policy Gradient Algorithm with Optimized Action Decoding [1.3946033794136758]
  We introduce a novel quality measure that enables us to optimize the classical post-processing required for action selection. With this technique, we successfully execute a full training routine on a 5-qubit hardware device.
  arXiv  Detail & Related papers  (2022-12-13T15:42:10Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Model-Free Quantum Control with Reinforcement Learning [0.0]
  We propose a circuit-based approach for training a reinforcement learning agent on quantum control tasks in a model-free way. We show how to reward the learning agent using measurements of experimentally available observables. This approach significantly outperforms widely used model-free methods in terms of sample efficiency.
  arXiv  Detail & Related papers  (2021-04-29T17:53:26Z)
• Gradient-free quantum optimization on NISQ devices [0.0]
  We consider recent advances in weight-agnostic learning and propose a strategy that addresses the trade-off between finding appropriate circuit architectures and parameter tuning. We investigate the use of NEAT-inspired algorithms which evaluate circuits via genetic competition and thus circumvent issues due to exceeding numbers of parameters.
  arXiv  Detail & Related papers  (2020-12-23T10:24:54Z)
• Policy Gradient based Quantum Approximate Optimization Algorithm [2.5614220901453333]
  We show that policy-gradient-based reinforcement learning algorithms are well suited for optimizing the variational parameters of QAOA in a noise-robust fashion. We analyze the performance of the algorithm for quantum state transfer problems in single- and multi-qubit systems.
  arXiv  Detail & Related papers  (2020-02-04T00:46:51Z)

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.