Built on

HD Ursell, “The evaluation of gibbs’ phase-integral for imperfect gases,” in Mathematical Proceedings of the Cambridge Philosophical Society , Vol. 23 (Cambridge University Press, 1927) pp. 685–697
1927
Earlier work this paper cites.
M Duneau, Daniel Iagolnitzer, and B Souillard, “Decrease properties of truncated correlation functions and analyticity properties for classical lattices and continuous systems,” Communications in Mathematical Physics 31
1973
Earlier work this paper cites.
David J Thouless, Philip W Anderson, and Robert G Palmer, “Solution of ’solvable model of a spin glass’,” Philosophical Magazine 35
1977
Earlier work this paper cites.
Alan E Gelfand, “Gibbs sampling,” Journal of the American statistical Association 95
2000
Earlier work this paper cites.
Scott Aaronson and Alex Arkhipov, “The computational complexity of linear optics,” in Proceedings of the forty-third annual ACM symposium on Theory of computing (2011) pp. 333–342
2011
Earlier work this paper cites.
Michael J Bremner, Richard Jozsa, and Dan J Shepherd, “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467
2011
Earlier work this paper cites.
Jelmer J. Renema, “Marginal probabilities in boson samplers with arbitrary input states,” arXiv:2012.14917 (2020a)
Original
2012
Earlier work this paper cites.
Christian Weedbrook, Stefano Pirandola, Raúl García-Patrón, Nicolas J Cerf, Timothy C Ralph, Jeffrey H Shapiro, and Seth Lloyd, “Gaussian quantum information,” Reviews of Modern Physics 84
2012
Earlier work this paper cites.
Scott Aaronson and Alex Arkhipov, “Bosonsampling is far from uniform,” arXiv:1309.7460 (2013)
Original
2013
Earlier work this paper cites.
Gil Kalai and Guy Kindler, “Gaussian Noise Sensitivity and BosonSampling,” arXiv:1409.3093 (2014)
Original
2014
Earlier work this paper cites.
Saleh Rahimi-Keshari, Timothy C Ralph, and Carlton M Caves, “Sufficient conditions for efficient classical simulation of quantum optics,” Physical Review X 6
2016
Earlier work this paper cites.
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd, “Average-case complexity versus approximate simulation of commuting quantum computations,” Physical review letters 117
2016
Earlier work this paper cites.
Scott Aaronson and Lijie Chen, “Complexity-theoretic foundations of quantum supremacy experiments,” in Proceedings of the 32nd Computational Complexity Conference (2017) pp. 1–67
2017
Earlier work this paper cites.
Thomas Häner and Damian S. Steiger, “0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit,” arXiv:1704.01127 (2017)
Original
2017
Earlier work this paper cites.
Craig S. Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex, “Gaussian Boson Sampling,” Physical Review Letters 119
2017
Earlier work this paper cites.
Alessio Serafini, Quantum continuous variables: a primer of theoretical methods (CRC press, 2017)
2017
Earlier work this paper cites.
Jelmer J Renema, Adrian Menssen, William R Clements, Gil Triginer, William S Kolthammer, and Ian A Walmsley, “Efficient algorithm for boson sampling with partially distinguishable photons,” arXiv:1707.02793 (2017)
Original
2017
Earlier work this paper cites.
Peter Clifford and Raphaël Clifford, “The Classical Complexity of Boson Sampling,” arXiv:1706.01260 (2017)
Original
2017
Earlier work this paper cites.
H. Chau Nguyen, Riccardo Zecchina, and Johannes Berg, “Inverse statistical problems: from the inverse Ising problem to data science,” Advances in Physics 66
2017
Earlier work this paper cites.
Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J. Bremner, John M. Martinis, and Hartmut Neven, “Characterizing quantum supremacy in near-term devices,” Nature Physics 14
2018
Earlier work this paper cites.
Hans De Raedt, Fengping Jin, Dennis Willsch, Madita Nocon, Naoki Yoshioka, Nobuyasu Ito, Shengjun Yuan, and Kristel Michielsen, “Massively parallel quantum computer simulator, eleven years later,” arXiv:1805.04708 (2018)
Original
2018
Earlier work this paper cites.
Riling Li, Bujiao Wu, Mingsheng Ying, Guangwen Yang, and Xiaomin Sun, “Quantum Supremacy Circuit Simulation on Sunway TaihuLight,” arXiv:1804.04797 (2018)
Original
2018
Earlier work this paper cites.

Similar

Igor L Markov, Aneeqa Fatima, Sergei V Isakov, and Sergio Boixo, “Quantum supremacy is both closer and farther than it appears,” arXiv:1807.10749 (2018)
Original
2018
Cited alongside, same era.
Nicolás Quesada, Juan Miguel Arrazola, and Nathan Killoran, “Gaussian Boson Sampling using threshold detectors,” Physical Review A 98
2018
Cited alongside, same era.
Brajesh Gupt, Juan Miguel Arrazola, Nicolás Quesada, and Thomas R. Bromley, “Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer,” arXiv:1810.00900 (2018)
Original
2018
Cited alongside, same era.
Charles Neill, Pedran Roushan, K Kechedzhi, Sergio Boixo, Sergei V Isakov, V Smelyanskiy, A Megrant, B Chiaro, A Dunsworth, K Arya, et al. , “A blueprint for demonstrating quantum supremacy with superconducting qubits,” Science 360
2018
Cited alongside, same era.

Then

Johnnie Gray and Stefanos Kourtis, “Hyper-optimized tensor network contraction,” arXiv:2002.01935 (2020)
Original
2020
Later among the works it cites.
Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, et al. , “Classical simulation of quantum supremacy circuits,” arXiv:2005.06787 (2020)
Original
2020
Later among the works it cites.
Kyungjoo Noh, Liang Jiang, and Bill Fefferman, “Efficient classical simulation of noisy random quantum circuits in one dimension,” arXiv:2003.13163 (2020)
Original
2020
Later among the works it cites.
Boaz Barak, Chi-Ning Chou, and Xun Gao, “Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits,” arXiv:2005.02421 (2020)
Original
2020
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2021

Efficient approximation of experimental Gaussian boson sampling

Villalonga, Benjamin, Niu, Murphy Yuezhen, Li, Li et al.

Understand

Two recent landmark experiments have performed Gaussian boson sampling (GBS) with a non-programmable linear interferometer and threshold detectors on up to 144 output modes (see Refs.~\onlinecite{zhong_quantum_2020,zhong2021phase}).

Here we give classical sampling algorithms with better total variation distance and Kullback-Leibler divergence than these experiments and a computational cost quadratic in the number of modes.
Our method samples from a distribution that approximates the single-mode and two-mode ideal marginals of the given Gaussian boson sampler, which are calculated efficiently.
One implementation sets the parameters of a Boltzmann machine from the calculated marginals using a mean field solution.

Built on

