Finding Maximum Cliques on a Quantum Annealer-Reference-Cited by-同舟云学术

Finding Maximum Cliques on a Quantum Annealer

Published:2017-05-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Computing Frontiers Conference
language:
Short-container-title:

Author:

Chapuis Guillaume¹,Djidjev Hristo¹,Hahn Georg²,Rizk Guillaume³

Affiliation:

1. Los Alamos National Laboratory, Los Alamos, NM

2. Imperial College London, South Kensington Campus, London, U.K.

3. INRJA/Irisa, Campus de Beaulieu, Rennes Cedex, France

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3075564.3075575

Reference15 articles.

1. Finding a Maximum Clique in an Arbitrary Graph

2. V. Batagelj and M. Zaversnik. 2011. An O(m) Algorithm for Cores Decomposition of Networks. Adv Dat An Class 5 2 (2011). V. Batagelj and M. Zaversnik. 2011. An O(m) Algorithm for Cores Decomposition of Networks. Adv Dat An Class 5 2 (2011).

3. Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor

4. D-Wave. 2016. D-Wave post-processing guide. (2016). D-Wave. 2016. D-Wave post-processing guide. (2016).

5. D-Wave. 2016. Introduction to the D-Wave Quantum Hardware. (2016). D-Wave. 2016. Introduction to the D-Wave Quantum Hardware. (2016).

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks;iScience;2024-02

2. Adaptive Sampling Noise Mitigation Technique for Feedback-Based Quantum Algorithms;Lecture Notes in Computer Science;2024

3. Incentivizing Demand-Side Response Through Discount Scheduling Using Hybrid Quantum Optimization;IEEE Transactions on Quantum Engineering;2024

4. Solving larger maximum clique problems using parallel quantum annealing;Quantum Information Processing;2023-05-16

5. A reduction from an LWE problem to maximum independent set problems;Scientific Reports;2023-05-02