Cargando…
Scaling quantum approximate optimization on near-term hardware
The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale wi...
Autores principales: | Lotshaw, Phillip C., Nguyen, Thien, Santana, Anthony, McCaskey, Alexander, Herrman, Rebekah, Ostrowski, James, Siopsis, George, Humble, Travis S. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9300688/ https://www.ncbi.nlm.nih.gov/pubmed/35858955 http://dx.doi.org/10.1038/s41598-022-14767-w |
Ejemplares similares
-
Multi-angle quantum approximate optimization algorithm
por: Herrman, Rebekah, et al.
Publicado: (2022) -
Simulations of frustrated Ising Hamiltonians using quantum approximate optimization
por: Lotshaw, Phillip C., et al.
Publicado: (2023) -
Benchmarking Adaptive Variational Quantum Eigensolvers
por: Claudino, Daniel, et al.
Publicado: (2020) -
Validating quantum-classical programming models with tensor network simulations
por: McCaskey, Alexander, et al.
Publicado: (2018) -
Quantum Annealing for Prime Factorization
por: Jiang, Shuxian, et al.
Publicado: (2018)