Cargando…
Quantum Annealing for Prime Factorization
We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses [Formul...
Autores principales: | Jiang, Shuxian, Britt, Keith A., McCaskey, Alexander J., Humble, Travis S., Kais, Sabre |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6281593/ https://www.ncbi.nlm.nih.gov/pubmed/30518780 http://dx.doi.org/10.1038/s41598-018-36058-z |
Ejemplares similares
-
Prime factorization using quantum variational imaginary time evolution
por: Selvarajan, Raja, et al.
Publicado: (2021) -
Solving Set Cover with Pairs Problem using Quantum Annealing
por: Cao, Yudong, et al.
Publicado: (2016) -
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) -
Scaling quantum approximate optimization on near-term hardware
por: Lotshaw, Phillip C., et al.
Publicado: (2022)