Results 21 to 30 of about 3,959 (191)
QAOA-in-QAOA: Solving Large-Scale MaxCut Problems on Small Quantum Machines
Physical Review Applied, 2023 The design of fast algorithms for combinatorial optimization greatly contributes to a plethora of domains such as logistics, finance, and chemistry. Quantum approximate optimization algorithms (QAOAs), which utilize the power of quantum machines and inherit the spirit of adiabatic evolution, are novel approaches to tackle combinatorial problems with ...
Zeqiao Zhou +3 more
openaire +2 more sources
The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size [PDF]
Quantum, 2022 The Quantum Approximate Optimization Algorithm (QAOA) is a general-purpose algorithm for combinatorial optimization problems whose performance can only improve with the number of layers $p$.
Edward Farhi +3 more
doaj +1 more source
Reachability Deficits in Quantum Approximate Optimization of Graph Problems [PDF]
Quantum, 2021 The quantum approximate optimization algorithm (QAOA) has become a cornerstone of contemporary quantum applications development. Here we show that the $density$ of problem constraints versus problem variables acts as a performance indicator.
V. Akshay +3 more
doaj +1 more source
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices [PDF]
, 2020 We present a collection of optimizers tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate ...
De Jong, W +4 more
core +2 more sources
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
Physical Review Research, 2023 The quantum approximate optimization algorithm (QAOA) is a promising method for solving certain classical combinatorial optimization problems on near-term quantum devices. When employing the QAOA to 3-SAT and Max-3-SAT problems, the quantum cost exhibits
Yunlong Yu +4 more
doaj +1 more source
Graph neural network initialisation of quantum approximate optimisation [PDF]
Quantum, 2022 Approximate combinatorial optimisation has emerged as one of the most promising application areas for quantum computers, particularly those in the near term.
Nishant Jain +3 more
doaj +1 more source
QAOA on Hamiltonian Cycle problem
CoRR, 2023 I use QAOA to solve the Hamiltonian Circle problem. First, inspired by Lucas, I define the QUBO form of Hamiltonian Cycle and transform it to a quantum circuit by embedding the problem of $n$ vertices to an encoding of $(n-1)^2$ qubits. Then, I calcluate the spectrum of the cost hamiltonian for both triangle case and square case and justify my ...
openaire +2 more sources
Alignment between initial state and mixer improves QAOA performance for constrained optimization
npj Quantum Information, 2023 Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent the lessons from the adiabatic regime apply to QAOA as executed in ...
Zichang He +6 more
doaj +1 more source
, 2022 We introduce OpenQAOA, a Python open-source multi-backend Software Development Kit to create, customise, and execute the Quantum Approximate Optimisation Algorithm (QAOA) on Noisy Intermediate-Scale Quantum (NISQ) devices and simulators. OpenQAOA facilitates the creation of QAOA workflows, removing the more tedious and repetitive aspects of ...
Sharma, Vishal +6 more
openaire +2 more sources
Pitfalls of the Sublinear QAOA-Based Factorization Algorithm
IEEE Access, 2023 Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However, the implementation of Shor's quantum factorization algorithm requires significant resources scaling linearly with the number size; taking into account an overhead that is ...
Sergey V. Grebnev +6 more
openaire +3 more sources