Cargando…
Prime factorization using quantum variational imaginary time evolution
The road to computing on quantum devices has been accelerated by the promises that come from using Shor’s algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and lack of robust error correction schemes. Here we explore a pro...
Autores principales: | Selvarajan, Raja, Dixit, Vivek, Cui, Xingshan, Humble, Travis S., Kais, Sabre |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8531006/ https://www.ncbi.nlm.nih.gov/pubmed/34675287 http://dx.doi.org/10.1038/s41598-021-00339-x |
Ejemplares similares
-
Quantum Annealing for Prime Factorization
por: Jiang, Shuxian, et al.
Publicado: (2018) -
A Variational Ansatz
for Taylorized Imaginary Time
Evolution
por: Koch, Matthias, et al.
Publicado: (2023) -
Fragmented imaginary-time evolution for early-stage quantum signal processors
por: Silva, Thais L., et al.
Publicado: (2023) -
A quantum algorithm for evolving open quantum dynamics on quantum computing devices
por: Hu, Zixuan, et al.
Publicado: (2020) -
Quantum machine learning for electronic structure calculations
por: Xia, Rongxin, et al.
Publicado: (2018)