activity
20242026
collaborators

5 papers

quant-ph2026

Threshold and Parity BosonSampling in the Linear-Mode Regime

Byeongseon Go, Hyunseok Jeong, Changhun Oh

BosonSampling is among the most prominent candidates for demonstrating quantum advantage. However, while the hardness of BosonSampling relies on photon-number-resolving detection,…

quant-ph2026

Hardness and Complexity Transition of Noisy Random Circuit Sampling

Byeongseon Go, Changhun Oh, Hyunseok Jeong

Random circuit sampling (RCS) is a leading candidate for demonstrating quantum advantage, supported by strong complexity-theoretic evidence of hardness in the ideal setting and by…

quant-ph2026

Complexity phase transition for continuous-variable cluster state

Byeongseon Go, Hyunseok Jeong, Changhun Oh

Continuous-variable (CV) cluster states offer a promising platform for large-scale measurement-based quantum computations (MBQC). However, finite squeezing inevitably introduces Ga…

quant-ph2025

Sufficient conditions for hardness of lossy Gaussian boson sampling

Byeongseon Go, Changhun Oh, Hyunseok Jeong

Gaussian boson sampling (GBS) is a prominent candidate for the experimental demonstration of quantum advantage. However, while the current implementations of GBS are unavoidably su…

quant-ph2025

Quantum computational advantage of noisy boson sampling with partially distinguishable photons

Byeongseon Go, Changhun Oh, Hyunseok Jeong

Boson sampling stands out as a promising approach toward experimental demonstration of quantum computational advantage. However, the presence of physical noise in near-term experim…