Quantum Simulation-Based Optimization of a Cooling System

• URL: http://arxiv.org/abs/2504.15460v1
• Date: Mon, 21 Apr 2025 21:58:21 GMT
• Title: Quantum Simulation-Based Optimization of a Cooling System
• Authors: Leonhard Hölscher, Lukas Müller, Or Samimi, Tamuz Danzig,
• Abstract summary: Quantum algorithms promise up to exponential speedups for specific tasks relevant to numerical simulations.<n>However, these advantages quickly vanish when considering data input and output on quantum computers.<n>The recently introduced Quantum Simulation-Based Optimization (QuSO) treats simulations as subproblems within a larger optimization.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Engineering processes involve iterative design evaluations requiring numerous computationally intensive numerical simulations. Quantum algorithms promise up to exponential speedups for specific tasks relevant to numerical simulations. However, these advantages quickly vanish when considering data input and output on quantum computers. The recently introduced Quantum Simulation-Based Optimization (QuSO) algorithm circumvents this fundamental impediment by treating simulations as subproblems within a larger optimization problem. In this paper, we adapt and implement QuSO for a cooling system design problem. We validate the algorithm through statevector simulations and provide a detailed algorithmic complexity analysis indicating that the achievable speedup for this particular example is at most polynomial. Notably, we also specify the conditions under which QuSO could deliver exponential advantages. By providing this comprehensive demonstration, we highlight both the promise and practical constraints of QuSO in an engineering context, motivating further research into quantum algorithms for classical simulations and the search for suitable applications.

Related papers

• A quantum gradient descent algorithm for optimizing Gaussian Process models [28.16587217223671]
  We propose a quantum gradient descent algorithm to optimize the Gaussian Process model.<n>Our algorithm achieves exponential speedup in computing the gradients of the log marginal likelihood.
  arXiv  Detail & Related papers  (2025-03-22T14:14:31Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• A simple quantum simulation algorithm with near-optimal precision scaling [0.46040036610482665]
  Quantum simulation is a foundational application for quantum computers. Existing simulation techniques are for the most part too intricate to implement on early fault-tolerant quantum hardware. We propose a quantum Hamiltonian dynamics simulation algorithm that aims to be both straightforward to implement and at the same time have near-optimal scaling in simulation precision.
  arXiv  Detail & Related papers  (2024-12-14T04:04:35Z)
• Compact quantum algorithms for time-dependent differential equations [0.0]
  We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.<n>We generate hybrid quantum-classical algorithms that efficiently perform matrix-vector multiplication and matrix inversion operations.
  arXiv  Detail & Related papers  (2024-05-16T02:14:58Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Exponential Quantum Speedup for Simulation-Based Optimization Applications [4.302408747749262]
  We focus on the LinQuSO subclass of QuSO, which is characterized by the linearity of the simulation problem. We prove that a large subgroup of LinQuSO problems can be solved with up to exponential quantum speedups with regards to their simulation component.
  arXiv  Detail & Related papers  (2023-05-15T09:32:51Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
  We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
  arXiv  Detail & Related papers  (2021-01-19T19:00:23Z)
• 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)
• Quantum-Enhanced Simulation-Based Optimization [0.8057006406834467]
  Simulation-based optimization seeks to optimize an objective function that is computationally expensive to evaluate exactly. Quantum Amplitude Estimation (QAE) can achieve a quadratic speed-up over classical Monte Carlo simulation.
  arXiv  Detail & Related papers  (2020-05-21T17:02:59Z)

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.