253 citations · 268 across the 2 of their papers we have counts for
3 papers
quant-ph2016
Efficient classical simulation of matchgate circuits with generalized inputs and measurements
Daniel J. Brod
Matchgates are a restricted set of two-qubit gates known to be classically simulable under particular conditions. Specifically, if a circuit consists only of nearest-neighbour matc…
quant-ph2015★ 253 cited
Experimental Scattershot Boson Sampling
Marco Bentivegna, Nicolò Spagnolo, Chiara Vitelli +10
Boson Sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialised quantum…
quant-ph2012★ 15 cited
Geometries for universal quantum computation with matchgates
Daniel J. Brod, Ernesto F. Galvão
Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain,…