Results 21 to 30 of about 605 (179)
The variational preparation of complex quantum states using the quantum approximate optimization algorithm (QAOA) is of fundamental interest, and becomes a promising application of quantum computers.
Zheng-Hang Sun +3 more
doaj +1 more source
Performance analysis of multi-angle QAOA for p > 1. [PDF]
In this paper we consider the scalability of multi-angle QAOA with respect to the number of QAOA layers. We found that MA-QAOA is able to significantly reduce the depth of QAOA circuits, by a factor of up to 4 for the considered data sets.
Gaidai I, Herrman R.
europepmc +2 more sources
Alignment between initial state and mixer improves QAOA performance for constrained optimization
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
Benchmarking the performance of portfolio optimization with QAOA
Abstract We present a detailed study of portfolio optimization using different versions of the quantum approximate optimization algorithm (QAOA). For a given list of assets, the portfolio optimization problem is formulated as quadratic binary optimization constrained on the number of assets contained in the portfolio.
Sebastian Brandhofer +8 more
openaire +4 more sources
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
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
QAOA on Hamiltonian Cycle problem
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 +3 more sources
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
Reachability Deficits in Quantum Approximate Optimization of Graph Problems [PDF]
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
Pitfalls of the Sublinear QAOA-Based Factorization Algorithm
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 +4 more sources
Quantum computational phase transition in combinatorial problems
Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers.
Bingzhi Zhang, Akira Sone, Quntao Zhuang
doaj +1 more source

