Performance of Domain-Wall Encoding for Quantum Annealing

• URL: http://arxiv.org/abs/2102.12224v2
• Date: Sat, 12 Jun 2021 11:03:13 GMT
• Title: Performance of Domain-Wall Encoding for Quantum Annealing
• Abstract summary: We show that the proposed domain-wall encoding yields superior performance against a variety of metrics. We even find that a 2000Q quantum annealer with a drastically less connected hardware graph can outperform the next generation Advantage processor if that processor uses one-hot encoding.
• Score: 6.010731401883448
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Stage-dependent integer-binary encoding in factorization-machine black-box optimization [0.612477318852572]
  Black-box optimization deals with problems where objective functions lack explicit analytical forms and are expensive to evaluate.<n>We propose a stage-dependent FMQA framework and derive conversion formulas between one-hot and domain-wall QUBO matrices.<n>We evaluate the OhDw variant, which employs one-hot encoding for learning and domain-wall encoding for search.
  arXiv  Detail & Related papers  (2026-06-22T11:36:27Z)
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers [0.0]
  We study the performance of a local encoding known as the Derby-Klassen encoding.<n>We find that the high sampling requirements of postselection methods with the Derby-Klassen encoding pose a limitation to its applicability in near-term devices.
  arXiv  Detail & Related papers  (2025-06-06T18:00:01Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Data Encoding for VQC in Qiskit, A Comparison With Novel Hybrid Encoding [0.0]
  Amplitude encoding reduces the required qubits, Angle encoding makes state freedom better and is used for expressive encoding and Phase-based distinction. This paper demonstrates that efficient qubit usage is ensured as Amplitude encoding reduces the required qubits, Angle encoding makes state freedom better and is used for expressive encoding and Phase-based distinction.
  arXiv  Detail & Related papers  (2025-03-18T09:36:09Z)
• A Theoretical Perspective for Speculative Decoding Algorithm [60.79447486066416]
  One effective way to accelerate inference is emphSpeculative Decoding, which employs a small model to sample a sequence of draft tokens and a large model to validate. This paper tackles this gap by conceptualizing the decoding problem via markov chain abstraction and studying the key properties, emphoutput quality and inference acceleration, from a theoretical perspective.
  arXiv  Detail & Related papers  (2024-10-30T01:53:04Z)
• Integrated Encoding and Quantization to Enhance Quanvolutional Neural Networks [2.789685107745028]
  We propose two ways to enhance the efficiency of quanvolutional models. First, we propose a flexible data quantization approach with memoization, applicable to any encoding method. Second, we introduce a new integrated encoding strategy, which combines the encoding and processing steps in a single circuit.
  arXiv  Detail & Related papers  (2024-10-08T07:57:13Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Efficient and Equivariant Graph Networks for Predicting Quantum Hamiltonian [72.57870177599492]
  We propose a SE(3)-equivariant network, named QHNet, that achieves efficiency and equivariance. Our key advance lies at the innovative design of QHNet architecture, which not only obeys the underlying symmetries, but also enables the reduction of number of tensor products by 92%. Experimental results show that our QHNet can achieve comparable performance to the state of the art methods at a significantly faster speed.
  arXiv  Detail & Related papers  (2023-06-08T03:47:33Z)
• On the Suitability of Representations for Quality Diversity Optimization of Shapes [77.34726150561087]
  The representation, or encoding, utilized in evolutionary algorithms has a substantial effect on their performance. This study compares the impact of several representations, including direct encoding, a dictionary-based representation, parametric encoding, compositional pattern producing networks, and cellular automata, on the generation of voxelized meshes.
  arXiv  Detail & Related papers  (2023-04-07T07:34:23Z)
• An Comparative Analysis of Different Pitch and Metrical Grid Encoding Methods in the Task of Sequential Music Generation [4.941630596191806]
  This paper presents an analysis of the influence of pitch and meter on the performance of a token-based sequential music generation model. For complexity, the single token approach and the multiple token approach are compared; for grid resolution, 0 (ablation), 1 (bar-level), 4 (downbeat-level) 12, (8th-triplet-level) up to 64 (64th-note-grid-level) up to 16 subdivisions per beat are compared. Results suggest that the class-octave encoding significantly outperforms the taken-for-granted MIDI encoding on pitch-related metrics.
  arXiv  Detail & Related papers  (2023-01-31T03:19:50Z)
• On Quantum-Assisted LDPC Decoding Augmented with Classical Post-Processing [1.0498337709016812]
  This paper looks into the Quadratic Unconstrained Binary Optimization (QUBO) and utilized D-Wave 2000Q Quantum Annealer to solve it. We evaluated and compared this implementation against the decoding performance obtained using Simulated Annealing (SA) and belief propagation (BP) decoding with classical computers.
  arXiv  Detail & Related papers  (2022-04-21T08:01:39Z)
• Understanding domain-wall encoding theoretically and experimentally [1.2891210250935146]
  We analyze the method of encoding pairwise interactions of higher-than-binary discrete variables into binary variables based on domain walls on one dimensional Ising chains. We show that for problems of practical interest for quantum computing it is not possible to have a more efficient general encoding in terms of number of binary variables per discrete variable.
  arXiv  Detail & Related papers  (2021-08-26T19:15:40Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Improving Hamiltonian encodings with the Gray code [0.0]
  We study an efficient encoding that uses the entire set of basis states. This encoding is applied to the commonly-studied problem of finding the ground state energy of a deuteron. It is compared to a standard "one-hot" encoding, and various trade-offs that arise are analyzed.
  arXiv  Detail & Related papers  (2020-08-11T21:35:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.