Cover Image

Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Yexin, Zhou, Shuo, Wang, Xinzhao, Wang, Ziruo, Yang, Ziyi, Yang, Rui, Xue, Yecheng, Li, Tongyang
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
by: Wang, Xinzhao, et al.
Published: (2022)

Lindbladian Simulation with Commutator Bounds
by: Wang, Xinzhao, et al.
Published: (2026)

QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design
by: Yang, Rui, et al.
Published: (2024)

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
by: Chakraborty, Shantanav, et al.
Published: (2025)

Randomized Quantum Singular Value Transformation
by: Wang, Xinzhao, et al.
Published: (2025)

Quantum Multi-Level Estimation of Functionals of Discrete Distributions
by: Chen, Kean, et al.
Published: (2026)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
by: Li, Tongyang, et al.
Published: (2024)

Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
by: Gong, Weiyuan, et al.
Published: (2025)

Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
by: Gong, Weiyuan, et al.
Published: (2023)

Time-Dependent Hamiltonian Simulation in the Low-Energy Subspace
by: Zhou, Shuo, et al.
Published: (2026)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)

Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
by: Chen, Yu-Zhen Janice, et al.
Published: (2025)

Sample-Efficient Estimation of Nonlinear Quantum State Functions
by: Yao, Hongshun, et al.
Published: (2024)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2025)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)

Revoke vs. Restart in Unweighted Throughput Scheduling
by: He, Changdao
Published: (2025)

A Weighted-to-Unweighted Reduction for Matroid Intersection
by: Dudeja, Aditi, et al.
Published: (2026)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
by: Su, Yuexin, et al.
Published: (2025)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
by: Bernstein, Aaron, et al.
Published: (2025)

Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling
by: Ling, Cong, et al.
Published: (2026)

Gradient Testing and Estimation by Comparisons
by: Tao, Xiwen, et al.
Published: (2024)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
by: Nogler, Jakob, et al.
Published: (2024)

Quantum Speedup for Sampling Random Spanning Trees
by: Apers, Simon, et al.
Published: (2025)

Quantum Metropolis Sampling via Weak Measurement
by: Jiang, Jiaqing, et al.
Published: (2024)

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
by: Gharan, Shayan Oveis, et al.
Published: (2025)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
by: Liu, Gang, et al.
Published: (2024)

Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization
by: Bai, Xingjian, et al.
Published: (2024)

FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
by: Wang, Ziyuan, et al.
Published: (2025)

Revisit the Partial Coloring Method: Prefix Spencer and Sampling
by: Cai, Dongrun, et al.
Published: (2024)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
by: Gayen, Sutanu, et al.
Published: (2024)

Distribution Learning Meets Graph Structure Sampling
by: Bhattacharyya, Arnab, et al.
Published: (2024)

$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
by: Lin, Honghao, et al.
Published: (2025)

Sampling Proper Colorings on Line Graphs Using $(1+o(1))Δ$ Colors
by: Wang, Yulin, et al.
Published: (2023)

Sublinear Time Quantum Sensitivity Sampling
by: Song, Zhao, et al.
Published: (2025)

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
by: Kurpisz, Adam, et al.
Published: (2026)

Efficient Computation of Periods and Covers Using Sampling
by: Lecroq, Thierry, et al.
Published: (2024)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
by: Hebert-Johnson, Ursula, et al.
Published: (2023)

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
by: Hébert-Johnson, Úrsula, et al.
Published: (2025)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
by: Swamy, Chaitanya, et al.
Published: (2025)

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
by: Li, Cheng, et al.
Published: (2025)