Results 41 to 50 of about 3,959 (191)
Instance Independence of Single Layer Quantum Approximate Optimization Algorithm on Mixed-Spin Models at Infinite Size [PDF]
Quantum, 2021 This paper studies the application of the Quantum Approximate Optimization Algorithm (QAOA) to spin-glass models with random multi-body couplings in the limit of a large number of spins. We show that for such mixed-spin models the performance of depth $1$
Jahan Claes, Wim van Dam
doaj +1 more source
Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models [PDF]
QuantumThe parity mapping provides a geometrically local encoding of the Quantum Approximate Optimization Algorithm (QAOA), at the expense of having a quadratic qubit overhead for all-to-all connected problems. In this work, we benchmark the parity-encoded QAOA
Elisabeth Wybo, Martin Leib
doaj +1 more source
qTorch: The Quantum Tensor Contraction Handler
, 2018 Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests.
Aspuru-Guzik, Alán +5 more
core +2 more sources
Parameter Setting in Quantum Approximate Optimization of Weighted Problems [PDF]
QuantumQuantum Approximate Optimization Algorithm (QAOA) is a leading candidate algorithm for solving combinatorial optimization problems on quantum computers. However, in many cases QAOA requires computationally intensive parameter optimization.
Shree Hari Sureshbabu +6 more
doaj +1 more source
Natural evolution strategies and variational Monte Carlo
, 2020 A notion of quantum natural evolution strategies is introduced, which provides a geometric synthesis of a number of known quantum/classical algorithms for performing classical black-box optimization. Recent work of Gomes et al.
Carleo, Giuseppe +3 more
core +1 more source
Hamiltonian-Oriented Homotopy QAOA
, 2023 The classical homotopy optimization approach has the potential to deal with highly nonlinear landscape, such as the energy landscape of QAOA problems. Following this motivation, we introduce Hamiltonian-Oriented Homotopy QAOA (HOHo-QAOA), that is a heuristic method for combinatorial optimization using QAOA, based on classical homotopy optimization. The
Kundu, Akash +2 more
openaire +2 more sources
Network Community Detection On Small Quantum Computers
, 2019 In recent years a number of quantum computing devices with small numbers of qubits became available. We present a hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size.
Alexeev, Yuri +4 more
core +1 more source
Multi-angle quantum approximate optimization algorithm
Scientific Reports, 2022 The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution.
Rebekah Herrman +4 more
doaj +1 more source
Quantum approximate optimization for hard problems in linear algebra
SciPost Physics Core, 2021 The quantum approximate optimization algorithm (QAOA) by Farhi et al. is a quantum computational framework for solving quantum or classical optimization tasks.
Ajinkya Borle, Vincent E. Elfving, Samuel J. Lomonaco
doaj +1 more source
Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
, 2019 Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and 2-qubit (quantum
Chong, Fred T. +6 more
core +1 more source