Randomized adaptive quantum state preparation

Abstract

We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit, where each adaptive step is informed by feedback from gradient measurements in which the associated tangent space directions are randomized. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states. We investigate different randomization procedures and develop lower bounds on the expected cost function change, which allows for drawing connections to barren plateaus and for assessing the applicability of the algorithm to large-scale problems.

References in corpus (37)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Quantum computational chemistry
• Quantum Circuit Learning
• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Training variational quantum algorithms is NP-hard
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Layerwise learning for quantum neural networks
• General parameter-shift rules for quantum gradients
• Hybrid Quantum-Classical Approach to Quantum Optimal Control
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Variational Thermal Quantum Simulation via Thermofield Double States
• Preparing ground states of quantum many-body systems on a quantum computer
• From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
• Variational Quantum Unsampling on a Quantum Photonic Processor
• Feedback-based quantum optimization
• Driven quantum dynamics: will it blend?
• Characterization of the Critical Submanifolds in Quantum Ensemble Control Landscapes
• Generalized quantum circuit differentiation rules
• Training Saturation in Layerwise Quantum Approximate Optimisation
• Abrupt Transitions in Variational Quantum Circuit Training
• Gradient Flows for Optimisation and Quantum Control: Foundations and Applications
• Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries
• Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer
• Lyapunov control-inspired strategies for quantum combinatorial optimization
• Optimizing quantum circuits with Riemannian gradient flow
• Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers
• Complete Quantum-State Tomography with a Local Random Field

Cited by in corpus (3)

• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Using a Feedback-Based Quantum Algorithm to Analyze the Critical Properties of the ANNNI Model Without Classical Optimization
• Feedback-Based Quantum Strategies for Constrained Combinatorial Optimization Problems