Resource-Efficient Digitized Adiabatic Quantum Factorization

• URL: http://arxiv.org/abs/2602.04740v1
• Date: Wed, 04 Feb 2026 16:42:42 GMT
• Title: Resource-Efficient Digitized Adiabatic Quantum Factorization
• Authors: Felip Pellicer, Juan José García-Ripoll, Alan C. Santos,
• Abstract summary: We derive a digitized adiabatic algorithm able to reduce the gate-demanding costs of implementing factorization.<n>Our encoding enables the design of adiabatic factorization algorithms.
• Score: 1.1470070927586018
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Digitized adiabatic quantum factorization is a hybrid algorithm that exploits the advantage of digitized quantum computers to implement efficient adiabatic algorithms for factorization through gate decompositions of analog evolutions. In this paper, we harness the flexibility of digitized computers to derive a digitized adiabatic algorithm able to reduce the gate-demanding costs of implementing factorization. To this end, we propose a new approach for adiabatic factorization by encoding the solution of the problem in the kernel subspace of the problem Hamiltonian, instead of using ground-state encoding considered in the standard adiabatic factorization proposed by Peng $et$ $al$. [Phys. Rev. Lett. 101, 220405 (2008)]. Our encoding enables the design of adiabatic factorization algorithms belonging to the class of Quadratic Unconstrained Binary Optimization (QUBO) methods, instead the Polinomial Unconstrained Binary Optimization (PUBO) used by standard adiabatic factorization. We illustrate the performance of our QUBO algorithm by implementing the factorization of integers $N$ up to 8 bits. The results demonstrate a substantial improvement over the PUBO formulation, both in terms of reduced circuit complexity and increased fidelity in identifying the correct solution.

Related papers

• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Enhanced Digitized Adiabatic Quantum Factorization Algorithm Using Null-Space Encoding [0.0]
  We propose a modified QAOA-based factorization protocol that simplifies the interacting Hamiltonian to include only two-body terms.<n>We show that this method achieves comparable or higher fidelities than the standard protocol.<n>We also report on simulations with alternative cost-function definitions that frequently yielded improved performance.
  arXiv  Detail & Related papers  (2025-11-13T16:24:07Z)
• A Binary Optimisation Algorithm for Near-Term Photonic Quantum Processors [32.80760571694025]
  We propose a new algorithm for binary optimisation, designed for near-term photonic quantum processors.<n>This variational algorithm uses samples from a quantum optical circuit, which are post-processed using trainable classical bit-flip probabilities.<n>A gradient-based training loop finds progressively better solutions until convergence.
  arXiv  Detail & Related papers  (2025-10-09T14:30:50Z)
• Efficient and Explicit Block Encoding of Finite Difference Discretizations of the Laplacian [0.0]
  We present an efficient and explicit block encoding method that enhances existing approaches in key aspects.<n>We detail the construction of the quantum algorithm and illustrate how it leverages the unique structure of finite difference discretizations.
  arXiv  Detail & Related papers  (2025-09-02T15:31:43Z)
• A Simplification Method for Inequality Constraints in Integer Binary Encoding HOBO Formulations [0.0]
  The proposed method addresses challenges associated with Quadratic Unconstrained Binary Optimization (QUBO) formulations.<n>By efficiently integrating constraints, the method enhances the computational efficiency and accuracy of both quantum and classical solvers.
  arXiv  Detail & Related papers  (2025-01-16T17:06:25Z)
• Integer Factorization through Func-QAOA [0.0]
  No efficient classical algorithm for cryptographic-time integer factorization has been found. We present the Func-QAOA approach for factorization, which premises overcoming some of the limitations of previous approaches.
  arXiv  Detail & Related papers  (2023-09-26T18:00:25Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• 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)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.