1 citations · 2 across the 7 of their papers we have counts for
8 papers
Exploration via Activation-Space Steering for Reinforcement Learning with Verifiable Rewards
Yunan Zeng, Jinhao Jing, Xi Cheng +1
Reinforcement learning with verifiable rewards (RLVR) trains a language model by sampling responses, scoring them with an automatic verifier, and updating the policy from the resul…
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…
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…
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…
Virtual purification complements quantum error correction in quantum metrology
Hyukgun Kwon, Changhun Oh, Youngrong Lim +3
Quantum resources enable one to achieve quantum-enhanced estimation sensitivity beyond its classical counterpart. Many studies mainly focus on reducing statistical error, under the…
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…
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…