Fetching the paper…
Reading the bibliography…
We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem.
Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
Andrew M Childs, Robin Kothari, and Rolando D Somma · 1950
Earlier work this paper cites.
On quantum field theory I: explicit solution of Dyson’s equation in electrodynamics without use of Feynman graphs
Eduardo R Caianiello · 1953
Earlier work this paper cites.
Drum shapes and isospectral graphs
George A Baker Jr · 1966
Earlier work this paper cites.
L. Babai, D.Yu. Grigoryev and D.M. Mount
1982
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W Shor · 1994
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W Shor · 1999
Earlier work this paper cites.
Strongly regular graphs
Chris Godsil and Gordon Royle · 2001
Earlier work this paper cites.
Simulation of topological field theories by quantum computers
Michael H Freedman, Alexei Kitaev, and Zhenghan Wang · 2002
Earlier work this paper cites.
A modular functor which is universal for quantum computation
Michael H Freedman, Michael Larsen, and Zhenghan Wang · 2002
Earlier work this paper cites.
Permanents in linear optical networks
Stefan Scheel · 2004
Earlier work this paper cites.
Coined quantum walks lift the cospectrality of graphs and trees
David Emms, Simone Severini, Richard C. Wilson, and Edwin R. Hancock · 2005
Earlier work this paper cites.
Combinatorial Mathematics V.: Proceedings of the Fifth Australian Conference, Held at the Royal Melbourne Institute of Technology, August 24 - 26, 1976
C.H.C. Little · 2006
Earlier work this paper cites.
Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane
Dorit Aharonov, Itai Arad, Elad Eban, and Zeph Landau · 2007
Earlier work this paper cites.
A classical approach to the graph isomorphism problem using quantum walks
Brendan L Douglas and Jingbo B Wang · 2008
Earlier work this paper cites.
On the exact evaluation of certain instances of the Potts partition function by quantum computers
Joseph Geraci and Daniel A Lidar · 2008
Earlier work this paper cites.
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
Paweł Wocjan and Jon Yard · 2008
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
Quantum algorithms for spin models and simulable gate sets for quantum computation
Maarten Van den Nest, Wolfgang Dür, Robert Raussendorf, and Hans J Briegel · 2009
Cited alongside, same era.
Two-particle quantum walks applied to the graph isomorphism problem
John King Gamble, Mark Friesen, Dong Zhou, Robert Joynt, and S. N. Coppersmith · 2010
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Two-particle quantum walks: Entanglement and graph isomorphism testing
Scott D Berry and Jingbo B Wang · 2011
Combinatorics and Complexity of Partition Functions
Alexander Barvinok · 2016
Later among the works it cites.
Quantum speed-ups for solving semidefinite programs
Fernando GSL Brandão and Krysta M Svore · 2017
Later among the works it cites.
Exponential quantum speed-ups for semidefinite programming with applications to quantum learning
Fernando GSL Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M Svore, and Xiaodi Wu · 2017
Later among the works it cites.
Parameters of strongly regular graphs
Andries E. Brouwer · 2017
Later among the works it cites.
QUBO formulations for the graph isomorphism problem and related problems
Cristian S Calude, Michael J Dinneen, and Richard Hua · 2017
Later among the works it cites.
Gaussian boson sampling
C. S. Hamilton, R. Kruse, L. Sansoni, S. Barkhofen, C. Silberhorn, and I. Jex · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Noninteracting multiparticle quantum random walks applied to the graph isomorphism problem for strongly regular graphs
Kenneth Rudinger, John Gamble, Mark Wellons, Eric Bach, Mark Friesen, Robert Joynt, and S. Coppersmith · 2012
Cited alongside, same era.
Algebraic Aspects of Multi-Particle Quantum Walks
Jamie Smith · 2012
Cited alongside, same era.
Multivariate distributions and the moment problem
Christian Kleiber and Jordan Stoyanov · 2013
Cited alongside, same era.
Comparing algorithms for graph isomorphism using discrete- and Continuous-Time quantum random walks
Kenneth Rudinger, John King Gamble, Eric Bach, Mark Friesen, Robert Joynt, and S. N. Coppersmith · 2013
Cited alongside, same era.
Graph isomorphism and adiabatic quantum computing
Frank Gaitan and Lane Clark · 2014
Cited alongside, same era.
Phase-modified CTQW unable to distinguish strongly regular graphs efficiently
Anuradha Mahasinghe, Josh A Izaac, Jingbo B Wang, and Jagath K Wijerathna · 2015
Cited alongside, same era.
Later among the works it cites.
Graph isomorphisms in quasi-polynomial time
Harald Andrés Helfgott, Jitendra Bajpai, and Daniele Dona · 2017
Later among the works it cites.
A proposal for an efficient quantum algorithm solving the graph isomorphism problem
PW Mills, RP Rundle, VM Dwyer, Todd Tilma, Simon J Devitt, JH Samson, and Mark J Everitt · 2017
Later among the works it cites.
Gaussian boson sampling for perfect matchings of arbitrary graphs
Kamil Brádler, Pierre-Luc Dallaire-Demers, Patrick Rebentrost, Daiqin Su, and Christian Weedbrook · 2018
Closest in time.
Strongly regular graphs
Ted Spence · 2018
Closest in time.
A faster hafnian formula for complex matrices and its benchmarking on a supercomputer
Andreas Björklund, Brajesh Gupt, and Nicolás Quesada · 2019
Closest in time.
A duality at the heart of Gaussian boson sampling,
Kamil Brádler, Robert Israel, Maria Schuld, Daiqin Su · 2019
Closest in time.
Detailed study of gaussian boson sampling
Regina Kruse, Craig S Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex · 2019
Closest in time.
Quantum computational advantage using photons
Han-Sen Zhong et al · 2020
Closest in time.