Efficient state preparation for multivariate Monte Carlo simulation

• URL: http://arxiv.org/abs/2409.07336v1
• Date: Wed, 11 Sep 2024 15:16:35 GMT
• Title: Efficient state preparation for multivariate Monte Carlo simulation
• Authors: Hitomi Mori, Kosuke Mitarai, Keisuke Fujii,
• Abstract summary: Quantum state preparation is a task to prepare a state with a specific function encoded in the amplitude. We propose a quantum algorithm that only requires the number of gates linear in $D$.
• Score: 0.8009842832476994
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum state preparation is a task to prepare a state with a specific function encoded in the amplitude, which is an essential subroutine in many quantum algorithms. In this paper, we focus on multivariate state preparation, as it is an important extension for many application areas. Specifically in finance, multivariate state preparation is required for multivariate Monte Carlo simulation, which is used for important numerical tasks such as risk aggregation and multi-asset derivative pricing. Using existing methods, multivariate quantum state preparation requires the number of gates exponential in the number of variables $D$. For this task, we propose a quantum algorithm that only requires the number of gates linear in $D$. Our algorithm utilizes multivariable quantum signal processing (M-QSP), a technique to perform the multivariate polynomial transformation of matrix elements. Using easily prepared block-encodings corresponding to each variable, we apply the M-QSP to construct the target function. In this way, our algorithm prepares the target state efficiently for functions achievable with M-QSP.

Related papers

• Polynomial time constructive decision algorithm for multivariable quantum signal processing [0.7332146059733189]
  Multivariable quantum signal processing (M-QSP) is proposed. M-QSP interleaves signal operators corresponding to each variable with signal processing operators. A classical algorithm is proposed to determine whether a given pair of Laurents can be implemented by M-QSP.
  arXiv  Detail & Related papers  (2024-10-03T09:30:35Z)
• Quantum state preparation for multivariate functions [2.344936782036958]
  We develop protocols for preparing quantum states whose amplitudes encode multivariate functions. We analyze requirements both pragmatically and in terms of near/medium-term resources. We use 24 qubits and up to 237 two-qubit gates on the Quantinuum H2-1 trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2024-05-31T17:49:27Z)
• Quantum signal processing over SU(N) [0.0]
  Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms. These techniques leverage transformations on the eigenvalues or singular values of block-encoded matrices, achieved with the use of just one control qubit. In this work, we extend the original QSP ansatz by introducing multiple control qubits.
  arXiv  Detail & Related papers  (2023-11-07T12:43:47Z)
• QuIP: 2-Bit Quantization of Large Language Models With Guarantees [44.212441764241]
  This work studies post-training parameter quantization in large language models (LLMs) We introduce quantization with incoherence processing (QuIP), a new method based on the insight that quantization benefits from $textitincoherent$ weight and Hessian matrices.
  arXiv  Detail & Related papers  (2023-07-25T07:44:06Z)
• Monte Carlo Graph Search for Quantum Circuit Optimization [26.114550071165628]
  This work proposes a quantum architecture search algorithm based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order, both for discrete gates, as well as gates containing continuous variables.
  arXiv  Detail & Related papers  (2023-07-14T14:01:25Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• 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)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Quantum state preparation with multiplicative amplitude transduction [0.0]
  Two variants of the algorithm with different emphases are introduced. One variant uses fewer qubits and no controlled gates, while the other variant potentially requires fewer gates overall. A general analysis is given to estimate the number of qubits necessary to achieve a desired precision in the amplitudes of the computational basis states.
  arXiv  Detail & Related papers  (2020-06-01T14:36:50Z)
• Efficient phase-factor evaluation in quantum signal processing [1.3614427997190908]
  Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrixs on quantum computers. There is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. We present here an optimization based method that can accurately compute the phase factors using standard double precision arithmetic operations.
  arXiv  Detail & Related papers  (2020-02-26T17:23:55Z)

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.