In this paper, we study the potential capability of quantum annealing in solving the phase unwrapping problem, an instance of hard computational problems. To solve the phase unwrapping problem using quantum annealing, we deploy the D-Wave Advantage machine which is currently the largest available quantum annealer. The structure of this machine, however, is not compatible with our problem graph structure. Consequently, the problem graph needs to be mapped into the target (Pegasus) graph, and this minor embedding significantly affects the quality of the results. Based on our experiment and also D-Wave's reports, the lower chain lengths can result in a better performance of quantum annealing. In this paper, we propose a new minor embedding algorithm that has the lowest possible chain length for minor embedding the graph of the phase unwrapping problem onto the Pegasus graph. The obtained results using this embedding strongly outperform the results of Auto-embedding provided by the D- Wave's minorminer tool both in the quality of the solution obtained and in the length of the chain.
In this paper, we study the potential capability of quantum annealing in solving the phase unwrapping problem, an instance of hard computational problems. To solve the phase unwrapping problem using quantum annealing, we deploy the D-Wave Advantage machine which is currently the largest available quantum annealer. The structure of this machine, however, is not compatible with our problem graph structure. Consequently, the problem graph needs to be mapped into the target (Pegasus) graph, and this minor embedding significantly affects the quality of the results. Based on our experiment and also D-Wave's reports, the lower chain lengths can result in a better performance of quantum annealing. In this paper, we propose a new minor embedding algorithm that has the lowest possible chain length for minor embedding the graph of the phase unwrapping problem onto the Pegasus graph. The obtained results using this embedding strongly outperform the results of Auto-embedding provided by the D- Wave's minorminer tool both in the quality of the solution obtained and in the length of the chain.
With the current progress of quantum computing, quantum annealing is being introduced as a powerful method to solve hard computational problems. In this paper, we study the potential capability of quantum annealing in solving the phase unwrapping problem, an instance of hard computational problems. To solve the phase unwrapping problem using quantum annealing, we deploy the D-Wave Advantage machine which is currently the largest available quantum annealer. The structure of this machine, however, is not compatible with our problem graph structure. Consequently, the problem graph needs to be mapped onto the target (Pegasus) graph, and this embedding significantly affects the quality of the results. Based on our experiment and also D-Wave's reports, the lower chain lengths can result in a better performance of quantum annealing. In this paper, we propose a new embedding algorithm that has the lowest possible chain length for embedding the graph of the phase unwrapping problem onto the Pegasus graph. The obtained results using this embedding strongly outperform the results of Auto-embedding provided by D-Wave. Besides the phase unwrapping problem, this embedding can be used to embed any subset of our problem graph to the Pegasus graph.
Quantum computers and algorithms are undergoing rapid development, offering promising solutions to complex computational problems. This study focuses on harnessing the potential of quantum annealing to address the challenging phase unwrapping problem. Specifically, we employed D-Wave’s quantum annealers, currently among the most powerful in existence. To effectively utilize these systems, it is crucial to embed the problem onto their underlying structure, the Pegasus graph in the case of the D-Wave Advantage system. A shorter chain-length in the embedding process generally correlates with improved results. In the course of this thesis, we devised an algorithm for efficiently embedding the phase unwrapping problem onto the D-Wave Advantage system. Our approach yielded promising results when compared to D-Wave’s automatic embeddings. Notably, our introduced embedding boasts the minimum chain-length and utilizes the native structure of the target graph. Additionally, we leveraged D-Wave’s hybrid workflow, combining classical and quantum computing capabilities, to tackle larger image problems. Refinements to the hybrid method were implemented, resulting in enhanced performance. Experimental evaluations were conducted on actual quantum annealers, demonstrating that our refined algorithms outperform those provided by D-Wave.
Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024
Minor embedding is essential for mapping largescale combinatorial problems onto quantum annealers, particularly in quantum machine learning and optimization. This work presents an optimized, universal minor-embedding framework that efficiently accommodates complete bipartite graphs onto the hardware topology of quantum annealers. By leveraging the inherent topographical periodicity of the physical quantum adiabatic annealer processor, our method systematically reduces qubit chain lengths, resulting in enhanced stability, computational efficiency, and scalability of quantum annealing. We benchmark our embedding framework against Minorminer, the default heuristic embedding algorithm, for the Pegasus topology, demonstrating that our approach significantly improves embedding quality. Our empirical results show a 99.98% reduction in embedding time for a 120 x 120 complete bipartite graphs. Additionally, our method eliminates long qubit chains, which primarily cause decoherence and computational errors in quantum annealing. These findings advance the scalability of quantum embeddings, particularly for quantum generative models, anomaly detection, and large-scale optimization tasks. Our results establish a foundation for integrating efficient quantum-classical hybrid solutions, paving the way for practical applications in quantum-enhanced machine learning and optimization.
Quantum optimization by annealing constitutes a stochastic global search over QUBO-formulated combinatorial optimization problems. Its performance depends on pre-solving the Minor Embedding (ME) challenge—the NP-hard problem of mapping logical graphs representing QUBOs onto the quantum hardware. Despite determining solution feasibility and quality, ME remains understudied as a standalone optimization challenge. Current understanding is largely limited to synthetic graphs on isolated topologies, leaving the generalizability of structural predictors across hardware generations unclear. We conduct the first cross-topology study analyzing the MINORMINER heuristic—the de facto industry standard—over ≈550 benchmark graph instances across D-Wave’s Chimera, Pegasus, and Zephyr architectures. Our analyses reveal a functional dissociation between embedding feasibility and cost: topological independence (via Maximum Independent Set ratio) predicts feasibility by identifying structural ‘slack’, while edge density—reflecting clique-like proximity—governs the resource ‘toll’ (chain length). Since ME is a purely graph-theoretic problem, agnostic to the combinatorial origin of the source graph, these structural predictors apply to any QUBO whose logical graph falls within the studied structural regime. This dissociation remains invariant across all architectures, establishing ME as a benchmark for Evolutionary Computation, where the local distribution of edges, rather than global density alone, determines algorithmic difficulty.
Minor embedding is a required compilation step for quantum annealing, mapping logical problem graphs onto sparse hardware topologies. Despite its central role in determining solution quality, no standardized benchmark exists for comparing embedding algorithms: prior studies use incompatible graph libraries, inconsistent metrics, and non-reproducible experimental setups, making cross-algorithm comparisons unreliable. We present Ember (Embedding Minor Benchmark for Evaluative Reproducibility), an open-source benchmarking framework addressing this gap. Ember provides a standardized algorithm interface with seeded, reproducible execution infrastructure; a diverse graph library of 24,016 instances spanning structured, random, and physics-motivated problem types not previously used in embedding benchmarks; and a unified analysis pipeline supporting all three current D-Wave hardware topologies (Chimera, Pegasus, Zephyr). We evaluate five algorithms across the full library on Chimera and find that no algorithm dominates universally: rankings vary systematically with graph structure, and the best algorithm depends on the family being embedded. We also examine the effects of hardware topology (including Pegasus and Zephyr), qubit error rates, and evaluate a reinforcement-learning approach (CHARME) within a narrower test set. Ember is available at https://github.com/zachmacsmith/ember and is installable via pip install ember-qc.