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

Optical Fiber Communication Conference

A Gaussian Boson Sampling Based Ising Solver

Hong‐Hu Zhu, H. S. Chen, Hong Nian Cai, Tianyi Chen, L. K. Chin, X. D. Zhang, A. Q. Liu

Published Jan 1, 2024• 0 citations
Publisher

Abstract

This paper presents an on-chip Gaussian Boson Sampling microprocessor, powered by photonic technology, proficiently solving graph combinatorial problems like max cut and vertex cover. It demonstrates photonic quantum computing's potential to accelerate traditionally insurmountable computations.
DOI
10.1364/ofc.2024.tu3c.2

Related papers

A Gaussian Boson Sampling for Graph Computation

Hong‐Hu Zhu, H. S. Chen, S. Y. Li +5 more

A gaussian boson sampling microprocessor for graph applications, such as solving task assignment, Boolean satisfiability, graph clique, max cut, vertex cover problems, is demonstrated and achieved. It manifests the ability of photonic quantum computing to realize practical applications for conventionally intractable computations.

•Jan 1, 2023•1 citation

A Dynamically Programmable Quantum Photonic Microprocessor for Graph Computation

Huihui Zhu, Haosen Chen, Shuyi Li +14 more

Abstract Quantum computing has grown extensively, especially in system design and development, and the current research focus has gradually evolved from validating quantum advantage to practical applications. In particular, nondeterministic‐polynomial‐time (NP)‐complete problems are central in numerous important application areas. Still, in practice, it is difficult to solved efficiently with conventional computers, limited by the exponential jump in hardness. Here, a quantum photonic microprocessor based on Gaussian boson sampling (GBS) that offers dynamic programmability to solve various graph‐related NP‐complete problems is demonstrated. The system with optical, electrical, and thermal packaging implements a GBS with 16 modes of single‐mode squeezed vacuum states, a universal programmable 16‐mode interferometer, and a single photon readout on all outputs with high accuracy, generality, and controllability. The developed system is applied to demonstrate applications in solving NP‐complete problems, manifesting the ability of photonic quantum computing to realize practical applications for conventionally intractable computations. The GBS‐based quantum photonic microprocessor is applied to solve task assignment, Boolean satisfiability, graph clique, max cut, and vertex cover. These demonstrations suggest an excellent benchmarking platform, paving the way toward large‐scale combinatorial optimization.

Laser & Photonics Review•Nov 27, 2023•18 citations

Employing Integrated Quantum Photonic Computers for Gaussian Boson Sampling

Mehrdad Ghasemi, Hassan Kaatuzian, Houshyar Noshad +3 more

Gaussian boson sampling (GBS) is a tool for demonstrating quantum computational utilities and also exhibits mathematical connections to specific graph-related and quantum chemistry problems. It has been suggested that the samples generated from GBS could be utilized to improve stochastic algorithms in searching for certain graph features. In this study, we employed X8, a noisy intermediate-scale quantum computer, to address graph problems. The samples were produced from a 4-mode quantum photonic processor. This research represents a step toward analyzing Gaussian boson sampling as a tool for solving real-world problems using existing noisy intermediate-scale quantum computers and aims to encourage the development of quantum algorithms.

•May 14, 2024•1 citation

Solving Combinatorial Optimization Problems on a Photonic Quantum Computer

Mateusz Slysz, Krzysztof Kurowski, Grzegorz Waligóra

Combinatorial optimization problems pose significant computational challenges across various fields, from logistics to cryptography. Traditional computational methods often struggle with their exponential complexity, motivating exploration into alternative paradigms such as quantum computing. In this paper, we investigate the application of photonic quantum computing to solve combinatorial optimization problems. Leveraging the principles of quantum mechanics, we demonstrate how photonic quantum computers can efficiently explore solution spaces and identify optimal solutions for a range of combinatorial problems. We provide an overview of quantum algorithms tailored for combinatorial optimization for different quantum architectures (boson sampling, quantum annealing and gate-based quantum computing). Additionally, we discuss the advantages and challenges of implementing those algorithms on photonic quantum hardware. Through experiments run on an 8-qumode photonic quantum device, as well as numerical simulations, we evaluate the performance of photonic quantum computers in solving representative combinatorial optimization problems, such as the Max-Cut problem and the Job Shop Scheduling Problem.

