Comparative study of quantum methods in the resolution of track findings instances

• URL: http://arxiv.org/abs/2410.18552v2
• Date: Fri, 25 Oct 2024 09:58:46 GMT
• Title: Comparative study of quantum methods in the resolution of track findings instances
• Authors: Duy Dao Do, Hervé Kerivin, Philippe Lacomme, Bogdan Vulpescu,
• Abstract summary: Track finding is a complex optimization problem initially introduced in particle physics. In this paper various modeling approaches are explored in order to assess both their impact and their effectiveness. We present implementations of three classical models using CPLEX, two quantum models running on actual D-Wave quantum computers, and one quantum model on a D-Wave simulator.
• Score: 0.9599644507730108
• License:
• Abstract: Track finding can be considered as a complex optimization problem initially introduced in particle physics involving the reconstruction of particle trajectories. A track is typically composed of several consecutive segments (track segments) that resembles a smooth curve without bifurcations. In this paper various modeling approaches are explored in order to assess both their impact and their effectiveness in solving them using quantum and classical methods. We present implementations of three classical models using CPLEX, two quantum models running on actual D-Wave quantum computers, and one quantum model on a D-Wave simulator. To facilitate a fair comparative study and encourage future research in this area, we introduce a new set of benchmark instances, categorized into small, medium, and large scales. Our evaluation of these methods on the benchmark instances indicates that D-Wave methods offer an excellent balance between computation time and result quality, outperforming CPLEX in numerous cases.

Related papers

• Efficient Classical Shadow Tomography through Many-body Localization Dynamics [4.923287660970805]
  We introduce an alternative approach founded on the dynamics of many-body localization. We demonstrate that our scheme achieves remarkable efficiency comparable to shallow circuits.
  arXiv  Detail & Related papers  (2023-09-03T19:50:28Z)
• A Geometric Perspective on Diffusion Models [57.27857591493788]
  We inspect the ODE-based sampling of a popular variance-exploding SDE. We establish a theoretical relationship between the optimal ODE-based sampling and the classic mean-shift (mode-seeking) algorithm.
  arXiv  Detail & Related papers  (2023-05-31T15:33:16Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• A supplemental investigation of non-linearity in quantum generative models with respect to simulatability and optimization [1.4329826483358277]
  We investigate two questions of relevance to the quantum algorithms and machine learning communities. Does introducing this form of non-linearity make the learning model classically simulatable due to the deferred measurement principle? And does introducing this form of non-linearity make the overall model's training more unstable?
  arXiv  Detail & Related papers  (2023-02-01T22:48:26Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry [3.5097082077065003]
  We introduce a generalization of quantum natural gradient descent to parameterized mixed states. We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
  arXiv  Detail & Related papers  (2022-06-09T17:58:15Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Tensor-network study of correlation-spreading dynamics in the two-dimensional Bose-Hubbard model [0.0]
  We demonstrate that a tensor-network method running on classical computers is useful for this purpose. We specifically analyze real-time dynamics of the two-dimensional Bose-Hubbard model after a sudden quench. By estimating the phase and group velocities from the single-particle and density-density correlation functions, we predict how these velocities vary in the moderate interaction region.
  arXiv  Detail & Related papers  (2021-08-25T05:37:16Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Towards solving the BCS Hamiltonian gap in Near-Term Quantum Computers [0.0]
  We obtain the gap of a BCS Hamiltonian using a NISQ framework. We show how to approximate the gap within one standard deviation, even with the presence of noise.
  arXiv  Detail & Related papers  (2021-05-31T13:01:23Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44: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.