A 128-mode reconfigurable 3D photonic chip demonstrates Boson Sampling with 1-4 photons and validates random number generation from the measured distributions.
Robust quantum computational advantage with programmable 3050- photon gaussian boson sampling
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
fields
quant-ph 7years
2026 7verdicts
UNVERDICTED 7representative citing papers
A representation-theoretic framework computes LXEB scores and proves anticoncentration for Fock-state Boson Sampling in the saturated regime using irrep decompositions of bosonic spaces.
For unitaries from local or pairwise interactions, depolarizing noise above a critical strength makes open quantum spin chain dynamics exactly classically simulable by halting growth in the negative Markov chain representation.
A new classical algorithm for Gaussian boson sampling produces outputs closer to exact results than quantum experiments up to 1152 modes and scales efficiently, indicating hardware errors enable classical simulation.
Tensor networks with belief propagation fail to simulate Google's quantum echoes OTOC experiment because the circuits produce largely incompressible entanglement.
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.
citing papers explorer
-
Boson Sampling with a reconfigurable 128 modes 3D integrated photonic circuit
A 128-mode reconfigurable 3D photonic chip demonstrates Boson Sampling with 1-4 photons and validates random number generation from the measured distributions.
-
General framework for anticoncentration and linear cross-entropy benchmarking in photonic quantum advantage experiments
A representation-theoretic framework computes LXEB scores and proves anticoncentration for Fock-state Boson Sampling in the saturated regime using irrep decompositions of bosonic spaces.
-
Quantum-to-Classical Computability Transition via Negative Markov Chains
For unitaries from local or pairwise interactions, depolarizing noise above a critical strength makes open quantum spin chain dynamics exactly classically simulable by halting growth in the negative Markov chain representation.
-
Gaussian boson sampling: Benchmarking quantum advantage
A new classical algorithm for Gaussian boson sampling produces outputs closer to exact results than quantum experiments up to 1152 modes and scales efficiently, indicating hardware errors enable classical simulation.
-
Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment
Tensor networks with belief propagation fail to simulate Google's quantum echoes OTOC experiment because the circuits produce largely incompressible entanglement.
-
Entanglement and circuit complexity in finite-depth random linear optical networks
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
-
Probing the Planck scale with quantum computation
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.