Variational Quantum Algorithm Landscape Reconstruction by Low-Rank Tensor Completion

Abstract

Variational quantum algorithms (VQAs) are a broad class of algorithms with many applications in science and industry. Applying a VQA to a problem involves optimizing a parameterized quantum circuit by maximizing or minimizing a cost function. A particular challenge associated with VQAs is understanding the properties of associated cost functions. Having the landscapes of VQA cost functions can greatly assist in developing and testing new variational quantum algorithms, but they are extremely expensive to compute. Reconstructing the landscape of a VQA using existing techniques requires a large number of cost function evaluations, especially when the dimension or the resolution of the landscape is high. To address this challenge, we propose a low-rank tensor-completion-based approach for local landscape reconstruction. By leveraging compact low-rank representations of tensors, our technique can overcome the curse of dimensionality and handle high-resolution landscapes. We demonstrate the power of landscapes in VQA development by showcasing practical applications of analyzing penalty terms for constrained optimization problems and examining the probability landscapes of certain basis states.

References in corpus (21)

• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Efficient classical simulation of slightly entangled quantum computations
• Barren plateaus in quantum neural network training landscapes
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Quantum computing for finance
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Multistart Methods for Quantum Approximate Optimization
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Progress toward favorable landscapes in quantum combinatorial optimization
• Constrained Optimization via Quantum Zeno Dynamics
• Parameter Setting in Quantum Approximate Optimization of Weighted Problems
• A quantum-inspired tensor network method for constrained combinatorial optimization problems
• Quantum Energy Landscape and VQA Optimization
• Analyzing variational quantum landscapes with information content
• Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization
• Enabling High Performance Debugging for Variational Quantum Algorithms using Compressed Sensing