Address
Raphaël Clifford
School of Computer Science
University of Bristol
Merchant Venturers Building
Woodland Road
BRISTOL
BS8 1UB
United Kingdom
Room: 3.15 (MVB)
Email: raphael.clifford AT bristol ac uk
Phone: +44 117 331-5147
Boson Sampling:
Two papers with Peter Clifford on the
classical simulation of Boson Sampling:
- Peter Clifford and Raphaël Clifford.
The Classical Complexity of Boson Sampling.
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA 2018), pages 146-155.
[arXiv:1706.01260]
An algorithm that samples exactly from the Boson Sampling distribution in
O(n 2n + poly(m,n)) time, much faster than had previously been
thought possible.
- Peter Clifford and Raphaël Clifford.
Faster classical boson sampling.
Physica Scripta, 99(6):065121, 2024.
[journal]
[arXiv:2005.04214]
An average-case speed running in about O(n · 1.69n) time,
thereby raising the problem size needed to demonstrate quantum advantage.
Preprints:
- Peter Clifford and Raphaël Clifford.
Exact Sampling of Permutations with a Fixed Longest Increasing
Subsequence, 2026.
[arXiv:2606.02263]
The first polynomial-time exact sampler for uniform permutations of length
n whose longest increasing subsequence has prescribed length k, for every
1 ≤ k ≤ n.
Publications:
DBLP also has links to the published versions for most of my papers. For copies of papers not linked from there, please contact me directly.
|
LEGO Relativity by Andrew Lipson and Daniel Shiu,
© A. Lipson 2003
|
