Exponential Quantum Speedup for Simulation-Based Optimization Applications

• URL: http://arxiv.org/abs/2305.08482v3
• Date: Sun, 15 Sep 2024 20:54:00 GMT
• Title: Exponential Quantum Speedup for Simulation-Based Optimization Applications
• Authors: Jonas Stein, Lukas Müller, Leonhard Hölscher, Georgios Chnitidis, Jezer Jojo, Afrah Farea, Mustafa Serdar Çelebi, David Bucher, Jonathan Wulf, David Fischer, Philipp Altmann, Claudia Linnhoff-Popien, Sebastian Feld,
• Abstract summary: 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.
• Score: 4.302408747749262
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The simulation of many industrially relevant physical processes can be executed up to exponentially faster using quantum algorithms. However, this speedup can only be leveraged if the data input and output of the simulation can be implemented efficiently. While we show that recent advancements for optimal state preparation can effectively solve the problem of data input at a moderate cost of ancillary qubits in many cases, the output problem can provably not be solved efficiently in general. By acknowledging that many simulation problems arise only as a subproblem of a larger optimization problem in many practical applications however, we identify and define a class of practically relevant problems that does not suffer from the output problem: Quantum Simulation-based Optimization (QuSO). QuSO represents optimization problems whose objective function and/or constraints depend on summary statistic information on the result of a simulation, i.e., information that can be efficiently extracted from a quantum state vector. In this article, we focus on the LinQuSO subclass of QuSO, which is characterized by the linearity of the simulation problem, i.e., the simulation problem can be formulated as a system of linear equations. By cleverly combining the quantum singular value transformation (QSVT) with the quantum approximate optimization algorithm (QAOA), we prove that a large subgroup of LinQuSO problems can be solved with up to exponential quantum speedups with regards to their simulation component. Finally, we present two practically relevant use cases that fall within this subgroup of QuSO problems.

Related papers

• 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. We generate hybrid quantum-classical algorithms that efficiently perform iterative 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)
• Towards Optimizations of Quantum Circuit Simulation for Solving Max-Cut Problems with QAOA [1.5047640669285467]
  Quantum approximate optimization algorithm (QAOA) is one of the popular quantum algorithms that are used to solve optimization problems via approximations. However, performing QAOA on virtual quantum computers suffers from a slow simulation speed for solving optimization problems. We propose techniques to accelerate QCS for QAOA using mathematical optimizations to compress quantum operations.
  arXiv  Detail & Related papers  (2023-12-05T06:08:57Z)
• 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)
• Preparing Arbitrary Continuous Functions in Quantum Registers With Logarithmic Complexity [0.0]
  Key applications can only achieve their potential speedup if their inputs are prepared efficiently. We effectively solve the problem of efficiently preparing quantum states following arbitrary continuous functions with logarithmic complexity in the desired resolution. Our work has significant implications in a wide range of applications, for instance in financial forecasting, and in quantum simulation.
  arXiv  Detail & Related papers  (2022-05-01T17:29:12Z)
• 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)
• 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)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• 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 Approximate Optimization for Hard Problems in Linear Algebra [0.0]
  We explore using QAOA for Binary Linear Least Squares (BLLS) as a building block of several other hard problems in linear algebra. For the scope of this work, our experiments were done on noiseless quantum simulators, a simulator including a device-realistic noise-model, and two IBM Q 5-qubit machines. Our numerics show that Simulated Annealing can outperform QAOA for BLLS at a QAOA depth of $pleq3$ for the probability of sampling the ground state.
  arXiv  Detail & Related papers  (2020-06-27T20:13:24Z)
• 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.