Qubit Number Optimization for Restriction Terms of QUBO Hamiltonians

• URL: http://arxiv.org/abs/2306.06943v1
• Date: Mon, 12 Jun 2023 08:25:56 GMT
• Title: Qubit Number Optimization for Restriction Terms of QUBO Hamiltonians
• Authors: I\~nigo Perez Delgado, Beatriz Garc\'ia Markaida, Alejandro Mata Ali, Aitor Moreno Fdez. de Leceta
• Abstract summary: It is mathematically allowed to ask for fractional values of $R$. We show how they can reduce the number of qubits needed to implement the restriction hamiltonian even further. Finally, we characterize the response of DWave's Advantage$_$system4.1 Quantum Annealer (QA) when faced with the implementation of FRCs.
• Score: 62.997667081978825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In usual restriction terms of the Quadratic Unconstrained Binary Optimization (QUBO) hamiltonians, a integer number of logical qubits R, called the Integer Restriction Coefficient (IRC), are forced to stay active. In this paper we gather the well-known methods of implementing these restrictions, as well as some novel methods that show to be more efficient in some frequently implemented cases. Moreover, it is mathematically allowed to ask for fractional values of $R$. For these Fractionary Restriction Coefficients (FRC) we show how they can reduce the number of qubits needed to implement the restriction hamiltonian even further. Lastly, we characterize the response of DWave's Advantage$\_$system4.1 Quantum Annealer (QA) when faced with the implementation of FRCs, and offer a summary guide of the presented methods and the situations each of them is to be used.

Related papers

• Qubit-count optimization using ZX-calculus [3.129187821625805]
  We show how to optimize the number of qubits in a quantum circuit while preserving the number of non-Clifford gates. One of our approaches consists in reversing the gadgetization of Hadamard gates, which is a procedure used by some $T$-counts. We also show how this method can be used to efficiently optimize the number of qubits in a quantum circuit by using the ZX-calculus as an intermediate representation.
  arXiv  Detail & Related papers  (2024-07-14T11:58:53Z)
• Feedback-Based Quantum Algorithm for Constrained Optimization Problems [0.6554326244334868]
  We introduce a new operator that encodes the problem's solution as its ground state. We show that our proposed algorithm saves computational resources by reducing the depth of the quantum circuit.
  arXiv  Detail & Related papers  (2024-06-12T12:58:43Z)
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization [72.41480594026815]
  Constrained optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
  arXiv  Detail & Related papers  (2022-11-16T18:59:54Z)
• Neural Networks Reduction via Lumping [0.0]
  A large number of solutions has been published to reduce both the number of operations and the parameters involved with the models. Most of these reducing techniques are actually methods and usually require at least one re-training step to recover the accuracy. We propose a pruning approach that reduces the number of neurons in a network without using any data or fine-tuning, while completely preserving the exact behaviour.
  arXiv  Detail & Related papers  (2022-09-15T17:13:07Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection [136.4014229319618]
  We study the role of the representation of state-action value functions in regret minimization in finite-horizon Markov Decision Processes (MDPs) with linear structure. We first derive a necessary condition on the representation, called universally spanning optimal features (UNISOFT), to achieve constant regret in any MDP with linear reward function.
  arXiv  Detail & Related papers  (2021-10-27T22:07:08Z)
• Device-independent lower bounds on the conditional von Neumann entropy [10.2138250640885]
  We introduce a numerical method to compute lower bounds on rates of quantum protocols. We find substantial improvements over all previous numerical techniques. Our method is compatible with the entropy accumulation theorem.
  arXiv  Detail & Related papers  (2021-06-25T15:24:12Z)
• Sequential- and Parallel- Constrained Max-value Entropy Search via Information Lower Bound [9.09466320810472]
  We focus on an information-theoretic approach called Max-value Entropy Search (MES) We propose a novel constrained BO method called Constrained Max-value Entropy Search via Information lower BOund (CMES-IBO)
  arXiv  Detail & Related papers  (2021-02-19T08:10:51Z)
• Conditional gradient methods for stochastically constrained convex minimization [54.53786593679331]
  We propose two novel conditional gradient-based methods for solving structured convex optimization problems. The most important feature of our framework is that only a subset of the constraints is processed at each iteration. Our algorithms rely on variance reduction and smoothing used in conjunction with conditional gradient steps, and are accompanied by rigorous convergence guarantees.
  arXiv  Detail & Related papers  (2020-07-07T21:26:35Z)

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.