Quantum gradient descent algorithms for nonequilibrium steady states and linear algebraic systems

Abstract

The gradient descent approach is the key ingredient in variational quantum algorithms and machine learning tasks, which is an optimization algorithm for finding a local minimum of an objective function. The quantum versions of gradient descent have been investigated and implemented in calculating molecular ground states and optimizing polynomial functions. Based on the quantum gradient descent algorithm and Choi-Jamiolkowski isomorphism, we present approaches to simulate efficiently the nonequilibrium steady states of Markovian open quantum many-body systems. Two strategies are developed to evaluate the expectation values of physical observables on the nonequilibrium steady states. Moreover, we adapt the quantum gradient descent algorithm to solve linear algebra problems including linear systems of equations and matrix-vector multiplications, by converting these algebraic problems into the simulations of closed quantum systems with well-defined Hamiltonians. Detailed examples are given to test numerically the effectiveness of the proposed algorithms for the dissipative quantum transverse Ising models and matrix-vector multiplications.

arXiv comment12 pages, 4 figures

References in corpus (61)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Quantum Mechanics helps in searching for a needle in a haystack
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum Amplitude Amplification and Estimation
• Trapped-Ion Quantum Computing: Progress and Challenges
• Quantum States and Phases in Driven Open Quantum Systems with Cold Atoms
• Quantum fingerprinting
• Strong quantum computational advantage using a superconducting quantum processor
• Parameterized quantum circuits as machine learning models
• Preparation of Entangled States by Quantum Markov Processes
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Efficient quantum state tomography
• Photonic quantum information processing: a concise review
• Quantum generative adversarial learning
• Variational ansatz-based quantum simulation of imaginary time evolution
• Topology by Dissipation in Atomic Quantum Wires
• Quantum generative adversarial networks
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Variational Quantum Computation of Excited States
• Spectral theory of Liouvillians for dissipative phase transitions
• Superconducting Quantum Computing: A Review
• Quantum-state preparation with universal gate decompositions
• Architectures for a quantum random access memory
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Hybrid Quantum-Classical Convolutional Neural Networks
• Neural-Network Approach to Dissipative Quantum Many-Body Dynamics
• Experimental Quantum Generative Adversarial Networks for Image Generation
• The General Quantum Interference Principle and the Duality Computer
• Variational quantum algorithms for discovering Hamiltonian spectra
• Variational Quantum Monte Carlo Method with a Neural-Network Ansatz for Open Quantum Systems
• Variational neural network ansatz for steady states in open quantum systems
• Silicon qubit fidelities approaching incoherent noise limits via pulse engineering
• Variational Quantum State Diagonalization
• Stabilizing Open Quantum Systems by Markovian Reservoir Engineering
• Constructing neural stationary states for open quantum many-body systems
• Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
• Variational algorithms for linear algebra
• Procedures for Converting among Lindblad, Kraus and Matrix Representations of Quantum Dynamical Semigroups
• Quantum circuits with uniformly controlled one-qubit gates
• Quantum assisted Gaussian process regression
• Variational Quantum Singular Value Decomposition
• Beyond the swap test: optimal estimation of quantum state overlap
• Near-term quantum algorithms for linear systems of equations
• Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
• Experimental simulation of open quantum system dynamics via Trotterization
• Quantum Anomaly Detection with Density Estimation and Multivariate Gaussian Distribution
• Variational Quantum Algorithm for Non-equilibrium Steady States
• Quantum simulation of quantum channels in nuclear magnetic resonance
• Variational Quantum Algorithms for Dimensionality Reduction and Classification
• Optimizing a Polynomial Function on a Quantum Simulator
• Quantum Compressed Sensing with Unsupervised Tensor-Network Machine Learning
• Quantum algorithms for the generalized eigenvalue problem
• Quantum Gradient Algorithm for General Polynomials
• Hybrid quantum variational algorithm for simulating open quantum systems with near-term devices
• Variational Quantum Algorithms for Steady States of Open Quantum Systems

Cited by in corpus (7)

• Phase Transition Study meets Machine Learning
• Sharing Quantum Nonlocality in Star Network Scenarios
• Improved iterative quantum algorithm for ground-state preparation
• Assisted quantum simulation of open quantum systems
• Constraint-Aware Quantum Optimization via Hamming Weight Operators
• Revealing hidden standard tripartite nonlocality by local filtering
• Quantum partial coherence measures constructed from Fisher information