Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian
Abstract Prime factorization (P = M × N) is a promising application for quantum computing. Shor’s algorithm is a key concept for breaking the limit for analyzing P, which cannot be effectively solved by classical computation; however, the algorithm requires error-correctable logical qubits. Here, we...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2022-08-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-022-17867-9 |