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

• URL: http://arxiv.org/abs/2508.09092v3
• Date: Sun, 24 Aug 2025 08:50:25 GMT
• Title: Robust quantum computational advantage with programmable 3050-photon Gaussian boson sampling
• Authors: Hua-Liang Liu, Hao Su, Si-Qiu Gong, Yi-Chao Gu, Hao-Yang Tang, Meng-Hao Jia, Qian Wei, Yukun Song, Dongzhou Wang, Mingyang Zheng, Faxi Chen, Libo Li, Siyu Ren, Xuezhi Zhu, Meihong Wang, Yaojian Chen, Yanfei Liu, Longsheng Song, Pengyu Yang, Junshi Chen, Hong An, Lei Zhang, Lin Gan, Guangwen Yang, Jia-Min Xu, Yu-Ming He, Hui Wang, Han-Sen Zhong, Ming-Cheng Chen, Xiao Jiang, Li Li, Nai-Le Liu, Yu-Hao Deng, Xiao-Long Su, Qiang Zhang, Chao-Yang Lu, Jian-Wei Pan,
• Abstract summary: This work establishes a new frontier of QCA and paves the way to fault-tolerant photonic quantum computing hardware.<n>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.<n>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.
• Score: 33.93010841534828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 $\mu$s to produce a sample. This work establishes a new frontier of QCA and paves the way to fault-tolerant photonic quantum computing hardware.

Related papers

• hqQUBO: A Hybrid-querying Quantum Optimization Model Validated with 16-qubits on an Ion Trap Quantum Computer for Life Science Applications [4.529849615658088]
  We present the largest-scale implementation of digital simulation using up to 16 qubits on a trapped-ion quantum computer for life science problem.<n>Our work paves the way towards large-scale simulations of life science tasks on real quantum processors.
  arXiv  Detail & Related papers  (2025-06-02T11:36:30Z)
• phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale [0.8223023312645978]
  Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms.<n>We present a full-state vector simulation algorithm and software implementation designed to perform HPC simulation of layers of rotations around a string of Pauli operators.
  arXiv  Detail & Related papers  (2025-04-24T18:41:23Z)
• HQViT: Hybrid Quantum Vision Transformer for Image Classification [48.72766405978677]
  We propose a Hybrid Quantum Vision Transformer (HQViT) to accelerate model training while enhancing model performance.<n>HQViT introduces whole-image processing with amplitude encoding to better preserve global image information without additional positional encoding.<n>Experiments across various computer vision datasets demonstrate that HQViT outperforms existing models, achieving a maximum improvement of up to $10.9%$ (on the MNIST 10-classification task) over the state of the art.
  arXiv  Detail & Related papers  (2025-04-03T16:13:34Z)
• Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor [65.64902746326833]
  Zuchongzhi 3.0 is a superconducting quantum computer prototype, comprising 105 qubits.<n>Experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds.
  arXiv  Detail & Related papers  (2024-12-16T16:11:26Z)
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization [39.58317527488534]
  We present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO) problems. Our protocol is experimentally validated using 156 qubits on an IBM quantum processor with a heavy-hex architecture.
  arXiv  Detail & Related papers  (2024-09-05T17:38:59Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• A general-purpose single-photon-based quantum computing platform [36.56899230501635]
  We report a first user-ready general-purpose quantum computing prototype based on single photons. The device comprises a high-efficiency quantum-dot single-photon source feeding a universal linear optical network on a reconfigurable chip. We report on a first heralded 3-photon entanglement generation, a key milestone toward measurement-based quantum computing.
  arXiv  Detail & Related papers  (2023-06-01T16:35:55Z)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Solving Graph Problems Using Gaussian Boson Sampling [22.516585968074146]
  We use a noisy intermediate-scale quantum computer to solve graph problems. We experimentally observe the presence of GBS enhancement with large photon-click number and an enhancement under certain noise. Our work is a step toward testing real-world problems using the existing intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2023-02-02T08:25:47Z)
• Simulation of Entanglement Generation between Absorptive Quantum Memories [56.24769206561207]
  We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories. We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe. We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
  arXiv  Detail & Related papers  (2022-12-17T05:51:17Z)
• Experimental optimal verification of three-dimensional entanglement on a silicon chip [3.9805421324529133]
  We experimentally implement an optimal quantum verification strategy on a three-dimensional maximally entangled state. A 95% confidence is achieved from 1190 copies to verify the target quantum state. Our results indicate that quantum state verification could serve as an efficient tool for complex quantum measurement tasks.
  arXiv  Detail & Related papers  (2022-08-27T07:45:21Z)
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light [32.20791352792308]
  We report a new GBS experiment that produces up to 113 detection events out of a 144-mode photonic circuit. We develop a new high-brightness and scalable quantum light source, exploring the idea of stimulated squeezed photons. The photonic quantum computer, Jiuzhang 2.0, yields a Hilbert space dimension up to $1043$, and a sampling rate $1024$ faster than using brute-force simulation.
  arXiv  Detail & Related papers  (2021-06-29T16:11:29Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.