Using Gaussian Boson Sampling to Find Dense Subgraphs.

Boson sampling devices are a prime candidate for exhibiting quantum supremacy, yet their application for solving problems of practical interest is less well understood. Here we show that Gaussian boson sampling (GBS) can be used for dense subgraph identification. Focusing on the NP-hard densest k-subgraph problem, we find that stochastic algorithms are enhanced through GBS, which selects dense subgraphs with high probability. These findings rely on a link between graph density and the number of perfect matchings-enumerated by the Hafnian-which is the relevant quantity determining sampling probabilities in GBS. We test our findings by constructing GBS-enhanced versions of the random search and simulated annealing algorithms and apply them through numerical simulations of GBS to identify the densest subgraph of a 30 vertex graph.

[1]  W. Hager,et al.  and s , 2019, Shallow Water Hydraulics.

[2]  G. Guerreschi,et al.  Boson sampling for molecular vibronic spectra , 2014, Nature Photonics.

[3]  Igor Jex,et al.  Gaussian Boson sampling , 2016, 2017 Conference on Lasers and Electro-Optics (CLEO).

[4]  M. Lukin,et al.  Probing many-body dynamics on a 51-atom quantum simulator , 2017, Nature.

[5]  Alex Samorodnitsky,et al.  Hafnians, perfect matchings and Gaussian matrices , 2014 .

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  Philip Walther,et al.  Experimental boson sampling , 2012, Nature Photonics.

[8]  Pierre McKenzie,et al.  Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , 2017, STOC.

[9]  Divesh Srivastava,et al.  Dense subgraph maintenance under streaming edge weight updates for real-time story identification , 2012, The VLDB Journal.

[10]  B. J. Metcalf,et al.  Boson Sampling on a Photonic Chip , 2012, Science.

[11]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[12]  Sanjeev Arora,et al.  Computational complexity and information asymmetry in financial products , 2011, Commun. ACM.

[13]  J. O'Brien,et al.  Simulating the vibrational quantum dynamics of molecules using photonics , 2018, Nature.

[14]  Ravi Kumar,et al.  Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.

[15]  Yousef Saad,et al.  Dense Subgraph Extraction with Application to Community Detection , 2012, IEEE Transactions on Knowledge and Data Engineering.

[16]  Nicolò Spagnolo,et al.  Experimental scattershot boson sampling , 2015, Science Advances.

[17]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[18]  Juan Miguel Arrazola,et al.  Quantum approximate optimization with Gaussian boson sampling , 2018, Physical Review A.

[19]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[20]  Jiangfeng Du,et al.  Experimental realization of a quantum support vector machine. , 2015, Physical review letters.

[21]  Pasin Manurangsi,et al.  Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.

[22]  Jun S. Liu,et al.  Metropolized independent sampling with comparisons to rejection sampling and importance sampling , 1996, Stat. Comput..

[23]  W. Marsden.  I and J , 2012 .

[24]  Rupak Biswas,et al.  Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models , 2016, 1609.02542.

[25]  Fabio Sciarrino,et al.  Towards quantum supremacy with lossy scattershot boson sampling , 2016, 1610.02279.

[26]  A. Crespi,et al.  Integrated multimode interferometers with arbitrary designs for photonic boson sampling , 2013, Nature Photonics.

[27]  Andrew W. Cross,et al.  Demonstration of quantum advantage in machine learning , 2015, npj Quantum Information.

[28]  Alexander I. Barvinok,et al.  Combinatorics and Complexity of Partition Functions , 2017, Algorithms and combinatorics.

[29]  Andrew G. White,et al.  Photonic Boson Sampling in a Tunable Circuit , 2012, Science.

[30]  J. Gambetta,et al.  Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets , 2017, Nature.

[31]  Serafim Batzoglou,et al.  MotifCut: regulatory motifs finding with maximum density subgraphs , 2006, ISMB.

[32]  C. Monroe,et al.  Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator , 2017, Nature.

[33]  Ryan Babbush,et al.  The theory of variational hybrid quantum-classical algorithms , 2015, 1509.04279.

[34]  Alán Aspuru-Guzik,et al.  A variational eigenvalue solver on a photonic quantum processor , 2013, Nature Communications.

[35]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[36]  Seth Lloyd,et al.  Gaussian quantum information , 2011, 1110.3234.

[37]  Robert Krauthgamer,et al.  How hard is it to approximate the best Nash equilibrium? , 2009, SODA.

[38]  Saieed Akbari,et al.  Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges , 2013, Eur. J. Comb..

[39]  Raphaël Clifford,et al.  Classical boson sampling algorithms with superior performance to near-term experiments , 2017, Nature Physics.

[40]  A Laing,et al.  Boson sampling from a Gaussian state. , 2014, Physical review letters.