Results 21 to 30 of about 548 (174)
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 +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
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
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
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 +3 more sources
JuliQAOA: Fast, Flexible QAOA Simulation
We introduce JuliQAOA, a simulation package specifically built for the Quantum Alternating Operator Ansatz (QAOA). JuliQAOA does not require a circuit-level description of QAOA problems, or another package to simulate such circuits, instead relying on a more direct linear algebra implementation.
John Golden 0001 +4 more
openaire +2 more sources
Mean-Field Approximate Optimization Algorithm
The quantum approximate optimization algorithm (QAOA) is suggested as a promising application on early quantum computers. Here a quantum-inspired classical algorithm, the mean-field approximate optimization algorithm (mean-field AOA), is developed by ...
Aditi Misra-Spieldenner +5 more
doaj +1 more source
Reinforcement learning assisted recursive QAOA. [PDF]
AbstractIn recent years, variational quantum algorithms such as the Quantum Approximation Optimization Algorithm (QAOA) have gained popularity as they provide the hope of using NISQ devices to tackle hard combinatorial optimization problems. It is, however, known that at low depth, certain locality constraints of QAOA limit its performance.
Patel YJ, Jerbi S, Bäck T, Dunjko V.
europepmc +6 more sources
The QAOA with Few Measurements
The Quantum Approximate Optimization Algorithm (QAOA) was originally developed to solve combinatorial optimization problems, but has become a standard for assessing the performance of quantum computers. Fully descriptive benchmarking techniques are often prohibitively expensive for large numbers of qubits ($n \gtrsim 10$), so the QAOA often serves in ...
Polloreno, Anthony M., Smith, Graeme
openaire +2 more sources
Digitized-counterdiabatic quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum systems.
P. Chandarana +6 more
doaj +1 more source

