Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations

• URL: http://arxiv.org/abs/2207.11520v1
• Date: Sat, 23 Jul 2022 13:49:07 GMT
• Title: Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations
• Abstract summary: Mixer Hamiltonians are mapping functions from the set of qubit-strings to the set of solutions. Objective is to give a compact and readable presentation of these Mixer Hamiltonians considering the functional analogies that exist between the OR community practices and the quantum field.
• Score: 2.2688530041645856
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper concerns quantum heuristics based on Mixer Hamiltonians that allow to restrict investigation on a specific subspace. Mixer Hamiltonian based approaches can be included in QAOA algorithm and we can state that Mixer Hamiltonians are mapping functions from the set of qubit-strings to the set of solutions. Mixer Hamiltonian offers an approach very similar to indirect representations commonly used in routing or in scheduling community for decades. After the initial publication of Cheng et al. in 1996 (Cheng et al., 1996), numerous propositions in OR lies on 1-to-n mapping functions, including the split algorithm that transform one TSP solution into a VRP solution. The objective is at first to give a compact and readable presentation of these Mixer Hamiltonians considering the functional analogies that exist between the OR community practices and the quantum field. Our experiments encompass numerical evaluations of circuit using the Qiskit library of IBM meeting the theoretical considerations.

Related papers

• The Quantum Hamiltonian Analysis Toolkit: Lowering the Barrier to Quantum Computing with Hamiltonians [4.061514855671651]
  QHAT enables the generation and analysis of Hamiltonians through a powerful and feature-rich application.<n>It supports Hamiltonians from multiple sources but can also generate Hamiltonians based on a simple description of the system.<n>An emphasis on user-friendly interfaces and efficient analysis means that the barrier to entry is low.
  arXiv  Detail & Related papers  (2026-05-11T19:10:07Z)
• 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)
• Phase estimation with partially randomized time evolution [36.989845156791525]
  Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation. We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry.
  arXiv  Detail & Related papers  (2025-03-07T18:09:32Z)
• Foundation Neural-Networks Quantum States as a Unified Ansatz for Multiple Hamiltonians [39.47297975798672]
  Foundation Neural-Network Quantum States (FNQS) is an integrated paradigm for studying quantum many-body systems.<n>FNQS leverage key principles of foundation models to define variational wave functions based on a single, versatile architecture.<n>FNQS can generalize to physical Hamiltonians beyond those encountered during training.
  arXiv  Detail & Related papers  (2025-02-13T16:52:07Z)
• Robust analog quantum simulators by quantum error-detecting codes [22.034646136056804]
  We provide a recipe for error-resilient Hamiltonian simulations, making use of an excited encoding subspace stabilized by solely $2$-local commuting Hamiltonians.<n>Our method is scalable as it only requires penalty terms that scale to system size.
  arXiv  Detail & Related papers  (2024-12-10T18:58:05Z)
• Systematic input scheme of many-boson Hamiltonians with applications to the two-dimensional $φ^4$ theory [0.0]
  We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional $phi 4$ theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm.
  arXiv  Detail & Related papers  (2024-07-18T16:47:53Z)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
  Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another. We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST. The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
  arXiv  Detail & Related papers  (2024-05-10T23:46:35Z)
• Simulating electronic structure on bosonic quantum computers [35.884125235274865]
  One of the most promising applications of quantum computing is the simulation of many-fermion problems. We show how an electronic structure Hamiltonian can be transformed into a system of qumodes through qubit-assisted fermion-to-qumode mapping.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Exactly solvable Hamiltonian fragments obtained from a direct sum of Lie algebras [0.0]
  Exactly solvable Hamiltonians are useful in the study of quantum many-body systems using quantum computers. We apply more general classes of exactly solvable qubit Hamiltonians than previously considered to address the Hamiltonian measurement problem.
  arXiv  Detail & Related papers  (2024-02-14T18:22:45Z)
• An occupation number quantum subspace expansion approach to compute the single-particle Green function: an opportunity for noise filtering [0.0]
  We introduce a hybrid quantum-classical algorithm to compute the Green function for strongly correlated electrons on noisy quantum devices. The technique allows for noise filtering, a useful feature for NISQ devices.
  arXiv  Detail & Related papers  (2023-12-21T00:21:17Z)
• Unitary Partitioning and the Contextual Subspace Variational Quantum Eigensolver [0.0]
  The contextual subspace variational quantum eigensolver (CS-VQE) is a hybrid quantum-classical algorithm that approximates the ground state energy of a given qubit Hamiltonian. We show that CS-VQE combined with measurement reduction is a promising approach to allow feasible eigenvalue computations on noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2022-07-07T17:28:36Z)
• A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations [31.761854762513337]
  Given the Hamiltonian, the evaluation of unitary operators has been at the heart of many quantum algorithms. Motivated by existing deterministic and random methods, we present a hybrid approach.
  arXiv  Detail & Related papers  (2021-09-16T13:53:12Z)
• Hamiltonian tomography by the quantum quench protocol with random noise [0.0]
  We introduce a framework for Hamiltonian tomography of multi-qubit systems with random noise. We adopt the quantum quench protocol to reconstruct a many-body Hamiltonian by local measurements.
  arXiv  Detail & Related papers  (2021-07-08T17:59:57Z)
• A Unified View of Stochastic Hamiltonian Sampling [18.300078015845262]
  This work revisits the theoretical properties of Hamiltonian differential equations (SDEs) for posterior sampling. We study the two types of errors that arise from numerical SDE simulation: the discretization error and the error due to noisy gradient estimates.
  arXiv  Detail & Related papers  (2021-06-30T16:50:11Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)
• Hamiltonian operator approximation for energy measurement and ground state preparation [23.87373187143897]
  We show how to approximate the Hamiltonian operator as a sum of propagators using a differential representation. The proposed approach, named Hamiltonian operator approximation (HOA), is designed to benefit analog quantum simulators.
  arXiv  Detail & Related papers  (2020-09-07T18:11:00Z)

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.