Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 40 for “"QAOA"”.

  1. QAOA applied to the portfolio optimization problem

    … prominence and, among them, there is one called QAOA (quantum approximate optimization algorithm). As the name suggests, this is a quantum algorithm that approximates the solution of optimization problems. The objective of this work was to apply this algorithm to solve an optimization problem in …

    brazil-ufrn Repository record for QAOA applied to the portfolio optimization problem (opens in a new tab)

  2. Kombinatorinių problemų sprendimas naudojant QAOA ir IBM Qiskit /

    … the Quantum Approximate Optimization Algorithm (QAOA) for solving combinatorial optimization problems, such as the Traveling Salesman Problem (TSP) and Max-Cut, using IBM Qiskit. The study mainly focuses on the following aspects: evaluating the solution quality obtained by running the QAOA …

    vilnius Repository record for Kombinatorinių problemų sprendimas naudojant QAOA ir IBM Qiskit / (opens in a new tab)

  3. Max-Cut QAOA Cost Hamiltonian Compilation for Unweighted Graphs Using Minimum Global Controls and Qubit Bit Flips

    … with the hybrid quantum-classical algorithm, QAOA, for the max-cut problem on trapped-ion quantum computers. As opposed to the standard $CNOT$ and $R_z$ gate compilation of the cost Hamiltonian for QAOA, here the goal is to compile it to global coupling operations and individual qubit bit …

    rice Repository record for Max-Cut QAOA Cost Hamiltonian Compilation for Unweighted Graphs Using Minimum Global Controls and Qubit Bit Flips (opens in a new tab)

  4. Classical Optimization to Improve Variational Quantum Algorithms

    … Quantum Approximate Optimization Algorithm (QAOA) to obtain solutions to NP-hard problems, and showed that this algorithm converges to the optimal solutions under the adiabatic limit, or in other words, when the circuit depth of QAOA goes to infinity. One way to demonstrate quantum advantage …

    gatech Repository record for Classical Optimization to Improve Variational Quantum Algorithms (opens in a new tab)

  5. Parameter setting strategies in multi-angle quantum approximate optimization algorithm

    … like Quantum Approximate Optimization Algorithm (QAOA) offer a promising avenue to solve these problems on near-term quantum computers. The QAOA prepares a parameterized quantum state by alternating two sets of unitaries, one encoding the problem cost and one mixing between candidate solutions, …

    chalmers Repository record for Parameter setting strategies in multi-angle quantum approximate optimization algorithm (opens in a new tab)

  6. Techniques and Applications of the Quantum Approximate Optimization Algorithm

    The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm that has been shown to be effective at solving combinatorial optimization problems. While QAOA performs well at these problems, new methods of improving the performance of the algorithm are still being …

    utk-theses Repository record for Techniques and Applications of the Quantum Approximate Optimization Algorithm (opens in a new tab)

  7. QIOA: Quantum Inspired Optimisation Algorithm

    … Optimisation Algorithm, also known as QAOA [2], is one such hybrid algorithm designed to solve optimisation problems. In this thesis, we study the QAOA using the framework of tensor networks and matrix product states (MPS). We make approximations on the quantum aspects of QAOA by …

    chalmers Repository record for QIOA: Quantum Inspired Optimisation Algorithm (opens in a new tab)

  8. Förbättring av en kvanthybridalgoritm applicerad på proteinveckningsproblemet

    … kvantmekanisk approximativ optimeringsalgoritm (QAOA, Quantum Approximate Optimization Algorithm) på proteinveckningsproblemet. Den undersökta förbättringen kallas Conditional Value at Risk (CVaR), och jämförs med konventionell QAOA för att se om den har några fördelar. Testerna av algoritmen …

    chalmers Repository record for Förbättring av en kvanthybridalgoritm applicerad på proteinveckningsproblemet (opens in a new tab)

  9. Quantum algorithms for combinatorial optimization

    … the Quantum Approximate Optimization Algorithm (QAOA) consisting of a problem and a mixer Hamiltonian with freely selectable parameters, originally proposed as variational hybrid ansatz with classical optimization. This algorithm structure of- fers flexible and relatively shallow circuits, which …

    freiburg-diss Repository record for Quantum algorithms for combinatorial optimization (opens in a new tab)

  10. Quantum Optimization of Physician Scheduling For Maximal Healthcare Capacity

    … the Quantum Approximate Optimization Algorithm (QAOA), as a novel approach to solving the Physician Scheduling Problem (PSP), a known combinatorial optimization task. Classical methods, Mixed Integer Linear Programming (MILP) with Gurobi and Satisfiability Modulo Theories (SMT) with Z3, are …

    chalmers Repository record for Quantum Optimization of Physician Scheduling For Maximal Healthcare Capacity (opens in a new tab)

  11. Using Error-Correcting Codes to Encode Colors in the Graph Community Detection Problem

    … the Quantum Approximate Optimization Algorithm (QAOA). A critical design choice in any QAOA formulation is how community membership is encoded in qubits. The studied approach, one-hot encoding, assigns K qubits per node for K communities, but suffers from high qubit overhead, complex constraint …

    mcmaster Repository record for Using Error-Correcting Codes to Encode Colors in the Graph Community Detection Problem (opens in a new tab)

  12. A quantum heuristic for the school timetabling problem

    … do Quantum Approximate Optimization Algorithm (QAOA) para a solução do problema do número cromático é usado para resolver as restrições fortes e no segundo passo o processo de otimização clássico do QAOA é usado para solucionar as restrições fracas. A heurística foi testada em instâncias de …

    brazil-ufsc Repository record for A quantum heuristic for the school timetabling problem (opens in a new tab)

  13. Quantum approximate optimization using SWAP gates for mixing

    … be used is the quantum approximation algorithm(QAOA). QAOA applies two different types of operators to a qubit string representing an initial state. One regulates the problem to be optimized and the other mixes the states such that all possible solutions to the problem are being tested. My work …

    chalmers Repository record for Quantum approximate optimization using SWAP gates for mixing (opens in a new tab)

  14. Exploring trade-offs in quantum optimization with noisy qutrits

    … the Quantum Approximate Optimization Algorithm (QAOA), to solve graph three colouring, an NP-complete problem with applications in scheduling, using both qubits and qutrits, three-dimensional quantum states. Qutrits efficiently encode the three colouring problem, and we find that the qutrit QAOA …

    ubc Repository record for Exploring trade-offs in quantum optimization with noisy qutrits (opens in a new tab) Download PDF for Exploring trade-offs in quantum optimization with noisy qutrits (opens in a new tab)

  15. Design and Optimization in Near-term Quantum Computation

    … the quantum approximate optimization algorithm (QAOA), are studied for the difference in their control strategies. We show that on certain crafted problem instances, bang-bang control (QAOA) can be as much as exponentially faster than quasistatic control (QAO). Next, we demonstrate the …

    maryland Repository record for Design and Optimization in Near-term Quantum Computation (opens in a new tab)

  16. Quantum applications of optimization, AI, and respective algorithmic performance enhancements

    … Quantum Approximate Optimization Algorithm (QAOA) ausschöpft. Anschließend stellen wir ein problemagnostisches Designkonzept für parametrisierte Quantenschaltkreise vor, das besonders parametereffizient ist und dadurch Beschleunigungen beim Parametertraining ermöglicht. Für nicht-lokale …

    lmu-germany Repository record for Quantum applications of optimization, AI, and respective algorithmic performance enhancements (opens in a new tab)

  17. Flexible integration of classical and quantum techniques in the evolutionary path to quantum utility

    … The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical approach for tackling these challenging problems that are encoded using quadratic and higher-order unconstrained binary optimization problems (QUBO and HUBO). QAOA alternates between two operators: a …

    uvic Repository record for Flexible integration of classical and quantum techniques in the evolutionary path to quantum utility (opens in a new tab)

  18. QUANTUM COMBINATORIAL OPTIMIZATION ALGORITHMS FOR PACKING PROBLEMS IN CLASSICAL COMPUTING AND NETWORKING

    … MONTE-CARLO METHODS FOR MAX-CUT APPROXIMATION: QAOA IS NOT OPTIMAL:One of the leading candidates for near-term quantum advantage is the class of Variational Quantum Algorithms. However, these algorithms suffer from classical difficulty in optimizing the variational parameters as the number of …

    maryland Repository record for QUANTUM COMBINATORIAL OPTIMIZATION ALGORITHMS FOR PACKING PROBLEMS IN CLASSICAL COMPUTING AND NETWORKING (opens in a new tab)

  19. Analog and digital adiabatic quantum annealing with oscillating transverse fields

    … and Quantum Approximate Optimization Algorithm (QAOA). Digitized-QA can be applied to full-scale, fault-tolerant quantum algorithms. We apply the digitized version of RFQA and QA to various trial problems using classical numerical simulation and show that digitized-RFQA is a potentially promising …

    colo-mines Repository record for Analog and digital adiabatic quantum annealing with oscillating transverse fields (opens in a new tab)

  20. QUANTUM SIMULATION OF OPEN SYSTEMS AND COMBINATORIAL OPTIMIZATION

    … In the second project, we analytically study the QAOA and its variants for a single and multiple layers, and propose a unified framework which subsumes several existing variants. These analytical results could be useful to analyze optimization problems on different types of graphs.

    nus Repository record for QUANTUM SIMULATION OF OPEN SYSTEMS AND COMBINATORIAL OPTIMIZATION (opens in a new tab) Download file for QUANTUM SIMULATION OF OPEN SYSTEMS AND COMBINATORIAL OPTIMIZATION (opens in a new tab)

Page 1 of 2