1.5k citations · 14.6k across the 99 of their papers we have counts for
5 papers · 1 filter
A note on polynomial-time tolerant testing stabilizer states
Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt
We show an improved inverse theorem for the Gowers- norm of -qubit quantum states which states that: for every , if the $\textsf{Gowers}(|ψ\rangle,3)^8 \…
Tensor Network enhanced Dynamic Multiproduct Formulas
Niall F. Robertson, Bibek Pokharel, Bryce Fuller +10
Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here w…
How much entanglement is needed for quantum error correction?
Sergey Bravyi, Dongjin Lee, Zhi Li +1
It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled such that codes capable of correcting more errors require more entanglemen…
Fast classical simulation of Harvard/QuEra IQP circuits
Dmitri Maslov, Sergey Bravyi, Felix Tripier +2
Establishing an advantage for (white-box) computations by a quantum computer against its classical counterpart is currently a key goal for the quantum computation community. A quan…
Identity check problem for shallow quantum circuits
Sergey Bravyi, Natalie Parham, Minh Tran
Checking whether two quantum circuits are approximately equivalent is a common task in quantum computing. We consider a closely related identity check problem: given a quantum circ…