Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF
<p>We benchmark Quantum Annealing (QA) vs. Simulated Annealing (SA) with a focus on the impact of the embedding of problems onto the different topologies of the D-Wave quantum annealers. The series of problems we study are especially designed instances of the maximum cardinality matching probl...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | , , , , |
| Publicado em: |
2025
|
| Assuntos: | |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
| _version_ | 1849927644248801280 |
|---|---|
| author | Daniel Vert (18769933) |
| author2 | Madita Willsch (8804063) Berat Yenilen (18769936) Renaud Sirdey (18769939) Stéphane Louise (18769942) Kristel Michielsen (8804069) |
| author2_role | author author author author author |
| author_facet | Daniel Vert (18769933) Madita Willsch (8804063) Berat Yenilen (18769936) Renaud Sirdey (18769939) Stéphane Louise (18769942) Kristel Michielsen (8804069) |
| author_role | author |
| dc.creator.none.fl_str_mv | Daniel Vert (18769933) Madita Willsch (8804063) Berat Yenilen (18769936) Renaud Sirdey (18769939) Stéphane Louise (18769942) Kristel Michielsen (8804069) |
| dc.date.none.fl_str_mv | 2025-11-24T17:12:23Z |
| dc.identifier.none.fl_str_mv | 10.3389/fcomp.2024.1286057.s001 |
| dc.relation.none.fl_str_mv | https://figshare.com/articles/dataset/Data_Sheet_1_Benchmarking_quantum_annealing_with_maximum_cardinality_matching_problems_PDF/30696062 |
| dc.rights.none.fl_str_mv | CC BY 4.0 info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Theoretical Computer Science Applied Computer Science Quantum Information, Computation and Communication Information and Computing Sciences not elsewhere classified Computer Vision Computer System Architecture Computer System Security quantum annealing simulated annealing benchmarking maximum cardinality matching problem minor embedding |
| dc.title.none.fl_str_mv | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF |
| dc.type.none.fl_str_mv | Dataset info:eu-repo/semantics/publishedVersion dataset |
| description | <p>We benchmark Quantum Annealing (QA) vs. Simulated Annealing (SA) with a focus on the impact of the embedding of problems onto the different topologies of the D-Wave quantum annealers. The series of problems we study are especially designed instances of the maximum cardinality matching problem that are easy to solve classically but difficult for SA and, as found experimentally, not easy for QA either. In addition to using several D-Wave processors, we simulate the QA process by numerically solving the time-dependent Schrödinger equation. We find that the embedded problems can be significantly more difficult than the unembedded problems, and some parameters, such as the chain strength, can be very impactful for finding the optimal solution. Thus, finding a good embedding and optimal parameter values can improve the results considerably. Interestingly, we find that although SA succeeds for the unembedded problems, the SA results obtained for the embedded version scale quite poorly in comparison with what we can achieve on the D-Wave quantum annealers.</p> |
| eu_rights_str_mv | openAccess |
| id | Manara_66d48f50b5d2919245a1736dfb1630bf |
| identifier_str_mv | 10.3389/fcomp.2024.1286057.s001 |
| network_acronym_str | Manara |
| network_name_str | ManaraRepo |
| oai_identifier_str | oai:figshare.com:article/30696062 |
| publishDate | 2025 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| rights_invalid_str_mv | CC BY 4.0 |
| spelling | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDFDaniel Vert (18769933)Madita Willsch (8804063)Berat Yenilen (18769936)Renaud Sirdey (18769939)Stéphane Louise (18769942)Kristel Michielsen (8804069)Theoretical Computer ScienceApplied Computer ScienceQuantum Information, Computation and CommunicationInformation and Computing Sciences not elsewhere classifiedComputer VisionComputer System ArchitectureComputer System Securityquantum annealingsimulated annealingbenchmarkingmaximum cardinality matching problemminor embedding<p>We benchmark Quantum Annealing (QA) vs. Simulated Annealing (SA) with a focus on the impact of the embedding of problems onto the different topologies of the D-Wave quantum annealers. The series of problems we study are especially designed instances of the maximum cardinality matching problem that are easy to solve classically but difficult for SA and, as found experimentally, not easy for QA either. In addition to using several D-Wave processors, we simulate the QA process by numerically solving the time-dependent Schrödinger equation. We find that the embedded problems can be significantly more difficult than the unembedded problems, and some parameters, such as the chain strength, can be very impactful for finding the optimal solution. Thus, finding a good embedding and optimal parameter values can improve the results considerably. Interestingly, we find that although SA succeeds for the unembedded problems, the SA results obtained for the embedded version scale quite poorly in comparison with what we can achieve on the D-Wave quantum annealers.</p>2025-11-24T17:12:23ZDatasetinfo:eu-repo/semantics/publishedVersiondataset10.3389/fcomp.2024.1286057.s001https://figshare.com/articles/dataset/Data_Sheet_1_Benchmarking_quantum_annealing_with_maximum_cardinality_matching_problems_PDF/30696062CC BY 4.0info:eu-repo/semantics/openAccessoai:figshare.com:article/306960622025-11-24T17:12:23Z |
| spellingShingle | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF Daniel Vert (18769933) Theoretical Computer Science Applied Computer Science Quantum Information, Computation and Communication Information and Computing Sciences not elsewhere classified Computer Vision Computer System Architecture Computer System Security quantum annealing simulated annealing benchmarking maximum cardinality matching problem minor embedding |
| status_str | publishedVersion |
| title | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF |
| title_full | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF |
| title_fullStr | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF |
| title_full_unstemmed | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF |
| title_short | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF |
| title_sort | Data_Sheet_1_Benchmarking quantum annealing with maximum cardinality matching problems.PDF |
| topic | Theoretical Computer Science Applied Computer Science Quantum Information, Computation and Communication Information and Computing Sciences not elsewhere classified Computer Vision Computer System Architecture Computer System Security quantum annealing simulated annealing benchmarking maximum cardinality matching problem minor embedding |