arXiv:2409.13781•Sep 19, 2024•1 citation

A Quantum Photonic Approach to Graph Coloring

Jesua Epequin, Pascale Bendotti, Joseph Mikael

Gaussian Boson Sampling (GBS) is a quantum computational model that leverages linear optics to solve sampling problems believed to be classically intractable. Recent experimental breakthroughs have demonstrated quantum advantage using GBS, motivating its application to real-world combinatorial optimization problems. In this work, we reformulate the graph coloring problem as an integer programming problem using the independent set formulation. This enables the use of GBS to identify cliques in the complement graph, which correspond to independent sets in the original graph. Our method is benchmarked against classical heuristics and exact algorithms on two sets of instances: Erdős-Rényi random graphs and graphs derived from a smart-charging use case. The results demonstrate that GBS can provide competitive solutions, highlighting its potential as a quantum-enhanced heuristic for graph-based optimization.

quant-pharXiv:2601.20263•Jan 29, 2026•0 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
Abstract Quantum computing has grown extensively, especially in system design and development, and the current research focus has gradually evolved from validating quantum advantage to practical applications. In particular, nondeterministic‐polynomial‐time (NP)‐complete problems are central in numerous important application areas. Still, in practice, it is difficult to solved efficiently with conventional computers, limited by the exponential jump in hardness. Here, a quantum photonic microprocessor based on Gaussian boson sampling (GBS) that offers dynamic programmability to solve various graph‐related NP‐complete problems is demonstrated. The system with optical, electrical, and thermal packaging implements a GBS with 16 modes of single‐mode squeezed vacuum states, a universal programmable 16‐mode interferometer, and a single photon readout on all outputs with high accuracy, generality, and controllability. The developed system is applied to demonstrate applications in solving NP‐complete problems, manifesting the ability of photonic quantum computing to realize practical applications for conventionally intractable computations. The GBS‐based quantum photonic microprocessor is applied to solve task assignment, Boolean satisfiability, graph clique, max cut, and vertex cover. These demonstrations suggest an excellent benchmarking platform, paving the way toward large‐scale combinatorial optimization.
Gaussian boson sampling (GBS) is a tool for demonstrating quantum computational utilities and also exhibits mathematical connections to specific graph-related and quantum chemistry problems. It has been suggested that the samples generated from GBS could be utilized to improve stochastic algorithms in searching for certain graph features. In this study, we employed X8, a noisy intermediate-scale quantum computer, to address graph problems. The samples were produced from a 4-mode quantum photonic processor. This research represents a step toward analyzing Gaussian boson sampling as a tool for solving real-world problems using existing noisy intermediate-scale quantum computers and aims to encourage the development of quantum algorithms.
Combinatorial optimization problems pose significant computational challenges across various fields, from logistics to cryptography. Traditional computational methods often struggle with their exponential complexity, motivating exploration into alternative paradigms such as quantum computing. In this paper, we investigate the application of photonic quantum computing to solve combinatorial optimization problems. Leveraging the principles of quantum mechanics, we demonstrate how photonic quantum computers can efficiently explore solution spaces and identify optimal solutions for a range of combinatorial problems. We provide an overview of quantum algorithms tailored for combinatorial optimization for different quantum architectures (boson sampling, quantum annealing and gate-based quantum computing). Additionally, we discuss the advantages and challenges of implementing those algorithms on photonic quantum hardware. Through experiments run on an 8-qumode photonic quantum device, as well as numerical simulations, we evaluate the performance of photonic quantum computers in solving representative combinatorial optimization problems, such as the Max-Cut problem and the Job Shop Scheduling Problem.
Gaussian Boson Sampling (GBS) is a quantum computational model that leverages linear optics to solve sampling problems believed to be classically intractable. Recent experimental breakthroughs have demonstrated quantum advantage using GBS, motivating its application to real-world combinatorial optimization problems. In this work, we reformulate the graph coloring problem as an integer programming problem using the independent set formulation. This enables the use of GBS to identify cliques in the complement graph, which correspond to independent sets in the original graph. Our method is benchmarked against classical heuristics and exact algorithms on two sets of instances: Erdős-Rényi random graphs and graphs derived from a smart-charging use case. The results demonstrate that GBS can provide competitive solutions, highlighting its potential as a quantum-enhanced heuristic for graph-based optimization.
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.