Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states

• URL: http://arxiv.org/abs/2210.11568v2
• Date: Mon, 29 May 2023 21:23:00 GMT
• Title: Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states
• Authors: Dmitri A. Ivanov
• Abstract summary: It is known that computing the permanent computation of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations in the matrix size. I extend this result to a generalization of the matrix permanent: an expectation value in a product of a large number of identical bosonic states with a bounded number of bosons.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I extend this result to a generalization of the matrix permanent: an expectation value in a product of a large number of identical bosonic states with a bounded number of bosons. This result complements earlier studies on the computational complexity in boson sampling and related setups. The proposed technique based on the Gaussian averaging is equally applicable to bosonic and fermionic systems. This also allows us to improve an earlier polynomial complexity estimate for the fermionic version of the same problem.

Related papers

• Pauli Decomposition via the Fast Walsh-Hadamard Transform [0.0]
  We present a new exact and explicit formula for the Pauli string coefficients. We show that up to a permutation of the matrix elements, the decomposition coefficients are related to the original matrix by a multiplication of a generalised Hadamard matrix. A numerical implementation of our equation outperforms currently available solutions.
  arXiv  Detail & Related papers  (2024-08-12T14:56:45Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• Quantum eigenvalue processing [0.0]
  Problems in linear algebra can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary transformations on eigenvalues of block-encoded non-normal operators. We also present a Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra.
  arXiv  Detail & Related papers  (2024-01-11T19:49:31Z)
• Generalized Quantum Singular Value Transformation [0.0]
  The quantum singular value transformation has revolutionised quantum algorithms. By applying a computation to an arbitrary matrix, it provides a unifying picture of quantum algorithms. Recent work has removed restrictions and enabled faster computation.
  arXiv  Detail & Related papers  (2023-12-01T16:59:14Z)
• Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer [0.0]
  This work is the efficient procedure for representation of a tridiagonal matrix in the Pauli basis. It allows one to construct a Hamiltonian evolution circuit without the use of oracles.
  arXiv  Detail & Related papers  (2023-09-29T20:27:05Z)
• Polynomial-time Solver of Tridiagonal QUBO and QUDO problems with Tensor Networks [41.94295877935867]
  We present an algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and Quadratic Unconstrained Discrete Optimization (QUDO) problems with one-neighbor interactions. Our method is based on the simulation of a quantum state to which we will apply an imaginary time evolution and perform a series of partial traces to obtain the state of maximum amplitude.
  arXiv  Detail & Related papers  (2023-09-19T10:45:15Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Non-Markovian Stochastic Schr\"odinger Equation: Matrix Product State Approach to the Hierarchy of Pure States [65.25197248984445]
  We derive a hierarchy of matrix product states (HOMPS) for non-Markovian dynamics in open finite temperature. The validity and efficiency of HOMPS is demonstrated for the spin-boson model and long chains where each site is coupled to a structured, strongly non-Markovian environment.
  arXiv  Detail & Related papers  (2021-09-14T01:47:30Z)
• Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time [46.31710224483631]
  We show how to bypass the main open question of Nelson and Nguyen (FOCS, 2013) regarding the logarithmic factors in the sketching dimension for existing constant factor approximation oblivious subspace embeddings. A key technique we use is an explicit mapping of Indyk based on uncertainty principles and extractors. For the fundamental problems of rank computation and finding a linearly independent subset of columns, our algorithms improve Cheung, Kwok, and Lau (JACM, 2013) and are optimal to within a constant factor and a $loglog(n)$-factor, respectively.
  arXiv  Detail & Related papers  (2021-07-16T19:34:10Z)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)
• Tangent-space methods for truncating uniform MPS [0.0]
  A central primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a lower bond dimension. We formulate a tangent-space based variational algorithm to achieve this for uniform (infinite) matrix product states.
  arXiv  Detail & Related papers  (2020-01-31T14:54:50Z)

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.