Cited 1 time in
Quantum computation by cooling
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Cho, Jaeyoon | - |
| dc.date.accessioned | 2024-07-17T08:00:15Z | - |
| dc.date.available | 2024-07-17T08:00:15Z | - |
| dc.date.issued | 2024-09 | - |
| dc.identifier.issn | 0374-4884 | - |
| dc.identifier.issn | 1976-8524 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/71245 | - |
| dc.description.abstract | Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an intricate many-body Hamiltonian makes its analysis daunting. While it is plausible to directly cool the final gapped system of the adiabatic evolution instead, the analysis of such a scheme on a general ground is missing. Here, we propose a specific Hamiltonian model for this purpose. The scheme is inspired by cavity cooling, involving the emulation of a zero-temperature reservoir. Repeated discarding of ancilla reservoir qubits extracts the entropy of the system, driving the system toward its ground state. At the same time, the measurement of the discarded qubits hints at the energy-level structure of the system as a return. We show that quantum computation based on this cooling procedure is equivalent in its computational power to the one based on quantum circuits. We then exemplify the scheme with a few illustrative use cases for combinatorial optimization problems. To circumvent the issue of local energy minima, we implant a mechanism in the Hamiltonian that allows the population trapped in the local minima to tunnel out via high-order transitions, and support the idea with numerical simulations. We also discuss its application to preparing quantum many-body ground states, arguing that the spectral gap is a crucial factor in determining the time scale of the cooling. © The Korean Physical Society 2024. | - |
| dc.format.extent | 9 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Korean Physical Society | - |
| dc.title | Quantum computation by cooling | - |
| dc.title.alternative | Quantum computation by cooling | - |
| dc.type | Article | - |
| dc.publisher.location | 대한민국 | - |
| dc.identifier.doi | 10.1007/s40042-024-01137-0 | - |
| dc.identifier.scopusid | 2-s2.0-85198109899 | - |
| dc.identifier.wosid | 001268343900002 | - |
| dc.identifier.bibliographicCitation | Journal of the Korean Physical Society, v.85, no.5, pp 397 - 405 | - |
| dc.citation.title | Journal of the Korean Physical Society | - |
| dc.citation.volume | 85 | - |
| dc.citation.number | 5 | - |
| dc.citation.startPage | 397 | - |
| dc.citation.endPage | 405 | - |
| dc.type.docType | Article | - |
| dc.identifier.kciid | ART003116817 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.description.journalRegisteredClass | kci | - |
| dc.relation.journalResearchArea | Physics | - |
| dc.relation.journalWebOfScienceCategory | Physics, Multidisciplinary | - |
| dc.subject.keywordPlus | EXPONENTIAL DECAY | - |
| dc.subject.keywordPlus | ALGORITHM | - |
| dc.subject.keywordPlus | EIGENSOLVER | - |
| dc.subject.keywordPlus | COMPLEXITY | - |
| dc.subject.keywordPlus | BOUNDS | - |
| dc.subject.keywordAuthor | Adiabatic quantum computation | - |
| dc.subject.keywordAuthor | Cavity cooling | - |
| dc.subject.keywordAuthor | Combinatorial optimization | - |
| dc.subject.keywordAuthor | Quantum algorithm | - |
| dc.subject.keywordAuthor | Quantum computation | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
