Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Optica Advanced Photonics Congress

Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light

Han-Sen Zhong, Yu-Hao Deng, Jian Qin, Hui Wang, Ming-Cheng Chen, Li-Chao Peng, Yi-Han Luo, Dian Wu, Si-Qiu Gong, Hao Su, Yi Hu, Peng Hu, Xiaoyan Yang, Weijun Zhang, Hao Li, Yuxuan Li, Xiao Qiang Jiang, Lin Gan, Guangwen Yang, Lixing You, Zhen Wang, Li Li, Nai-Le Liu, Jelmer J. Renema, Chao‐Yang Lu, Jian-Wei Pan

Published Jan 1, 2022• 25 citations
Publisher

Abstract

We report Gaussian boson sampling experiments which produce up to 113 photon detection events out of a 144-mode photonic circuit. We reveal genuine high-order correlation our samples, which is evidence of robustness against classical simulation.
DOI
10.1364/iprsn.2022.itu3b.1

Related papers

Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light

Han-Sen Zhong, Yu-Hao Deng, Jian Qin +23 more

We report phase-programmable Gaussian boson sampling (GBS) which produces up to 113 photon detection events out of a 144-mode photonic circuit. A new high-brightness and scalable quantum light source is developed, exploring the idea of stimulated emission of squeezed photons, which has simultaneously near-unity purity and efficiency. This GBS is programmable by tuning the phase of the input squeezed states. The obtained samples are efficiently validated by inferring from computationally friendly subsystems, which rules out hypotheses including distinguishable photons and thermal states. We show that our GBS experiment passes a nonclassicality test based on inequality constraints, and we reveal nontrivial genuine high-order correlations in the GBS samples, which are evidence of robustness against possible classical simulation schemes. This photonic quantum computer, Jiuzhang 2.0, yields a Hilbert space dimension up to ∼10^{43}, and a sampling rate ∼10^{24} faster than using brute-force simulation on classical supercomputers.

arXiv:2106.15534•Physical Review Letters•Oct 25, 2021•433 citations

Simulating complex networks in phase space: Gaussian boson sampling

P. D. Drummond, Bogdan Opanchuk, Alexander S. Dellios +1 more

We show how phase-space simulations of Gaussian quantum states in a photonic network permit verification of measurable correlations of Gaussian boson sampling (GBS) quantum computers. Our results agree with experiments for up to 100-th order correlations, provided decoherence is included. We extend this to more than 16,000 modes, and describe how to simulate genuine multipartite entanglement.

Quantum Information and Measurement (QIM)•Jan 1, 2021•2 citations

Experimental Demonstration of Gaussian Boson Sampling with Displacement

Guillaume Thekkadath, S. Sempere-Llagostera, Bryn A. Bell +3 more

Gaussian boson sampling (GBS) is a quantum sampling task in which one has to draw samples from the photon-number distribution of a large-dimensional nonclassical squeezed state of light.In an effort to make this task intractable for a classical computer, experiments building GBS machines have mainly focused on increasing the dimensionality and squeezing strength of the nonclassical light.However, no experiment has yet demonstrated the ability to displace the squeezed state in phase space, which is generally required for practical applications of GBS.In this work, we build a GBS machine that achieves the displacement by injecting a laser beam alongside a two-mode squeezed vacuum state into a 15-mode interferometer.We focus on two new capabilities.Firstly, we use the displacement to reconstruct the multimode Gaussian state at the output of the interferometer.Our reconstruction technique is in situ and requires only three measurement settings regardless of the state dimension.Secondly, we study how the addition of classical laser light in our GBS machine affects the complexity of sampling its output photon statistics.We introduce and validate approximate semiclassical models that reduce the computational cost when a significant fraction of the detected light is classical.

arXiv:2202.00634•PRX Quantum•May 17, 2022•18 citations

Simulating complex networks in phase space: Gaussian boson sampling

P. D. Drummond, Bogdan Opanchuk, Alexander S. Dellios +1 more

We show how phase-space simulations of quantum states in a linear photonic network permit the verification of measurable probabilities and entanglement. We compare our predictions with recent Gaussian boson sampling experiments of Zhong et al. These use squeezed inputs and efficient ``on-off'' detectors, with up to 76th-order measured coincidence counts in the data. We introduce a general definition of grouped ``on-off'' detection probabilities for this purpose. The positive-$P$ phase-space method is used to compute any grouped or marginal click probabilities. Additional decoherence is included to obtain agreement between theory and experiment. The only limitation in estimating grouped probabilities is the computational sampling error, which is similar in magnitude to the experimental sampling error. The results obtained and graphed here are from first-order up to 16 000th-order grouped count probabilities. However, any order between these is also computable. We extend these results to include grouped probabilities with multidimensional outcomes that have a polynomial number of points. We also analyze quadrature detection experiments and show how to simulate genuine multipartite entanglement using Wigner phase-space methods.

arXiv:2102.10341•Physical Review A•Jan 26, 2022•33 citations

Gaussian boson sampling with 1,024 squeezed states in 8,176 modes

H C Liu, Hao Su, Yu-Hao Deng +34 more

Abstract The creation of large-scale, high-fidelity quantum computers is not only a fundamental scientific endeavour in itself, but also provides increasingly robust proofs of quantum computational advantage (QCA) in the presence of unavoidable noise and the dynamic competition with classical algorithm improvements. To overcome the biggest challenge of photon-based QCA experiments, photon loss, we report new Gaussian boson sampling(GBS) experiments with 1024 high-efficiency squeezed states injected into a hybrid spatial-temporal encoded, 8176-mode, programmable photonic quantum processor, Jiuzhang 4.0, which produces up to 3050 photon detection events. Our experimental results outperform all classical spoofing algorithms, particularly the matrix product state (MPS) method, which was recently proposed to utilise photon loss to reduce the classical simulation complexity of GBS. Using the state-of-the-art MPS algorithm on the most powerful supercomputer EI Capitan, it would take > 10^42 years to construct the required tensor network for simulation, while our Jiuzhang 4.0 quantum computer takes 25.6 μs to produce a sample. This work establishes a new frontier of QCA and paves the way to fault-tolerant photonic quantum computing hardware.

Nature•May 13, 2026•4 citations

Simulating Gaussian boson sampling quantum computers

Alexander S. Dellios, M. D. Reid, P. D. Drummond

Abstract A growing cohort of experimental linear photonic networks implementing Gaussian boson sampling (GBS) have now claimed quantum advantage. However, many open questions remain on how to effectively verify these experimental results, as scalable methods are needed that fully capture the rich array of quantum correlations generated by these photonic quantum computers. In this paper, we briefly review recent theoretical methods to simulate experimental GBS networks. We focus mostly on methods that use phase-space representations of quantum mechanics, as these methods are highly scalable and can be used to validate experimental outputs and claims of quantum advantage for a variety of input states, ranging from the ideal pure squeezed vacuum state to more realistic thermalized squeezed states. A brief overview of the theory of GBS, recent experiments, and other types of methods are also presented. Although this is not an exhaustive review, we aim to provide a brief introduction to phase-space methods applied to linear photonic networks to encourage further theoretical investigations.

