Performance of Domain-Wall Encoding for Quantum Annealing

Abstract

In this paper we experimentally test the performance of the recently proposed domain-wall encoding of discrete variables from [Chancellor Quantum Sci. Technol. 4 045004] on Ising model flux qubit quantum annealers. We compare this encoding with the traditional one-hot methods and find that they outperform the one-hot encoding for three different problems at different sizes both of the problem and of the variables. From these results we conclude that the domain-wall encoding yields superior performance against a variety of metrics furthermore, we do not find a single metric by which one hot performs better. We even find that a 2000Q quantum annealer with a drastically less connected hardware graph but using the domain-wall encoding can outperform the next generation Advantage processor if that processor uses one-hot encoding.

arXiv comment16 pages, 8 figures, new analysis of binary encoding added in v2, associated data can be found at: http://doi.org/10.15128/r11j92g748d

References in corpus (28)

• Quantum Annealing in the Transverse Ising Model
• Adiabatic Quantum Computing
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
• Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
• Modernizing Quantum Annealing using Local Searches
• Adiabaticity in open quantum systems
• Domain wall encoding of discrete variables for quantum annealing and QAOA
• Circuit design for multi-body interactions in superconducting quantum annealing system with applications to a scalable architecture
• Climbing Mount Scalable: Physical-Resource Requirements for a Scalable Quantum Computer
• A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
• Driver Hamiltonians for constrained optimization in quantum annealing
• Flight Gate Assignment with a Quantum Annealer
• Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
• Quantum annealing with longitudinal bias fields
• Quantum Shuttle: Traffic Navigation with Quantum Computing
• Quantum Computing for Quantum Tunnelling
• Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
• Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods
• An energetic perspective on rapid quenches in quantum annealing
• Simulated Quantum Annealing with Two All-to-All Connectivity Schemes
• Two quantum Ising algorithms for the Shortest Vector Problem: one for now and one for later
• Testing a quantum annealer as a quantum thermal sampler
• Fluctuation guided search in quantum annealing
• Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad