2000 character limit reached
Simulating Gaussian Boson Sampling with Tensor Networks in the Heisenberg picture
Published 18 May 2023 in quant-ph | (2305.11215v3)
Abstract: Although the Schr{\"o}dinger and Heisenberg pictures are equivalent formulations of quantum mechanics, simulations performed choosing one over the other can greatly impact the computational resources required to solve a problem. Here we demonstrate that in Gaussian boson sampling, a central problem in quantum computing, a good choice of representation can shift the boundary between feasible and infeasible numerical simulability. To achieve this, we introduce a novel method for computing the probability distribution of boson sampling based on the time evolution of tensor networks in the Heisenberg picture. In addition, we overcome limitations of existing methods enabling simulations of realistic setups affected by non-uniform photon losses. Our results demonstrate the effectiveness of the method and its potential to advance quantum computing research.
- Román Orús, “Tensor networks for complex quantum systems,” Nature Reviews Physics 1, 538–550 (2019).
- Simone Montangero, Introduction to tensor network methods (Springer Cham, 2018).
- Ulrich Schollwöck, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics 326, 96–192 (2011).
- N Schuch, M M Wolf, K G H Vollbrecht, and J I Cirac, “On entropy growth and the hardness of simulating time evolution,” New Journal of Physics 10, 033032 (2008).
- Michael J. Hartmann, Javier Prior, Stephen R. Clark, and Martin B. Plenio, “Density matrix renormalization group in the heisenberg picture,” Phys. Rev. Lett. 102, 057202 (2009).
- Stephen R Clark, Javier Prior, Michael J Hartmann, Dieter Jaksch, and Martin B Plenio, “Exact matrix product solutions in the heisenberg picture of an open quantum spin chain,” New Journal of Physics 12, 025005 (2010).
- Dominik Muth, Razmik G Unanyan, and Michael Fleischhauer, “Dynamical simulation of integrable and nonintegrable models in the heisenberg picture,” Physical Review Letters 106, 077202 (2011).
- 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.
- Saleh Rahimi-Keshari, Austin P. Lund, and Timothy C. Ralph, “What can quantum optics say about computational complexity theory?” Physical Review Letters 114, 060501 (2015).
- Craig S Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex, “Gaussian boson sampling,” Physical review letters 119, 170501 (2017).
- Regina Kruse, Craig S. Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex, “Detailed study of gaussian boson sampling,” Phys. Rev. A 100, 032326 (2019).
- Haoyu Qi, Daniel J. Brod, Nicolás Quesada, and Raúl García-Patrón, “Regimes of classical simulability for noisy gaussian boson sampling,” Phys. Rev. Lett. 124, 100502 (2020).
- Nicolás Quesada and Juan Miguel Arrazola, “Exact simulation of gaussian boson sampling in polynomial space and exponential time,” Physical Review Research 2, 023005 (2020).
- Nicolás Quesada, Rachel S. Chadwick, Bryn A. Bell, Juan Miguel Arrazola, Trevor Vincent, Haoyu Qi, and Raúl García−--Patrón, “Quadratic speed-up for simulating gaussian boson sampling,” PRX Quantum 3, 010306 (2022).
- Jacob F. F. Bulmer, Bryn A. Bell, Rachel S. Chadwick, Alex E. Jones, Diana Moise, Alessandro Rigazzi, Jan Thorbecke, Utz-Uwe Haus, Thomas Van Vaerenbergh, Raj B. Patel, Ian A. Walmsley, and Anthony Laing, “The boundary for quantum advantage in gaussian boson sampling,” Science Advances 8, eabl9236 (2022).
- Alex Neville, Chris Sparrow, Raphaël Clifford, Eric Johnston, Patrick M. Birchall, Ashley Montanaro, and Anthony Laing, “Classical boson sampling algorithms with superior performance to near-term experiments,” Nature Physics 13, 1153–1157 (2017).
- Peter D. Drummond, Bogdan Opanchuk, A. Dellios, and M. D. Reid, “Simulating complex networks in phase space: Gaussian boson sampling,” Phys. Rev. A 105, 012427 (2022).
- Michael Lubasch, Antonio A. Valido, Jelmer J. Renema, W. Steven Kolthammer, Dieter Jaksch, M. S. Kim, Ian Walmsley, and Raúl García-Patrón, “Tensor network states in time-bin quantum optics,” Phys. Rev. A 97, 062304 (2018).
- Raúl García-Patrón, Jelmer J. Renema, and Valery Shchesnovich, “Simulating boson sampling in lossy architectures,” Quantum 3, 169 (2019).
- Jelmer J. Renema, “Simulability of partially distinguishable superposition and gaussian boson sampling,” Phys. Rev. A 101, 063840 (2020).
- Junheng Shi and Tim Byrnes, “Effect of partial distinguishability on quantum supremacy in gaussian boson sampling,” npj Quantum Information 8, 54 (2022).
- Minzhao Liu, Changhun Oh, Junyu Liu, Liang Jiang, and Yuri Alexeev, “Complexity of gaussian boson sampling with tensor networks,” (2023), 10.48550/arxiv.2301.12814.
- Alexander Nüßeler, Ish Dhand, Susana F. Huelga, and Martin B. Plenio, “Efficient construction of matrix-product representations of many-body gaussian states,” Phys. Rev. A 104, 012415 (2021).
- William R. Clements, Peter C. Humphreys, Benjamin J. Metcalf, W. Steven Kolthammer, and Ian A. Walmsley, “Optimal design for universal multiport interferometers,” Optica 3, 1460–1465 (2016).
- Scott Aaronson and Travis Hance, “Generalizing and derandomizing gurvits’s approximation algorithm for the permanent,” (2012), arXiv:1212.0025 [quant-ph] .
- Nicholas Metropolis, Arianna W Rosenbluth, Marshall N Rosenbluth, Augusta H Teller, and Edward Teller, “Equation of state calculations by fast computing machines,” The journal of chemical physics 21, 1087–1092 (1953).
- Charles J Geyer, “Practical markov chain monte carlo,” Statistical science , 473–483 (1992).
- J. J. Renema, A. Menssen, W. R. Clements, G. Triginer, W. S. Kolthammer, and I. A. Walmsley, “Efficient classical algorithm for boson sampling with partially distinguishable photons,” Phys. Rev. Lett. 120, 220502 (2018).
- ER Caianiello, “On quantum field theory. ii: Non-perturbative equations and methods,” Il Nuovo Cimento (1943-1954) 11, 492–529 (1954).
- David Callan, “A combinatorial survey of identities for the double factorial,” (2009), 10.48550/arxiv.0906.1317.
- Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics, 1st ed. (Cambridge University Press, USA, 2009).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.