arXiv:2308.00908•AAPPS bulletin•Nov 29, 2023•13 citations
We report phase-programmable Gaussian boson sampling (GBS) which produces up to 113 photon detection events out of a 144-mode photonic circuit. A new high-brightness and scalable quantum light source is developed, exploring the idea of stimulated emission of squeezed photons, which has simultaneously near-unity purity and efficiency. This GBS is programmable by tuning the phase of the input squeezed states. The obtained samples are efficiently validated by inferring from computationally friendly subsystems, which rules out hypotheses including distinguishable photons and thermal states. We show that our GBS experiment passes a nonclassicality test based on inequality constraints, and we reveal nontrivial genuine high-order correlations in the GBS samples, which are evidence of robustness against possible classical simulation schemes. This photonic quantum computer, Jiuzhang 2.0, yields a Hilbert space dimension up to ∼10^{43}, and a sampling rate ∼10^{24} faster than using brute-force simulation on classical supercomputers.
Gaussian boson sampling (GBS) is a quantum sampling task in which one has to draw samples from the photon-number distribution of a large-dimensional nonclassical squeezed state of light.In an effort to make this task intractable for a classical computer, experiments building GBS machines have mainly focused on increasing the dimensionality and squeezing strength of the nonclassical light.However, no experiment has yet demonstrated the ability to displace the squeezed state in phase space, which is generally required for practical applications of GBS.In this work, we build a GBS machine that achieves the displacement by injecting a laser beam alongside a two-mode squeezed vacuum state into a 15-mode interferometer.We focus on two new capabilities.Firstly, we use the displacement to reconstruct the multimode Gaussian state at the output of the interferometer.Our reconstruction technique is in situ and requires only three measurement settings regardless of the state dimension.Secondly, we study how the addition of classical laser light in our GBS machine affects the complexity of sampling its output photon statistics.We introduce and validate approximate semiclassical models that reduce the computational cost when a significant fraction of the detected light is classical.
We show how phase-space simulations of quantum states in a linear photonic network permit the verification of measurable probabilities and entanglement. We compare our predictions with recent Gaussian boson sampling experiments of Zhong et al. These use squeezed inputs and efficient ``on-off'' detectors, with up to 76th-order measured coincidence counts in the data. We introduce a general definition of grouped ``on-off'' detection probabilities for this purpose. The positive-PPP phase-space method is used to compute any grouped or marginal click probabilities. Additional decoherence is included to obtain agreement between theory and experiment. The only limitation in estimating grouped probabilities is the computational sampling error, which is similar in magnitude to the experimental sampling error. The results obtained and graphed here are from first-order up to 16 000th-order grouped count probabilities. However, any order between these is also computable. We extend these results to include grouped probabilities with multidimensional outcomes that have a polynomial number of points. We also analyze quadrature detection experiments and show how to simulate genuine multipartite entanglement using Wigner phase-space methods.
Abstract The creation of large-scale, high-fidelity quantum computers is not only a fundamental scientific endeavour in itself, but also provides increasingly robust proofs of quantum computational advantage (QCA) in the presence of unavoidable noise and the dynamic competition with classical algorithm improvements. To overcome the biggest challenge of photon-based QCA experiments, photon loss, we report new Gaussian boson sampling(GBS) experiments with 1024 high-efficiency squeezed states injected into a hybrid spatial-temporal encoded, 8176-mode, programmable photonic quantum processor, Jiuzhang 4.0, which produces up to 3050 photon detection events. Our experimental results outperform all classical spoofing algorithms, particularly the matrix product state (MPS) method, which was recently proposed to utilise photon loss to reduce the classical simulation complexity of GBS. Using the state-of-the-art MPS algorithm on the most powerful supercomputer EI Capitan, it would take > 10^42 years to construct the required tensor network for simulation, while our Jiuzhang 4.0 quantum computer takes 25.6 μs to produce a sample. This work establishes a new frontier of QCA and paves the way to fault-tolerant photonic quantum computing hardware.
Abstract A growing cohort of experimental linear photonic networks implementing Gaussian boson sampling (GBS) have now claimed quantum advantage. However, many open questions remain on how to effectively verify these experimental results, as scalable methods are needed that fully capture the rich array of quantum correlations generated by these photonic quantum computers. In this paper, we briefly review recent theoretical methods to simulate experimental GBS networks. We focus mostly on methods that use phase-space representations of quantum mechanics, as these methods are highly scalable and can be used to validate experimental outputs and claims of quantum advantage for a variety of input states, ranging from the ideal pure squeezed vacuum state to more realistic thermalized squeezed states. A brief overview of the theory of GBS, recent experiments, and other types of methods are also presented. Although this is not an exhaustive review, we aim to provide a brief introduction to phase-space methods applied to linear photonic networks to encourage further theoretical investigations.