Progress toward favorable landscapes in quantum combinatorial optimization

  title={Progress toward favorable landscapes in quantum combinatorial optimization},
  author={Juneseo Lee and Alicia B. Magann and Herschel A. Rabitz and Christian Arenz},
  journal={Physical Review A},
Juneseo Lee, 2 Alicia B. Magann, Herschel A. Rabitz, and Christian Arenz 4 Department of Mathematics, Princeton University, Princeton, New Jersey 08544, USA Department of Chemistry, Princeton University, Princeton, New Jersey 08544, USA Department of Chemical & Biological Engineering, Princeton University, Princeton, New Jersey 08544, USA School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, Arizona 85287, USA (Dated: September 6, 2021) 

Figures from this paper

Quantum Chaos and Circuit Parameter Optimization
Joonho Kim, Yaron Oz, 3 and Dario Rosa School of Natural Sciences, Institute for Advanced Study, Princeton, NJ 08540, USA. Simons Center for Geometry and Physics, SUNY, Stony Brook, NY 11794, USA.
Theory of overparametrization in quantum neural networks
This paper presents a meta-analyses of the LaSalle–Cerezo–Larocca–Bouchut–Seiden–Stein cellular automaton, a model derived from the model developed by J. J. Giambiagi in 2007, which states that the model derived in this paper can be modified for flows on rugous topographies varying around an inclined plane.
Diagnosing barren plateaus with tools from quantum optimal control
Martín Larocca,1, 2 Piotr Czarnik,2 Kunal Sharma,3, 2 Gopikrishnan Muraleedharan,2 Patrick J. Coles,2 and M. Cerezo2, 4 Departamento de Física “J. J. Giambiagi” and IFIBA, FCEyN, Universidad de
Squeezing and quantum approximate optimization
Variational quantum algorithms o ff er fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such
Markov Chain Monte-Carlo Enhanced Variational Quantum Algorithms
This work introduces a variational quantum algorithm that uses classical Markov chain Monte Carlo techniques to provably converge to global minima and guarantees performance guarantees are derived from the ergodicity of the algorithm’s state space and enable us to place analytic bounds on its time-complexity.
Adiabatic quantum computing with parameterized quantum circuits
This work analyzes how a small perturbation of a Hamiltonian affects the parameters that minimize the energy within a family of parameterized quantum states to propose a discrete version of adiabatic quantum computing that can be implemented with quantum devices identical with those of variational quantum algorithms, while being insensitive to the parameter initialization and other limitations that the optimization part of variations bring.
Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe
Quantum optimal control, a toolbox for devising and implementing the shapes of external fields that accomplish given tasks in the operation of a quantum device in the best way possible, has evolved
Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
In this work, we compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers such as Gurobi and MQLib to solve the combinatorial
An entanglement perspective on the quantum approximate optimization algorithm
The QAOA algorithm for solving the paradigmatic Max-Cut problem on different types of graphs is considered and it is found that there is a volume-law entanglement barrier between the initial and final states.
Toward Trainability of Deep Quantum Neural Networks
This work provides the first viable solution to the vanishing gradient problem for deep QNNs with theoretical guarantees, and proves that for circuits with controlled-layer architectures, the expectation of the gradient norm can be lower bounded by a value that is independent of the qubit number and the circuit depth.


Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm
This work implements the quantum approximate optimization algorithm on a hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler, and solves small instances of the NP (nondeterministic polynomial time)-complete exact-cover problem, with 96.6% success probability.
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
This work proposes a variational method involving closely integrated classical and quantum coprocessors and finds that it is efficient and appears to be fundamentally more robust against error accumulation than a more conventional optimised Trotterisation technique.
Quantum control landscapes
Here, studies that aim to systematically characterize properties of the solution sets to quantum control problems that are fundamentally different from their classical counterparts are reviewed, enabling the classification of quantum control mechanisms and the design of globally efficient quantum control algorithms.
Quantum Optimally Controlled Transition Landscapes
It is proved that for controllable quantum systems with no constraints placed on the controls, the only allowed extrema of the transition probability landscape correspond to perfect control or no control.
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter.
Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
This paper focuses on a special family of quantum circuits called the Hamiltonian Variational Ansatz (HVA), which takes inspiration from the quantum approximation optimization algorithm and adiabatic quantum computation and exhibits favorable structural properties and numerically observes that the optimization landscape of HVA becomes almost trap free when the ansatz is over-parameterized.
Barren plateaus in quantum neural network training landscapes
It is shown that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits.
The theory of variational hybrid quantum-classical algorithms
This work develops a variational adiabatic ansatz and explores unitary coupled cluster where it is shown how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.
The theory of variational hybrid quantum-classical algorithms
The concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device is introduced and the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.
Quantum optimization using variational algorithms on near-term quantum devices
The quantum volume as a metric to compare the power of near-term quantum devices is discussed and simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies.