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

Physical Review Letters

Enhancing Image Recognition Using Gaussian Boson Sampling

Anonymous, Ming-Cheng Chen, Hua-Liang Liu, Hao Su, Yi-Chao Gu, Haoyang Tang, Meng-Hao Jia, Yu-Hao Deng, Sun Han-tao, Qian Wei, Hui Wang, Han-Sen Zhong, Xiao Qiang Jiang, Li Li, Nai-Le Liu, Dong-Ling Deng, Chao‐Yang Lu, Jian-Wei Pan

Published Jul 14, 2026• 0 citations
Publisher

Abstract

Gaussian boson sampling (GBS) is one of the leading approaches for demonstrating quantum computational advantage, but its application to practical real-world problems remains a central challenge. Here, we propose a GBS-based image recognition scheme inspired by extreme learning machine to enhance the performance of perceptron and implement it using our latest GBS device, jiǔzhāng 4.0. By avoiding in situ programmability of the photonic circuit, the scheme substantially reduces experimental overhead while retaining a large, fixed random feature map. Our approach utilizes an 8176-mode temporal-spatial hybrid encoding photonic processor, achieving approximately 2200 average photon clicks in the quantum computational advantage regime. We apply this scheme to classify images from the MNIST and Fashion-MNIST datasets, achieving a testing accuracy of 95.86% on MNIST and 85.95% on Fashion-MNIST, respectively. These results surpass both classical linear-kernel support vector machines and the three previous physical extreme-learning-machine experiments. In addition, we systematically explore the influence of three key hyperparameters and the efficiency of GBS in our experiments. Our results not only demonstrate the potential of GBS in real-world machine learning applications but will also inspire further advancements in powerful machine learning schemes utilizing GBS technology.

DOI
10.1103/9mb1-t3w4

Related papers

Enhanced Image Recognition Using Gaussian Boson Sampling

Si-Qiu Gong, Ming-Cheng Chen, Hua-Liang Liu +13 more

Gaussian boson sampling (GBS) has emerged as a promising quantum computing paradigm, demonstrating its potential in various applications. However, most existing works focus on theoretical aspects or simple tasks, with limited exploration of its capabilities in solving real-world practical problems. In this work, we propose a novel GBS-based image recognition scheme inspired by extreme learning machine (ELM) to enhance the performance of perceptron and implement it using our latest GBS device, Jiuzhang. Our approach utilizes an 8176-mode temporal-spatial hybrid encoding photonic processor, achieving approximately 2200 average photon clicks in the quantum computational advantage regime. We apply this scheme to classify images from the MNIST and Fashion-MNIST datasets, achieving a testing accuracy of 95.86% on MNIST and 85.95% on Fashion-MNIST. These results surpass those of classical method SVC with linear kernel and previous physical ELM-based experiments. Additionally, we explore the influence of three hyperparameters and the efficiency of GBS in our experiments. This work not only demonstrates the potential of GBS in real-world machine learning applications but also aims to inspire further advancements in powerful machine learning schemes utilizing GBS technology.

arXiv:2506.19707•Jun 24, 2025•0 citations

GBS-Assisted Quantum Unsupervised Machine Learning on a Universal Programmable Integrated Quantum Chip

Huihui Zhu, Wei Luo, Rudai Yan +11 more

Quantum machine learning stands poised as a forefront application for near-term quantum devices, addressing scalability challenges posed by classical computers in handling large datasets. Gaussian boson sampling (GBS), an intricate quantum algorithm deemed computationally infeasible for classical counterparts, represents a substantial leap forward in computational tasks. However, to date, the benefits of GBS-assisted quantum unsupervised machine learning are not experimentally demonstrated. Here, we present the first experimental implementation of quantum unsupervised machine learning using the GBS protocol with a universal programmable integrated photonic chip. The experimental system contains 16 squeezing sources, a universal programmable unitary matrix network of 16 modes, and a multi-channel single-photon detector, producing substantial output data crucial for 2 typical types of unsupervised tasks: feature extraction and generative network. Compared to classical approaches, the study demonstrates quantum-enhanced capability in extracting complex features from high-dimensional spaces and improved performance in generating arbitrary curve points and reconstructing handwritten digit images. This work not only underscores the potential of GBS in expressing high-dimensional features but also charts a path toward practical implementations within scalable, dimension-enhanced quantum unsupervised machine learning frameworks. The quantum unsupervised machine learning paradigm, offering theoretical acceleration and reduced training parameters for high-dimensional datasets, shows significant promise for advancing real-world applications of quantum technologies.

Research•Jan 1, 2025•2 citations

Solving Graph Problems Using Gaussian Boson Sampling

Yu‐Hao Deng, Si-Qiu Gong, Yi-Chao Gu +21 more

Gaussian boson sampling (GBS) is not only a feasible protocol for demonstrating quantum computational advantage, but also mathematically associated with certain graph-related and quantum chemistry problems. In particular, it is proposed that the generated samples from the GBS could be harnessed to enhance the classical stochastic algorithms in searching some graph features. Here, we use Jiǔzhāng, a noisy intermediate-scale quantum computer, to solve graph problems. The samples are generated from a 144-mode fully connected photonic processor, with photon click up to 80 in the quantum computational advantage regime. We investigate the open question of whether the GBS enhancement over the classical stochastic algorithms persists-and how it scales-with an increasing system size on noisy quantum devices in the computationally interesting regime. We experimentally observe the presence of GBS enhancement with a large photon-click number and a robustness of the enhancement under certain noise. Our work is a step toward testing real-world problems using the existing noisy intermediate-scale quantum computers and hopes to stimulate the development of more efficient classical and quantum-inspired algorithms.

arXiv:2302.00936•Physical Review Letters•May 9, 2023•60 citations

Benchmarking Quantum Extreme Learning based on Gaussian Boson Sampling

Daniel Montesinos, Gian Luca Giorgi, Roberta Zambrini

Reservoir models offer a hardware-efficient learning paradigm for noisy intermediate-scale quantum devices by exploiting untrained quantum dynamics as a fixed feature map and restricting optimization to a simple classical readout layer. We propose a quantum extreme learning machine implemented using gaussian boson sampling and an encoding strategy that achieves high classification accuracy while reducing optical resource requirements. Classical inputs are jointly encoded in the squeezing parameters and in the interferometer unitary, enabling sampling-based, highly nonlinear feature maps while leveraging large-scale GBS output statistics, which are conjectured to be classically intractable. We systematically compare multiple families of quantum features accessible in the same setup and find that photon-number sampling probabilities provide the best performance, consistent with their higher effective feature dimensionality. Finally, we benchmark against classical nonlinear baselines and analyse robustness under noisy scenarios, showing competitive performance with fewer trainable parameters and indicating practical promise for near-term photonic implementations.

quant-pharXiv:2606.15230•Jun 16, 2026•0 citations

Robust quantum computational advantage with programmable 3050-photon Gaussian boson sampling

Hua-Liang Liu, Su, Hao, Si-Qiu Gong +34 more

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.

arXiv:2508.09092•Aug 12, 2025•6 citations

Certification of Gaussian Boson Sampling via graphs feature vectors and kernels

Taira Giordani, Valerio Mannucci, Nicolò Spagnolo +4 more

Abstract Gaussian Boson Sampling (GBS) is a non-universal model for quantum computing inspired by the original formulation of the Boson Sampling (BS) problem. Nowadays, it represents a paradigmatic quantum platform to reach the quantum advantage regime in a specific computational model. Indeed, thanks to the implementation in photonics-based processors, the latest GBS experiments have reached a level of complexity where the quantum apparatus has solved the task faster than currently up-to-date classical strategies. In addition, recent studies have identified possible applications beyond the inherent sampling task. In particular, a direct connection between photon counting of a genuine GBS device and the number of perfect matchings in a graph has been established. In this work, we propose to exploit such a connection to benchmark GBS experiments. We interpret the properties of the feature vectors of the graph encoded in the device as a signature of correct sampling from the true input state. Within this framework, two approaches are presented. The first method exploits the distributions of graph feature vectors and classification via neural networks. The second approach investigates the distributions of graph kernels. Our results provide a novel approach to the actual need for tailored algorithms to benchmark large-scale Gaussian Boson Samplers.

