1 citations · 1 across the 4 of their papers we have counts for
10 papers · 1 filter
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,…
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…
Improved sample complexity bound for sample-based Lindbladian simulation
Siheon Park, Youngjin Seo, Byeongseon Go +3
We establish improved sample-complexity bounds for sample-based Lindbladian simulation based on the Wave Matrix Lindbladization (WML) algorithm. For a jump operator with dimens…
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…
On computational complexity and average-case hardness of shallow-depth boson sampling
Byeongseon Go, Changhun Oh, Hyunseok Jeong
Boson sampling, a computational task believed to be classically hard to simulate, is expected to hold promise for demonstrating quantum computational advantage using near-term quan…
Quantum Metrology under Coarse-Grained Measurement
Byeong-Yoon Go, Geunhee Gwak, Young-Do Yoon +4
While quantum metrology enables measurement precision beyond classical limits, its performance is often susceptible to experimental imperfections. Most prior studies have focused o…