We introduce a framework for simulating quantum optics by decomposing the system into a
finite rank (number of terms) superposition of coherent states. This allows us to define a …

Quasiprobability representations are important tools for analyzing a quantum system, such
as a quantum state or a quantum circuit. In this work, we propose classical algorithms …

Quantum networking at many scales will be critical to future quantum technologies and
experiments on quantum systems. Photonic links enable quantum networking. They will …

Exact calculation and even multiplicative error estimation of matrix permanent are
challenging for both classical and quantum computers. Regarding the permanents of …

The full state vector of boson sampling is generated by passing $ S $ single photons through
beam splitters of $ M $ modes. We express the initial Fock state in terms of 2$^{S-1} …

A universal quantum computer of large scale is not available yet, however, intermediate
models of quantum computation would still permit demonstrations of a quantum …

For every regular graph, we define a sequence of integers, using the recursion of the Martin
polynomial. This sequence counts spanning tree partitions and constitutes the diagonal …

BosonSampling is a popular candidate for near-term quantum advantage, which has now
been experimentally implemented several times. The original proposal of Aaronson and …

In this article, we study permanental varieties, ie, varieties defined by the vanishing of
permanents of fixed size of a generic matrix. Permanents and their varieties play an …

The approximate stabilizer rank of a quantum state is the minimum number of terms in any
approximate decomposition of that state into stabilizer states. Bravyi and Gosset showed that …