arXiv:2202.07711•Quantum Science and Technology•Sep 30, 2022•9 citations
Gaussian boson sampling (GBS) is one of the leading approaches for demonstrating quantum computational advantage, but its application to practical real-world problems remains a central challenge. Here, we propose a GBS-based image recognition scheme inspired by extreme learning machine to enhance the performance of perceptron and implement it using our latest GBS device, jiǔzhāng 4.0. By avoiding in situ programmability of the photonic circuit, the scheme substantially reduces experimental overhead while retaining a large, fixed random feature map. Our approach utilizes an 8176-mode temporal-spatial hybrid encoding photonic processor, achieving approximately 2200 average photon clicks in the quantum computational advantage regime. We apply this scheme to classify images from the MNIST and Fashion-MNIST datasets, achieving a testing accuracy of 95.86% on MNIST and 85.95% on Fashion-MNIST, respectively. These results surpass both classical linear-kernel support vector machines and the three previous physical extreme-learning-machine experiments. In addition, we systematically explore the influence of three key hyperparameters and the efficiency of GBS in our experiments. Our results not only demonstrate the potential of GBS in real-world machine learning applications but will also inspire further advancements in powerful machine learning schemes utilizing GBS technology.
Gaussian boson sampling (GBS) has emerged as a promising quantum computing paradigm, demonstrating its potential in various applications. However, most existing works focus on theoretical aspects or simple tasks, with limited exploration of its capabilities in solving real-world practical problems. In this work, we propose a novel GBS-based image recognition scheme inspired by extreme learning machine (ELM) to enhance the performance of perceptron and implement it using our latest GBS device, Jiuzhang. Our approach utilizes an 8176-mode temporal-spatial hybrid encoding photonic processor, achieving approximately 2200 average photon clicks in the quantum computational advantage regime. We apply this scheme to classify images from the MNIST and Fashion-MNIST datasets, achieving a testing accuracy of 95.86% on MNIST and 85.95% on Fashion-MNIST. These results surpass those of classical method SVC with linear kernel and previous physical ELM-based experiments. Additionally, we explore the influence of three hyperparameters and the efficiency of GBS in our experiments. This work not only demonstrates the potential of GBS in real-world machine learning applications but also aims to inspire further advancements in powerful machine learning schemes utilizing GBS technology.
Quantum machine learning stands poised as a forefront application for near-term quantum devices, addressing scalability challenges posed by classical computers in handling large datasets. Gaussian boson sampling (GBS), an intricate quantum algorithm deemed computationally infeasible for classical counterparts, represents a substantial leap forward in computational tasks. However, to date, the benefits of GBS-assisted quantum unsupervised machine learning are not experimentally demonstrated. Here, we present the first experimental implementation of quantum unsupervised machine learning using the GBS protocol with a universal programmable integrated photonic chip. The experimental system contains 16 squeezing sources, a universal programmable unitary matrix network of 16 modes, and a multi-channel single-photon detector, producing substantial output data crucial for 2 typical types of unsupervised tasks: feature extraction and generative network. Compared to classical approaches, the study demonstrates quantum-enhanced capability in extracting complex features from high-dimensional spaces and improved performance in generating arbitrary curve points and reconstructing handwritten digit images. This work not only underscores the potential of GBS in expressing high-dimensional features but also charts a path toward practical implementations within scalable, dimension-enhanced quantum unsupervised machine learning frameworks. The quantum unsupervised machine learning paradigm, offering theoretical acceleration and reduced training parameters for high-dimensional datasets, shows significant promise for advancing real-world applications of quantum technologies.
Gaussian boson sampling (GBS) is not only a feasible protocol for demonstrating quantum computational advantage, but also mathematically associated with certain graph-related and quantum chemistry problems. In particular, it is proposed that the generated samples from the GBS could be harnessed to enhance the classical stochastic algorithms in searching some graph features. Here, we use Jiǔzhāng, a noisy intermediate-scale quantum computer, to solve graph problems. The samples are generated from a 144-mode fully connected photonic processor, with photon click up to 80 in the quantum computational advantage regime. We investigate the open question of whether the GBS enhancement over the classical stochastic algorithms persists-and how it scales-with an increasing system size on noisy quantum devices in the computationally interesting regime. We experimentally observe the presence of GBS enhancement with a large photon-click number and a robustness of the enhancement under certain noise. Our work is a step toward testing real-world problems using the existing noisy intermediate-scale quantum computers and hopes to stimulate the development of more efficient classical and quantum-inspired algorithms.
Reservoir models offer a hardware-efficient learning paradigm for noisy intermediate-scale quantum devices by exploiting untrained quantum dynamics as a fixed feature map and restricting optimization to a simple classical readout layer. We propose a quantum extreme learning machine implemented using gaussian boson sampling and an encoding strategy that achieves high classification accuracy while reducing optical resource requirements. Classical inputs are jointly encoded in the squeezing parameters and in the interferometer unitary, enabling sampling-based, highly nonlinear feature maps while leveraging large-scale GBS output statistics, which are conjectured to be classically intractable. We systematically compare multiple families of quantum features accessible in the same setup and find that photon-number sampling probabilities provide the best performance, consistent with their higher effective feature dimensionality. Finally, we benchmark against classical nonlinear baselines and analyse robustness under noisy scenarios, showing competitive performance with fewer trainable parameters and indicating practical promise for near-term photonic implementations.
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 > 104210^{42}1042 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 Gaussian Boson Sampling (GBS) is a non-universal model for quantum computing inspired by the original formulation of the Boson Sampling (BS) problem. Nowadays, it represents a paradigmatic quantum platform to reach the quantum advantage regime in a specific computational model. Indeed, thanks to the implementation in photonics-based processors, the latest GBS experiments have reached a level of complexity where the quantum apparatus has solved the task faster than currently up-to-date classical strategies. In addition, recent studies have identified possible applications beyond the inherent sampling task. In particular, a direct connection between photon counting of a genuine GBS device and the number of perfect matchings in a graph has been established. In this work, we propose to exploit such a connection to benchmark GBS experiments. We interpret the properties of the feature vectors of the graph encoded in the device as a signature of correct sampling from the true input state. Within this framework, two approaches are presented. The first method exploits the distributions of graph feature vectors and classification via neural networks. The second approach investigates the distributions of graph kernels. Our results provide a novel approach to the actual need for tailored algorithms to benchmark large-scale Gaussian Boson Samplers.