Quantum estimation bound of Gaussian matrix permanent

Abstract

Exact calculation and even multiplicative error estimation of matrix permanent are challenging for both classical and quantum computers. Regarding the permanents of random Gaussian matrices, the additive error estimation is closely linked to boson sampling, and achieving multiplicative error estimation requires exponentially many samplings. Our newly developed formula for matrix permanents and its corresponding quantum expression have enabled better estimation of the average additive error for random Gaussian matrices compared to Gurvits' classical sampling algorithm. The well-known Ryser formula has been converted into a quantum permanent estimator. When dealing with real random Gaussian square matrices of size $N$, the quantum estimator can approximate the matrix permanent with an additive error smaller than $\epsilon (\sqrt{\mathrm{e}N}{)}^N$, where $\epsilon$ is the estimation precision. In contrast, Gurvits' classical sampling algorithm has an estimation error of $\epsilon (2\sqrt{N}{)}^N$, which is exponentially larger ($1.2^N$) than the quantum method. As expected, the quantum additive error bound fails to reach the multiplicative error bound of $(2\pi N{)}^{1/4}\epsilon (\sqrt{N/\mathrm{e}}{)}^N$. Additionally, the quantum permanent estimator can be up to quadratically faster than the classical estimator when using quantum phase estimation-based amplitude estimation.

9 pages, 1 figure

References in corpus (20)

• Hamiltonian Simulation by Qubitization
• Quantum Computational Supremacy
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Boson Sampling for Molecular Vibronic Spectra
• Boson Sampling from Gaussian States
• Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems
• Optimal Quantum Measurements of Expectation Values of Observables
• Computational advantage of quantum random sampling
• Quantum Power Method by a Superposition of Time-Evolved States
• What can quantum optics say about computational complexity theory?
• A Linear-Optical Proof that the Permanent is #P-Hard
• Quantum Commuting Circuits and Complexity of Ising Partition Functions
• Generalized concurrence in boson sampling
• A quantum-inspired algorithm for estimating the permanent of positive semidefinite matrices
• A simple encoding of a quantum circuit amplitude as a matrix permanent
• A quantum algorithm for additive approximation of Ising partition functions
• Quantum-inspired permanent identities
• Exact sampling hardness of Ising spin models
• Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
• The matrix permanent and determinant from a spin system

Cited by in corpus (1)

• Entanglement entropy dynamics of non-Gaussian states in free boson systems: Random sampling approach