Faster classical boson sampling
Since its introduction boson sampling has been the subject of intense study in the world of quantum computing. In the context of Fock-state boson sampling, the task is to sample independently from the set of all n × n submatrices built from possibly repeated rows of a larger m × n complex matrix acc...
Main Authors: | Clifford, P, Clifford, R |
---|---|
Format: | Journal article |
Language: | English |
Published: |
IOP Publishing
2024
|
Similar Items
-
Faster algorithms for delta,gamma-matching and related problems
by: Clifford, P, et al.
Published: (2005) -
Distinguishing noisy boson sampling from classical simulations
by: Valery Shchesnovich
Published: (2021-03-01) -
Speeding up the classical simulation of Gaussian boson sampling with limited connectivity
by: Tian-Yu Yang, et al.
Published: (2024-04-01) -
Boson sampling for generalized bosons
by: En-Jui Kuo, et al.
Published: (2022-11-01) -
Clifford recompilation for faster classical simulation of quantum circuits
by: Hammam Qassim, et al.
Published: (2019-08-01)