Efficient Clique Embedding with Faulty Hardware Components
Reference
CDMTCS Research Reports CDMTCS-567 (2022)
Degree Grantor
Abstract
In this paper, we investigate graph embeddings of large cliques into the existing D-Wave quantum architectures (Chimera, Pegasus) when physical qubits or couplers have faults. The motivation for pre-computing large clique embeddings allows for easier embeddings (without extensive classical computation) of arbitrary logical qubit interaction graphs (e.g. QUBO graphs) when performing quantum annealing on the restricted topologies of the existing D-Wave quantum architectures. To investigate the performance and scalability of existing hardware topology (Pegasus graph), we propose a method for simulating large hardware graphs with random faulty compo- nents and compare the performance of di erent embedding techniques on these graphs.
Description
DOI
Related Link
Keywords
ANZSRC 2020 Field of Research Codes
Collections
Permanent Link
Rights
Copyright: The author(s)