HD Ursell, “The evaluation of gibbs’ phase-integral for imperfect gases,” in Mathematical Proceedings of the Cambridge Philosophical Society , Vol. 23 (Cambridge University Press, 1927) pp. 685–697
1927
Earlier work this paper cites.
M Duneau, Daniel Iagolnitzer, and B Souillard, “Decrease properties of truncated correlation functions and analyticity properties for classical lattices and continuous systems,” Communications in Mathematical Physics 31
1973
Earlier work this paper cites.
David J Thouless, Philip W Anderson, and Robert G Palmer, “Solution of ’solvable model of a spin glass’,” Philosophical Magazine 35
1977
Earlier work this paper cites.
Alan E Gelfand, “Gibbs sampling,” Journal of the American statistical Association 95
2000
Earlier work this paper cites.
Scott Aaronson and Alex Arkhipov, “The computational complexity of linear optics,” in Proceedings of the forty-third annual ACM symposium on Theory of computing (2011) pp. 333–342
2011
Earlier work this paper cites.
Michael J Bremner, Richard Jozsa, and Dan J Shepherd, “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467
2011
Earlier work this paper cites.
Jelmer J. Renema, “Marginal probabilities in boson samplers with arbitrary input states,” arXiv:2012.14917 (2020a)
Original
2012
Earlier work this paper cites.
Christian Weedbrook, Stefano Pirandola, Raúl García-Patrón, Nicolas J Cerf, Timothy C Ralph, Jeffrey H Shapiro, and Seth Lloyd, “Gaussian quantum information,” Reviews of Modern Physics 84
2012
Earlier work this paper cites.
Scott Aaronson and Alex Arkhipov, “Bosonsampling is far from uniform,” arXiv:1309.7460 (2013)
Original
2013
Earlier work this paper cites.
Gil Kalai and Guy Kindler, “Gaussian Noise Sensitivity and BosonSampling,” arXiv:1409.3093 (2014)
Original
2014
Earlier work this paper cites.
Saleh Rahimi-Keshari, Timothy C Ralph, and Carlton M Caves, “Sufficient conditions for efficient classical simulation of quantum optics,” Physical Review X 6
2016
Earlier work this paper cites.
Michael J Bremner, Ashley Montanaro, and Dan J Shepherd, “Average-case complexity versus approximate simulation of commuting quantum computations,” Physical review letters 117
2016
Earlier work this paper cites.
Scott Aaronson and Lijie Chen, “Complexity-theoretic foundations of quantum supremacy experiments,” in Proceedings of the 32nd Computational Complexity Conference (2017) pp. 1–67
2017
Earlier work this paper cites.
Thomas Häner and Damian S. Steiger, “0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit,” arXiv:1704.01127 (2017)
Original
2017
Earlier work this paper cites.
Craig S. Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex, “Gaussian Boson Sampling,” Physical Review Letters 119
2017
Earlier work this paper cites.
Alessio Serafini, Quantum continuous variables: a primer of theoretical methods (CRC press, 2017)
2017
Earlier work this paper cites.
Jelmer J Renema, Adrian Menssen, William R Clements, Gil Triginer, William S Kolthammer, and Ian A Walmsley, “Efficient algorithm for boson sampling with partially distinguishable photons,” arXiv:1707.02793 (2017)
Original
2017
Earlier work this paper cites.
Peter Clifford and Raphaël Clifford, “The Classical Complexity of Boson Sampling,” arXiv:1706.01260 (2017)
Original
2017
Earlier work this paper cites.
H. Chau Nguyen, Riccardo Zecchina, and Johannes Berg, “Inverse statistical problems: from the inverse Ising problem to data science,” Advances in Physics 66
2017
Earlier work this paper cites.
Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J. Bremner, John M. Martinis, and Hartmut Neven, “Characterizing quantum supremacy in near-term devices,” Nature Physics 14
2018
Earlier work this paper cites.
Hans De Raedt, Fengping Jin, Dennis Willsch, Madita Nocon, Naoki Yoshioka, Nobuyasu Ito, Shengjun Yuan, and Kristel Michielsen, “Massively parallel quantum computer simulator, eleven years later,” arXiv:1805.04708 (2018)
Original
2018
Earlier work this paper cites.
Riling Li, Bujiao Wu, Mingsheng Ying, Guangwen Yang, and Xiaomin Sun, “Quantum Supremacy Circuit Simulation on Sunway TaihuLight,” arXiv:1804.04797 (2018)
Original
2018
Earlier work this paper cites.

Similar

Igor L Markov, Aneeqa Fatima, Sergei V Isakov, and Sergio Boixo, “Quantum supremacy is both closer and farther than it appears,” arXiv:1807.10749 (2018)
Original
2018
Cited alongside, same era.
Nicolás Quesada, Juan Miguel Arrazola, and Nathan Killoran, “Gaussian Boson Sampling using threshold detectors,” Physical Review A 98
2018
Cited alongside, same era.
Brajesh Gupt, Juan Miguel Arrazola, Nicolás Quesada, and Thomas R. Bromley, “Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer,” arXiv:1810.00900 (2018)
Original
2018
Cited alongside, same era.
Charles Neill, Pedran Roushan, K Kechedzhi, Sergio Boixo, Sergei V Isakov, V Smelyanskiy, A Megrant, B Chiaro, A Dunsworth, K Arya, et al. , “A blueprint for demonstrating quantum supremacy with superconducting qubits,” Science 360
2018
Cited alongside, same era.

Then

Johnnie Gray and Stefanos Kourtis, “Hyper-optimized tensor network contraction,” arXiv:2002.01935 (2020)
Original
2020
Later among the works it cites.
Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, et al. , “Classical simulation of quantum supremacy circuits,” arXiv:2005.06787 (2020)
Original
2020
Later among the works it cites.
Kyungjoo Noh, Liang Jiang, and Bill Fefferman, “Efficient classical simulation of noisy random quantum circuits in one dimension,” arXiv:2003.13163 (2020)
Original
2020
Later among the works it cites.
Boaz Barak, Chi-Ning Chou, and Xun Gao, “Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits,” arXiv:2005.02421 (2020)
Original
2020
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Peter Clifford and Raphaël Clifford, “The classical complexity of boson sampling,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, 2018) pp. 146–155

2018

Cited alongside, same era.

Jelmer Renema, Valery Shchesnovich, and Raul Garcia-Patron, “Classical simulability of noisy boson sampling,” arXiv:1809.01953 (2018)