• Corpus ID: 240353991

Quantum optimisation via maximally amplified states

  title={Quantum optimisation via maximally amplified states},
  author={Tavis Bennett and Jingbo B. Wang},
This paper presents the Maximum Amplification Optimisation Algorithm (MAOA), a novel quantum algorithm designed for combinatorial optimisation in the restricted circuit depth context of near-term quantum computing. The MAOA first produces a quantum state in which the optimal solutions to a problem are amplified to the maximum extent possible subject to a given restricted circuit depth. Subsequent repeated preparation and measurement of this maximally amplified state produces solutions of the… 

Quantum Optimisation for Continuous Multivariable Functions by a Structured Search

This paper shows that quantum variational algorithms can efficiently optimise continuous multivariable functions by exploiting general structural properties of a discretised continuous solution space with a convergence that exceeds the limits of an unstructured quantum search.



Quantum Supremacy through the Quantum Approximate Optimization Algorithm

It is argued that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable complexity theoretic assumptions, the output distribution of even the lowest depth version cannot be efficiently simulated on any classical device.

A Quantum Approximate Optimization Algorithm

A quantum algorithm that produces approximate solutions for combinatorial optimization problems that depends on a positive integer p and the quality of the approximation improves as p is increased, and is studied as applied to MaxCut on regular graphs.

Threshold-Based Quantum Optimization

Th-QAOA is proposed and study, a variation of the Quantum Alternating Operator Ansatz that replaces the standard phase separator operator with a threshold function that returns a value 1 for solutions with an objective value above the threshold and a 0 otherwise, to arrive at a quantum optimization algorithm.

Quantum Walk-Based Vehicle Routing Optimisation

This paper demonstrates the applicability of the Quantum Walk-based Optimisation Algorithm (QWOA) to the Capacitated Vehicle Routing Problem (CVRP). Efficient algorithms are developed for the

Quantum Computation by Adiabatic Evolution

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that

A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem

This paper applies the recent Quantum Approximate Optimization Algorithm to the combinatorial problem of bounded occurrence Max E3LIN2 and shows that the level one QAOA will efficiently produce a string that satisfies $\left(\frac{1}{2} + 1}{101 D^{1/2}\, l n\, D}\right)$ times the number of equations.

A Quantum Algorithm for Finding the Minimum

A simple quantum algorithm whicholves the minimum searching problem using O(√N) probes using the mainsubroutine of Grover’s recent quantum searching algorithm.

Quantum computation and quantum information

  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal

Expert Systems with Applications , 1993

The extended blackboard architecture is described, but focus on the satisficing cycle and its support for real-time reasoning and experimental results that confirm the predicted performance of the Satisficing cycle are presented.

Quantum Science and Technology 6

  • 045029
  • 2021