Thermal loss eliminates quantum computational advantage in sampling experiments. New theoretical results show classical computers can efficiently simulate these noisy systems at any fixed loss rate, constraining near-term quantum supremacy claims.
#QuantumAdvantage #BosonSampling #QuantumSimulation
#QuantumAdvantage #BosonSampling #QuantumSimulation
Polynomial-Time Classical Simulation of Noisy Boson and Fermion Sampling
iq.fp2.dev
November 6, 2026 at 7:24 AM
Thermal loss eliminates quantum computational advantage in sampling experiments. New theoretical results show classical computers can efficiently simulate these noisy systems at any fixed loss rate, constraining near-term quantum supremacy claims.
#QuantumAdvantage #BosonSampling #QuantumSimulation
#QuantumAdvantage #BosonSampling #QuantumSimulation
Shows constant-rate photon loss enables polynomial-time classical simulation of boson sampling outputs, challenging claims of quantum advantage in recent experiments like Jiuzhang 4.0 that operate at fixed loss rates.
#BosonSampling #QuantumAdvantage #Research
#BosonSampling #QuantumAdvantage #Research
Classical Efficiency of Lossy Boson Sampling Under Uniform Photon Loss
iq.fp2.dev
November 3, 2026 at 10:04 AM
Shows constant-rate photon loss enables polynomial-time classical simulation of boson sampling outputs, challenging claims of quantum advantage in recent experiments like Jiuzhang 4.0 that operate at fixed loss rates.
#BosonSampling #QuantumAdvantage #Research
#BosonSampling #QuantumAdvantage #Research
Zeigt, dass ein konstanter Photonenverlust eine klassische Polynomsimulation von Boson-Sampling-Ausgängen ermöglicht, was die Ansprüche auf Quantenvorteil in jüngsten Experimenten wie Jiuzhang 4.0 in Frage stellt, die mit festen Verlustquoten arbeiten.
#BosonSampling #Quantenvorteil #Forschung
#BosonSampling #Quantenvorteil #Forschung
Klassische Effizienz des verlustbehafteten Boson-Samplings unter gleichmäßigem Photonenverlust
arxiv.org
November 3, 2026 at 10:05 AM
Zeigt, dass ein konstanter Photonenverlust eine klassische Polynomsimulation von Boson-Sampling-Ausgängen ermöglicht, was die Ansprüche auf Quantenvorteil in jüngsten Experimenten wie Jiuzhang 4.0 in Frage stellt, die mit festen Verlustquoten arbeiten.
#BosonSampling #Quantenvorteil #Forschung
#BosonSampling #Quantenvorteil #Forschung
Proposes scalable method using marginal bunching to certify photon indistinguishability in quantum interferometers with polynomial sampling complexity, enabling robust characterization of Boson Sampling and quantum photonic systems.
#PhotonicQuantum #BosonSampling #Research
#PhotonicQuantum #BosonSampling #Research
In Situ Certification of Multiparticle Indistinguishability in Generic Interferometers
iq.fp2.dev
November 1, 2026 at 12:14 AM
Proposes scalable method using marginal bunching to certify photon indistinguishability in quantum interferometers with polynomial sampling complexity, enabling robust characterization of Boson Sampling and quantum photonic systems.
#PhotonicQuantum #BosonSampling #Research
#PhotonicQuantum #BosonSampling #Research
Byeongseon Go, Hyunseok Jeong
Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss
https://arxiv.org/abs/2610.27065
Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss
https://arxiv.org/abs/2610.27065
October 23, 2026 at 1:57 PM
Byeongseon Go, Hyunseok Jeong
Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss
https://arxiv.org/abs/2610.27065
Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss
https://arxiv.org/abs/2610.27065
Neue klassische Algorithmen mit polynomieller Zeitkomplexität simulieren effizient photonisches BosonSampling mit konstanter Photonenverlustfraktion mittels Höffding-Zerlegung und Farbcodierungsmethoden, erweitern simulierbare Regime und begrenzen Skalierbarkeitsansprüche von ...
Klassische Simulation mit polynomieller Zeitkomplexität von verlustbehaftetem photonischen BosonSampling
arxiv.org
October 21, 2026 at 5:36 AM
Neue klassische Algorithmen mit polynomieller Zeitkomplexität simulieren effizient photonisches BosonSampling mit konstanter Photonenverlustfraktion mittels Höffding-Zerlegung und Farbcodierungsmethoden, erweitern simulierbare Regime und begrenzen Skalierbarkeitsansprüche von ...
New polynomial-time classical algorithms efficiently simulate photonic BosonSampling with constant-fraction photon loss via Höffding decomposition and color-coding methods, extending simulable regimes and constraining quantum advantage scalability claims.
Polynomial-Time Classical Simulation of Lossy Photonic BosonSampling
iq.fp2.dev
October 21, 2026 at 5:34 AM
New polynomial-time classical algorithms efficiently simulate photonic BosonSampling with constant-fraction photon loss via Höffding decomposition and color-coding methods, extending simulable regimes and constraining quantum advantage scalability claims.
Новые полиномиальные классические алгоритмы эффективно моделируют фотонное BosonSampling с постоянной долей потерь фотонов через декомпозицию Хёффдинга и методы цветового кодирования, расширяя моделируемые режимы и ограничивая утверждения о масштабируемости квантового преимуще...
Классическое моделирование фотонного BosonSampling с потерями за полиномиальное время
arxiv.org
October 21, 2026 at 5:37 AM
Новые полиномиальные классические алгоритмы эффективно моделируют фотонное BosonSampling с постоянной долей потерь фотонов через декомпозицию Хёффдинга и методы цветового кодирования, расширяя моделируемые режимы и ограничивая утверждения о масштабируемости квантового преимуще...
אלגוריתמים קלאסיים חדשים בזמן פולינומי מדמים בעיקר את BosonSampling הפוטוני עם הפסד קבוע של חלק מהפוטונים דרך פירוק הופדינג ושיטות צביעה, תוך הרחבת משטרים ניתנים לסימולציה והגבלת טענות על סקלביליות של יתרון קוונטי.
#קוונטום_פוטוני #דגימת_בוזונים #מורכבות_קוונטית
#קוונטום_פוטוני #דגימת_בוזונים #מורכבות_קוונטית
סימולציה קלאסית בזמן פולינומי של BosonSampling פוטוני עם הפסדים
iq.fp2.dev
October 21, 2026 at 5:38 AM
אלגוריתמים קלאסיים חדשים בזמן פולינומי מדמים בעיקר את BosonSampling הפוטוני עם הפסד קבוע של חלק מהפוטונים דרך פירוק הופדינג ושיטות צביעה, תוך הרחבת משטרים ניתנים לסימולציה והגבלת טענות על סקלביליות של יתרון קוונטי.
#קוונטום_פוטוני #דגימת_בוזונים #מורכבות_קוונטית
#קוונטום_פוטוני #דגימת_בוזונים #מורכבות_קוונטית
Nuevos algoritmos clásicos en tiempo polinomial simulan eficientemente BosonSampling fotónico con pérdida de fotones de fracción constante mediante descomposición de Höffding y métodos de codificación de colores, extendiendo regímenes simulables y limitando las afirmaciones so...
Simulación Clásica en Tiempo Polinomial de BosonSampling Fotónico con Pérdidas
iq.fp2.dev
October 21, 2026 at 5:36 AM
Nuevos algoritmos clásicos en tiempo polinomial simulan eficientemente BosonSampling fotónico con pérdida de fotones de fracción constante mediante descomposición de Höffding y métodos de codificación de colores, extendiendo regímenes simulables y limitando las afirmaciones so...
Novos algoritmos clássicos em tempo polinomial simulam eficientemente BosonSampling fotônico com perda de fótons em fração constante via decomposição de Höffding e métodos de codificação de cores, estendendo regimes simuláveis e restringindo as reivindicações de escalabilidade...
Simulação Clássica em Tempo Polinomial de BosonSampling Fotônico com Perdas
arxiv.org
October 21, 2026 at 5:38 AM
Novos algoritmos clássicos em tempo polinomial simulam eficientemente BosonSampling fotônico com perda de fótons em fração constante via decomposição de Höffding e métodos de codificação de cores, estendendo regimes simuláveis e restringindo as reivindicações de escalabilidade...
Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss
https://arxiv.org/pdf/2610.27065
Byeongseon Go, Hyunseok Jeong.
https://arxiv.org/pdf/2610.27065
Byeongseon Go, Hyunseok Jeong.
https://arxiv.org/abs/2610.27065
arXiv abstract link
arxiv.org
October 21, 2026 at 9:32 AM
Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss
https://arxiv.org/pdf/2610.27065
Byeongseon Go, Hyunseok Jeong.
https://arxiv.org/pdf/2610.27065
Byeongseon Go, Hyunseok Jeong.
De nouveaux algorithmes classiques en temps polynomial simulent efficacement le BosonSampling photonique avec une perte de photons à fraction constante via la décomposition de Höffding et les méthodes de codage par couleur, étendant les régimes simulables et contraignant les p...
Simulation classique en temps polynomial du BosonSampling photonique avec pertes
arxiv.org
October 21, 2026 at 5:36 AM
De nouveaux algorithmes classiques en temps polynomial simulent efficacement le BosonSampling photonique avec une perte de photons à fraction constante via la décomposition de Höffding et les méthodes de codage par couleur, étendant les régimes simulables et contraignant les p...
Byeongseon Go, Hyunseok Jeong: Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss https://arxiv.org/abs/2610.27065 https://arxiv.org/pdf/2610.27065 https://arxiv.org/html/2610.27065
October 21, 2026 at 6:59 AM
Byeongseon Go, Hyunseok Jeong: Polynomial-Time Classical Simulation of BosonSampling under Any Constant-Fraction Photon Loss https://arxiv.org/abs/2610.27065 https://arxiv.org/pdf/2610.27065 https://arxiv.org/html/2610.27065
![Emoji Legend
💨x# | "Increased Trending Rate" for a Word (meaningful value; "💨x8 - burger" will mean "burger" is trending at 8 times its own normal rate for this time of day)
🔓 | "Unlocked" Ongoing Emergency Word (such words are not weighted down by their own previous usage; their *ongoing* increased usage--weeks, months, years--would otherwise move them down the list.)
[PREVIOUSLY USED]
⚠️💨# | "Trend Strength Rating"
⚠️🌀💨 | "Trend Strength Rating" (see above)
⚠️🌀 CAT. # | [same; "CAT." = Category, like hurricane]
💬# | 10min Post Count
🆎# | 10min Word Count
🙂# | 10min Emoji Count](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:mcb6n67plnrlx4lg35natk2b/bafkreigp6bgag3jzkool6uxrujpcrwtn6zkd7cbfrmevhaxaqhhewgolmu)
Framework quantifies how dephasing in on-demand single photon arrays affects multi-photon boson sampling outcomes, enabling chip-scale quantum optical circuit design with realistic photon properties.
#PhotonicQuantum #BosonSampling #Research
#PhotonicQuantum #BosonSampling #Research
Boson Sampling with On-Demand Single Photon Arrays: Dephasing Impact Analysis
arxiv.org
October 14, 2026 at 4:58 PM
Framework quantifies how dephasing in on-demand single photon arrays affects multi-photon boson sampling outcomes, enabling chip-scale quantum optical circuit design with realistic photon properties.
#PhotonicQuantum #BosonSampling #Research
#PhotonicQuantum #BosonSampling #Research
New metrics quantify usable capacity of photonic quantum devices under realistic constraints like photon loss and mode mismatch, enabling better comparison of boson sampling platforms and design strategies for scaling.
#BosonSampling #PhotonicsQC #Research
#BosonSampling #PhotonicsQC #Research
Scalability and Performance Metrics for Boson Sampling Devices
arxiv.org
October 14, 2026 at 11:24 AM
New metrics quantify usable capacity of photonic quantum devices under realistic constraints like photon loss and mode mismatch, enabling better comparison of boson sampling platforms and design strategies for scaling.
#BosonSampling #PhotonicsQC #Research
#BosonSampling #PhotonicsQC #Research
We develop efficient classical algorithms for estimating linear statistics of boson samplers. While this enables device validation and simulation of vibronic spectra, it limits quantum advantage claims for certain cryptographic applications.
#BosonSampling #PhotonicQuantum #Research
#BosonSampling #PhotonicQuantum #Research
Efficient Classical Algorithm for Linear Statistics of Boson Sampling
arxiv.org
September 30, 2026 at 11:21 AM
We develop efficient classical algorithms for estimating linear statistics of boson samplers. While this enables device validation and simulation of vibronic spectra, it limits quantum advantage claims for certain cryptographic applications.
#BosonSampling #PhotonicQuantum #Research
#BosonSampling #PhotonicQuantum #Research
Umfassende Übersicht über optische Quantencomputing-Ansätze, einschließlich diskreter und kontinuierlicher Variablenmethoden, Bosonsampling, variationeller Algorithmen und Anwendungen im maschinellen Lernen. Behandelt modernste Implementierungen, Hardwareentwicklung und Wege z...
Photonenbasiertes Quantencomputing: Architekturen, Methoden und aktuelle Fortschritte
arxiv.org
September 17, 2026 at 5:15 AM
Umfassende Übersicht über optische Quantencomputing-Ansätze, einschließlich diskreter und kontinuierlicher Variablenmethoden, Bosonsampling, variationeller Algorithmen und Anwendungen im maschinellen Lernen. Behandelt modernste Implementierungen, Hardwareentwicklung und Wege z...
Demonstrates that random hypercube photonic circuits achieve near-maximal entanglement across all subsystems at logarithmic circuit depth Θ(log n), connecting entanglement generation to sampling complexity hardness.
#QuantumPhotonics #BosonSampling #Research
#QuantumPhotonics #BosonSampling #Research
Log-Depth Entanglement Generation in Hypercube Linear Optical Networks
arxiv.org
September 15, 2026 at 10:29 AM
Demonstrates that random hypercube photonic circuits achieve near-maximal entanglement across all subsystems at logarithmic circuit depth Θ(log n), connecting entanglement generation to sampling complexity hardness.
#QuantumPhotonics #BosonSampling #Research
#QuantumPhotonics #BosonSampling #Research
New theoretical framework reveals how phase fluctuations progressively suppress many-body interference in photonic boson sampling, establishing fundamental tradeoffs between system size and phase stability for quantum advantage.
#PhotonicQuantum #BosonSampling #Research
#PhotonicQuantum #BosonSampling #Research
Phase-Noise Effects on Quantum Interference in Gaussian Boson Sampling
iq.fp2.dev
September 1, 2026 at 5:58 AM
New theoretical framework reveals how phase fluctuations progressively suppress many-body interference in photonic boson sampling, establishing fundamental tradeoffs between system size and phase stability for quantum advantage.
#PhotonicQuantum #BosonSampling #Research
#PhotonicQuantum #BosonSampling #Research
Establishes #P-hardness of threshold and parity BosonSampling via novel Fourier-coefficient extraction method. Proves binary readouts preserve classical intractability, validating quantum advantage in experimentally realistic photonic configurations.
#BosonSampling #QuantumAdvantage #Research
#BosonSampling #QuantumAdvantage #Research
Computational Hardness of Boson Sampling with Binary Coarse-Grained Measurements
iq.fp2.dev
August 26, 2026 at 5:24 AM
Establishes #P-hardness of threshold and parity BosonSampling via novel Fourier-coefficient extraction method. Proves binary readouts preserve classical intractability, validating quantum advantage in experimentally realistic photonic configurations.
#BosonSampling #QuantumAdvantage #Research
#BosonSampling #QuantumAdvantage #Research
Byeongseon Go, Hyunseok Jeong, Changhun Oh: Threshold and Parity BosonSampling in the Linear-Mode Regime https://arxiv.org/abs/2608.24008 https://arxiv.org/pdf/2608.24008 https://arxiv.org/html/2608.24008
August 26, 2026 at 6:59 AM
Byeongseon Go, Hyunseok Jeong, Changhun Oh: Threshold and Parity BosonSampling in the Linear-Mode Regime https://arxiv.org/abs/2608.24008 https://arxiv.org/pdf/2608.24008 https://arxiv.org/html/2608.24008
Etabliert die #P-Härte von Schwellen- und Paritäts-BosonSampling mittels neuartiger Fourier-Koeffizientenextraktionsmethode. Beweist, dass binäre Auslesungen klassische Unlösbarkeit bewahren, und validiert Quantenvorteil in experimentell realistischen photonischen Konfiguratio...
Computationale Schwierigkeit von Boson Sampling mit binären grobkörnigen Messungen
iq.fp2.dev
August 26, 2026 at 5:24 AM
Etabliert die #P-Härte von Schwellen- und Paritäts-BosonSampling mittels neuartiger Fourier-Koeffizientenextraktionsmethode. Beweist, dass binäre Auslesungen klassische Unlösbarkeit bewahren, und validiert Quantenvorteil in experimentell realistischen photonischen Konfiguratio...
Thiết lập tính #P-hardness của threshold và parity BosonSampling thông qua phương pháp trích xuất hệ số Fourier mới. Chứng minh rằng các phép đọc nhị phân bảo tồn tính bất khả giải cổ điển, xác thực lợi thế lượng tử trong các cấu hình quang tử có tính khả thi thực nghiệm.
Độ Khó Tính Toán của Boson Sampling với các Phép Đo Nhị Phân Thô
arxiv.org
August 26, 2026 at 5:25 AM
Thiết lập tính #P-hardness của threshold và parity BosonSampling thông qua phương pháp trích xuất hệ số Fourier mới. Chứng minh rằng các phép đọc nhị phân bảo tồn tính bất khả giải cổ điển, xác thực lợi thế lượng tử trong các cấu hình quang tử có tính khả thi thực nghiệm.