Solving systems of Boolean multivariate equations with quantum annealing
arXiv:2111.13224 · doi:10.1103/PhysRevResearch.4.013096
Abstract
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, we study the quantum annealing model for solving Boolean systems of multivariate equations of degree 2, usually referred to as the Multivariate Quadratic problem. We present different methodologies to embed the problem into a Hamiltonian that can be solved by available quantum annealing platforms. In particular, we provide three embedding options, and we highlight their differences in terms of quantum resources. Moreover, we design a machine-agnostic algorithm that adopts an iterative approach to better solve the problem Hamiltonian by repeatedly reducing the search space. Finally, we use D-Wave devices to successfully implement our methodologies on several instances of the Multivariate Quadratic problem.
arXiv comment10 pages, 2 figures, 2 tables, code available on Github link in paper
References in corpus (20)
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Computation by Adiabatic Evolution
- Robustness of adiabatic quantum computation
- Quantum Variational Autoencoder
- Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models
- Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
- Quantum-assisted Helmholtz machines: A quantum-classical deep learning framework for industrial datasets in near-term devices
- Perturbative Gadgets at Arbitrary Orders
- On the Complexity of Solving Quadratic Boolean Systems
- Pegasus: The second connectivity graph for large-scale quantum annealing hardware
- Readiness of Quantum Optimization Machines for Industrial Applications
- Hamiltonian gadgets with reduced resource requirements
- Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems
- Quantum-assisted associative adversarial network: Applying quantum annealing in deep learning
- Fast Quantum Algorithm for Solving Multivariate Quadratic Equations