19 citations · 41 across the 5 of their papers we have counts for
6 papers · 1 filter
Efficient classical algorithm for estimating linear statistics of Boson Sampling
Benoit Seron, Hugo Thomas, Eduardo Araujo +3
Boson Sampling is a prominent candidate for the demonstration of quantum computational advantage but it remains unclear whether a large-scale boson sampler can find useful computat…
Efficient validation of Boson Sampling from binned photon-number distributions
Benoit Seron, Leonardo Novo, Alex Arkhipov +1
In order to substantiate claims of quantum computational advantage, it is crucial to develop efficient methods for validating the experimental data. We propose a test of the correc…
BosonSampling Is Far From Uniform
Scott Aaronson, Alex Arkhipov
BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. I…
Extending and Characterizing Quantum Magic Games
Alex Arkhipov
The Mermin-Peres magic square game is a cooperative two-player nonlocal game in which shared quantum entanglement allows the players to win with certainty, while players limited to…
The bosonic birthday paradox
Alex Arkhipov, Greg Kuperberg
We motivate and prove a version of the birthday paradox for identical bosons in possible modes. If the bosons are in the uniform mixed state, also called the maximally mixe…
The Computational Complexity of Linear Optics
Scott Aaronson, Alex Arkhipov
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical…