Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy
Networks
- URL: http://arxiv.org/abs/2012.06701v1
- Date: Sat, 12 Dec 2020 02:13:28 GMT
- Title: Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy
Networks
- Authors: Jiahao Yao, Paul K\"ottering, Hans Gundlach, Lin Lin, Marin Bukov
- Abstract summary: Variational quantum eigensolvers have recently received increased attention, as they enable the use of quantum computing devices.
We present a hybrid policy gradient algorithm capable of simultaneously optimizing continuous and discrete degrees of freedom in an uncertainty-resilient way.
Our work exhibits the beneficial synergy between reinforcement learning and quantum control.
- Score: 2.5946789143276447
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Variational quantum eigensolvers have recently received increased attention,
as they enable the use of quantum computing devices to find solutions to
complex problems, such as the ground energy and ground state of
strongly-correlated quantum many-body systems. In many applications, it is the
optimization of both continuous and discrete parameters that poses a formidable
challenge. Using reinforcement learning (RL), we present a hybrid policy
gradient algorithm capable of simultaneously optimizing continuous and discrete
degrees of freedom in an uncertainty-resilient way. The hybrid policy is
modeled by a deep autoregressive neural network to capture causality. We employ
the algorithm to prepare the ground state of the nonintegrable quantum Ising
model in a unitary process, parametrized by a generalized quantum approximate
optimization ansatz: the RL agent solves the discrete combinatorial problem of
constructing the optimal sequences of unitaries out of a predefined set and, at
the same time, it optimizes the continuous durations for which these unitaries
are applied. We demonstrate the noise-robust features of the agent by
considering three sources of uncertainty: classical and quantum measurement
noise, and errors in the control unitary durations. Our work exhibits the
beneficial synergy between reinforcement learning and quantum control.
Related papers
- Projective Quantum Eigensolver with Generalized Operators [0.0]
We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework.
With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
arXiv Detail & Related papers (2024-10-21T15:40:22Z) - MG-Net: Learn to Customize QAOA with Circuit Depth Awareness [51.78425545377329]
Quantum Approximate Optimization Algorithm (QAOA) and its variants exhibit immense potential in tackling optimization challenges.
The requisite circuit depth for satisfactory performance is problem-specific and often exceeds the maximum capability of current quantum devices.
We introduce the Mixer Generator Network (MG-Net), a unified deep learning framework adept at dynamically formulating optimal mixer Hamiltonians.
arXiv Detail & Related papers (2024-09-27T12:28:18Z) - Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO)
Our purely quantum approach eliminates the dependency on classical variational quantum algorithms.
It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
arXiv Detail & Related papers (2024-05-22T18:11:42Z) - Performant near-term quantum combinatorial optimization [1.1999555634662633]
We present a variational quantum algorithm for solving optimization problems with linear-depth circuits.
Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target quantum function.
We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.
arXiv Detail & Related papers (2024-04-24T18:49:07Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - 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) - Optimal quantum control via genetic algorithms for quantum state
engineering in driven-resonator mediated networks [68.8204255655161]
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms.
We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator.
We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
arXiv Detail & Related papers (2022-06-29T14:34:00Z) - 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) - Reinforcement Learning for Many-Body Ground-State Preparation Inspired
by Counterdiabatic Driving [2.5614220901453333]
CD-QAOA is designed for quantum many-body systems and optimized using a reinforcement learning (RL) approach.
We show that using terms occurring in the adiabatic gauge potential as generators of additional control unitaries, it is possible to achieve fast high-fidelity many-body control away from the adiabatic regime.
This work paves the way to incorporate recent success from deep learning for the purpose of quantum many-body control.
arXiv Detail & Related papers (2020-10-07T21:13:22Z) - 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) - 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.