Zobrazeno 1 - 10
of 7 682
pro vyhledávání: '"Golden, John"'
Publikováno v:
21st ACM International Conference on Computing Frontiers CF'24, pages 199-206, May 2024
The Quantum Alternating Operator Ansatz (QAOA) is a prominent variational quantum algorithm for solving combinatorial optimization problems. Its effectiveness depends on identifying input parameters that yield high-quality solutions. However, underst
Externí odkaz:
http://arxiv.org/abs/2402.10188
Autor:
Keller, Christo Meriwether, Eidenbenz, Stephan, Bärtschi, Andreas, O'Malley, Daniel, Golden, John, Misra, Satyajayant
Publikováno v:
ISC High Performance 2024 Research Paper Proceedings (39th International Conference), 2024
Quantum computing is an emerging topic in engineering that promises to enhance supercomputing using fundamental physics. In the near term, the best candidate algorithms for achieving this advantage are variational quantum algorithms (VQAs). We design
Externí odkaz:
http://arxiv.org/abs/2312.15048
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 o
Externí odkaz:
http://arxiv.org/abs/2312.06451
Publikováno v:
npj Quantum Information 2024
We show through numerical simulation that the Quantum Approximate Optimization Algorithm (QAOA) for higher-order, random-coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from $16$ up to
Externí odkaz:
http://arxiv.org/abs/2312.00997
Quantum algorithms provide an exponential speedup for solving certain classes of linear systems, including those that model geologic fracture flow. However, this revolutionary gain in efficiency does not come without difficulty. Quantum algorithms re
Externí odkaz:
http://arxiv.org/abs/2310.02479
Autor:
Benchasattabuse, Naphan, Bärtschi, Andreas, García-Pintos, Luis Pedro, Golden, John, Lemons, Nathan, Eidenbenz, Stephan
The quantum alternating operator ansatz (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as Maximum Satisfiability. While QAOA is well-studied, theore
Externí odkaz:
http://arxiv.org/abs/2308.15442
The Quantum Alternating Operator Ansatz (QAOA) is a hybrid classical-quantum algorithm that aims to sample the optimal solution(s) of discrete combinatorial optimization problems. We present optimized QAOA circuit constructions for sampling MAX $k$-S
Externí odkaz:
http://arxiv.org/abs/2306.03238
Publikováno v:
IEEE International Conference on Quantum Computing and Engineering (QCE), 2023, pp. 307-312
We comparatively study, through large-scale numerical simulation, the performance across a large set of Quantum Alternating Operator Ansatz (QAOA) implementations for finding approximate and optimum solutions to unconstrained combinatorial optimizati
Externí odkaz:
http://arxiv.org/abs/2301.11292
Autor:
Henderson, Jessie M., Podzorova, Marianna, Cerezo, M., Golden, John K., Gleyzer, Leonard, Viswanathan, Hari S., O'Malley, Daniel
Publikováno v:
Sci Rep 13, 2906 (2023)
Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approac
Externí odkaz:
http://arxiv.org/abs/2210.11685
Modeling hydrological fracture networks is a hallmark challenge in computational earth sciences. Accurately predicting critical features of fracture systems, e.g. percolation, can require solving large linear systems far beyond current or future high
Externí odkaz:
http://arxiv.org/abs/2205.06379