REVIEW 3 cited by
A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops. Our compact formulas for the hafnian and loop hafnian of $n \times n $ complex matrices run in $O(n^3 2^{n/2})$ time, are embarrassingly parallelizable and, to the best of our knowledge, are the fastest exact algorithms to compute these quantities. Despite our highly optimized algorithm, numerical benchmarks on the Titan supercomputer with matrices up to size $56 \times 56$ indicate that one would require the 288000 CPUs of this machine for about a month and a half to compute the hafnian of a $100 \times 100$ matrix.
Forward citations
Cited by 3 Pith papers
-
Speedup in Classical Simulation of Gaussian Boson Sampling
A classical sampling algorithm for Gaussian boson sampling decomposes Hafnians into smaller Hafnians and permanents, enabling simulation of 18-30 photons and lowering the estimated quantum-supremacy threshold.
-
Boosting Gaussian Boson Sampling using Optical Parametric Amplification Networks
An OPA-based nonlinear interferometer is proposed that keeps GBS entanglement linear in the number of modes under realistic photon loss, which the authors argue prevents efficient classical simulation.
-
Training the parametric interactions in an analog bosonic quantum neural network with Fock basis measurement
A bosonic quantum neural network with photon-number measurement is trained end-to-end by backpropagating through a classical Gaussian simulation.
Discussion (0). Continue with ORCID to comment.