• Corpus ID: 174802928

Quantum Approximate Optimization with a Trapped-Ion Quantum Simulator

  title={Quantum Approximate Optimization with a Trapped-Ion Quantum Simulator},
  author={Guido Pagano and Aniruddha Bapat and Patrick Becker and K S Collins and Arinjoy De and Paul W Hess and Harvey B. Kaplan and Antonios Kyprianidis and Wen Lin Tan and Christopher L. Baldwin and Lucas T. Brady and Abhinav Deshpande and F. Liu and Stephen P. Jordan and Alexey V. Gorshkov and Christopher R. Monroe},
  journal={arXiv: Quantum Physics},
Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly solving exponentially hard problems, such as optimization and satisfiability. Here we report the first implementation of a shallow-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator to estimate the ground state energy of the transverse field Ising model with tunable long-range interactions… 
Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
It is demonstrated that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers by implementing a continuous hardware-efficient gate set using superconducting quantum circuits.
Prospects for quantum enhancement with diabatic quantum annealing
Diabatic quantum annealing is argued for as the most promising route to quantum enhancement within this framework on the basis that improved coherence times and control capabilities will enable the near-term exploration of several heuristic quantum optimization algorithms that have been introduced in the literature.
Multilevel Combinatorial Optimization across Quantum Architectures
This article advocates the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms and develops hybrid multileVEL solvers with quantum local search on D-Wave’s quantum annealer and IBM's gate-model based quantum processor.
A quantum algorithm to count weighted ground states of classical spin Hamiltonians
This work modifications AQO and QAOA to count the ground states of arbitrary classical spin Hamiltonians, including counting ground states with arbitrary nonnegative weights attached to them, an important step in approaching general ground-state counting problems beyond those that can be solved with Grover's algorithm.
Evaluation of Quantum Approximate Optimization Algorithm based on the approximation ratio of single samples
By selecting a suitable optimizer for the variational parameters and reducing the number of function evaluations, QAOA performance improves by up to 2 orders of magnitude compared to previous estimates and decreases the performance gap with classical alternatives.
Dynamical structure factors of dynamical quantum simulators
It is argued that practically accessible variants of the dynamical structure factors are bounded-error quantum polynomial time (BQP)-hard for general local Hamiltonians, which suggests that quantum simulations employing near-term noisy intermediate-scale quantum devices should allow for the observation of features of dynamicals structure factors of correlated quantum matter in the presence of experimental imperfections.
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
The application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA) is demonstrated and an approximation ratio is obtained that is independent of problem size and for the first time, that performance increases with circuit depth.
Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
It is shown that encoding symmetries of the simulated Hamiltonian in the VQE ansatz reduces both classical and quantum resources compared to other, widely available ansatze.
Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings
This work presents methods for constructing any target coupling graph using limited global controls in an Ising-like quantum spin system and formulate a mixed-integer program to solve the graph coupling problem to optimality.
Measurement Error Mitigation for Variational Quantum Algorithms
A technique for mitigating expectation values against correlated measurement errors that can be applied to measurements of 10s of qubits is applied to VQAs and its effectiveness in improving estimates to the cost function is demonstrated.