Understanding domain-wall encoding theoretically and experimentally

Abstract

We analyze the method of encoding pairwise interactions of higher-than-binary discrete variables (these models are sometimes referred to as discrete quadratic models) into binary variables based on domain walls on one dimensional Ising chains. We discuss how this is relevant to quantum annealing, but also many gate model algorithms such as VQE and QAOA. We theoretically show that for problems of practical interest for quantum computing and assuming only quadratic interactions are available between the binary variables, it is not possible to have a more efficient general encoding in terms of number of binary variables per discrete variable. We furthermore use a D-Wave Advantage 1.1 flux qubit quantum annealing computer to show that the dynamics effectively freeze later for a domain-wall encoding compared to a traditional one-hot encoding. This second result could help explain the dramatic performance improvement of domain wall over one hot which has been seen in a recent experiment on D-Wave hardware. This is an important result because usually problem encoding and the underlying physics are considered separately, our work suggests that considering them together may be a more useful paradigm. We argue that this experimental result is also likely to carry over to a number of other settings, we discuss how this has implications for gate-model and quantum-inspired algorithms.

15 pages, 16 figures, typo in metadata fixed in v2, referee requested changes in v3, accepted in Royal Society Philosophical Transactions A, current version matches author accepted manuscript

References in corpus (6)

• A Quantum Approximate Optimization Algorithm
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
• Consistency Tests of Classical and Quantum Models for a Quantum Annealer
• Error mitigation for variational quantum algorithms through mid-circuit measurements
• Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs

Cited by in corpus (11)

• NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
• Encoding-Independent Optimization Problem Formulation for Quantum Computing
• Quantum algorithms for scientific computing
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• Dual-Matrix Domain-Wall: A Novel Technique for Generating Permutations by QUBO and Ising Models with Quadratic Sizes
• Quantum optimization with linear Ising penalty functions for customer data science
• Mapping State Transition Susceptibility in Quantum Annealing
• Multi-disk clutch optimization using quantum annealing
• Quantum Software Ecosystem Design
• Variational simulation of higher-spin systems on qubit-based quantum simulators
• Quantum annealing and condensed matter physics