Results 81 to 90 of about 2,321 (167)
Physical Review ResearchQuantum computers are increasing in size and quality but are still very noisy. Error mitigation extends the size of the quantum circuits that noisy devices can meaningfully execute. However, state-of-the-art error mitigation methods are hard to implement
Stefan H. Sack, Daniel J. Egger
doaj +1 more source
Quantum optimization with a novel Gibbs objective function and ansatz architecture search
Physical Review Research, 2020 The quantum approximate optimization algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a prescription for ...
Li Li (李力) +4 more
doaj +1 more source
The BHT-QAOA is a hybrid classical-quantum algorithm that solves arbitrary classical Boolean problems as Hamiltonians in the quantum domain, using the quantum approximate optimization algorithm (QAOA) [1]. The BHT-QAOA stands for the "Boolean-Hamiltonians Transform for QAOA" [2].
Ali Al-Bayaty, Marek Perkowski
openaire +1 more source
Quantum Approximate Optimization with Hard and Soft Constraints [PDF]
Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics ...
Biswas, Rupak +5 more
core +1 more source
The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View [PDF]
Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian,
Hadfield, Stuart +3 more
core +1 more source
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
PRX QuantumOne of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses of the complexity of standard quantum algorithms have suggested that outperforming classical ...
Sami Boulebnane, Ashley Montanaro
doaj +1 more source
A Comparative Study on Solving Optimization Problems With Exponentially Fewer Qubits
IEEE Transactions on Quantum EngineeringVariational quantum optimization algorithms, such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA), are among the most studied quantum algorithms.
David Winderl +2 more
doaj +1 more source
Temporal Planning for Compilation of Quantum Approximate Optimization Algorithm Circuits [PDF]
We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA ...
Do, Minh Binh +3 more
core +1 more source
IEEE AccessThe Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for solving combinatorial optimization problems on near-term quantum hardware.
Kimchhor Chiv +5 more
doaj +1 more source