15 citations · 22 across the 5 of their papers we have counts for
5 papers · 2 filters
Complexity-theoretic foundations of BosonSampling with a linear number of modes
Adam Bouland, Daniel Brod, Ishaun Datta +4
BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstration…
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
Adam Bouland, Bill Fefferman, Soumik Ghosh +4
Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is…
Approximate t-designs in generic circuit architectures
Daniel Belkin, James Allen, Soumik Ghosh +6
Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which ce…
Effect of non-unital noise on random circuit sampling
Bill Fefferman, Soumik Ghosh, Michael Gullans +2
In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical non-unital noise sour…
Quantum Merlin-Arthur and proofs without relative phase
Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha
We study a variant of QMA where quantum proofs have no relative phase (i.e. non-negative amplitudes, up to a global phase). If only completeness is modified, this class is equal to…