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 |
| _version_ | 1811320690585894912 |
|---|---|
| author | Daisuke Saida Mutsuo Hidaka Kentaro Imafuku Yuki Yamanashi |
| author_facet | Daisuke Saida Mutsuo Hidaka Kentaro Imafuku Yuki Yamanashi |
| author_sort | Daisuke Saida |
| collection | DOAJ |
| description | 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 describe a quantum annealing method for solving prime factorization. A superconducting quantum circuit with native implementation of the multiplier Hamiltonian provides combinations of M and N as a solution for number P after annealing. This circuit is robust and can be expanded easily to scale up the analysis. We present an experimental and theoretical exploration of the multiplier unit. We demonstrate the 2-bit factorization in a circuit simulation and experimentally at 10 mK. We also explain how the current conditions can be used to obtain high success probability and all candidate factorized elements. |
| first_indexed | 2024-04-13T13:03:48Z |
| format | Article |
| id | doaj.art-2760120aa6a246e5846a613ca25f7d19 |
| institution | Directory Open Access Journal |
| issn | 2045-2322 |
| language | English |
| last_indexed | 2024-04-13T13:03:48Z |
| publishDate | 2022-08-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj.art-2760120aa6a246e5846a613ca25f7d192022-12-22T02:45:51ZengNature PortfolioScientific Reports2045-23222022-08-011211810.1038/s41598-022-17867-9Factorization by quantum annealing using superconducting flux qubits implementing a multiplier HamiltonianDaisuke Saida0Mutsuo Hidaka1Kentaro Imafuku2Yuki Yamanashi3Device Research Institute, National Institute of Advanced Industrial Science and TechnologyDevice Research Institute, National Institute of Advanced Industrial Science and TechnologyDevice Research Institute, National Institute of Advanced Industrial Science and TechnologySchool of Engineering Science, Yokohama National UniversityAbstract 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 describe a quantum annealing method for solving prime factorization. A superconducting quantum circuit with native implementation of the multiplier Hamiltonian provides combinations of M and N as a solution for number P after annealing. This circuit is robust and can be expanded easily to scale up the analysis. We present an experimental and theoretical exploration of the multiplier unit. We demonstrate the 2-bit factorization in a circuit simulation and experimentally at 10 mK. We also explain how the current conditions can be used to obtain high success probability and all candidate factorized elements.https://doi.org/10.1038/s41598-022-17867-9 |
| spellingShingle | Daisuke Saida Mutsuo Hidaka Kentaro Imafuku Yuki Yamanashi Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian Scientific Reports |
| title | Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian |
| title_full | Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian |
| title_fullStr | Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian |
| title_full_unstemmed | Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian |
| title_short | Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian |
| title_sort | factorization by quantum annealing using superconducting flux qubits implementing a multiplier hamiltonian |
| url | https://doi.org/10.1038/s41598-022-17867-9 |
| work_keys_str_mv | AT daisukesaida factorizationbyquantumannealingusingsuperconductingfluxqubitsimplementingamultiplierhamiltonian AT mutsuohidaka factorizationbyquantumannealingusingsuperconductingfluxqubitsimplementingamultiplierhamiltonian AT kentaroimafuku factorizationbyquantumannealingusingsuperconductingfluxqubitsimplementingamultiplierhamiltonian AT yukiyamanashi factorizationbyquantumannealingusingsuperconductingfluxqubitsimplementingamultiplierhamiltonian |