Unitary Block Optimization for Variational Quantum Algorithms
Lucas Slattery, Benjamin Villalonga, and Bryan K. Clark

TL;DR
This paper introduces the unitary block optimization scheme (UBOS) for variational quantum algorithms, demonstrating its advantages in convergence and robustness for VQE and quantum time evolution on NISQ devices.
Contribution
The paper proposes UBOS as a novel optimization method for variational quantum algorithms, improving convergence speed and reducing sensitivity to local minima and barren plateaus.
Findings
UBOS achieves faster convergence than traditional methods.
UBOS is less sensitive to barren plateaus.
UBOS can tunnel through local minima effectively.
Abstract
Variational quantum algorithms are a promising hybrid framework for solving chemistry and physics problems with broad applicability to optimization as well. They are particularly well suited for noisy intermediate scale quantum (NISQ) computers. In this paper, we describe the unitary block optimization scheme (UBOS) and apply it to two variational quantum algorithms: the variational quantum eigensolver (VQE) and variational time evolution. The goal of VQE is to optimize a classically intractable parameterized quantum wave function to target a physical state of a Hamiltonian or solve an optimization problem. UBOS is an alternative to other VQE optimization schemes with a number of advantages including fast convergence, less sensitivity to barren plateaus, the ability to tunnel through some local minima and no hyperparameters to tune. We additionally describe how UBOS applies to real and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Optical Network Technologies
