Requirements for copatibility between local and multipartite quantum states. - Sergey Bravyi 001 (Quantum Inf. Comput., 2004)

Unextendible Product Bases and Locally Unconvertible Bound Entangled States. - S. B. Bravyi 001 (Quantum Inf. Process., 2004)

Lagrangian representation for fermionic linear optics. - Sergey Bravyi 001 (Quantum Inf. Comput., 2005)

Commutative version of the local Hamiltonian problem and common eigenspace problem. - Sergey Bravyi 001; Mikhail N. Vyalyi (Quantum Inf. Comput., 2005)

Merlin-Arthur Games and Stoquastic Complexity - Sergey Bravyi 001; Arvid J. Bessen; Barbara M. Terhal (CoRR, 2006)

The complexity of stoquastic local Hamiltonian problems. - Sergey Bravyi 001; David P. DiVincenzo; Roberto Oliveira 001; Barbara M. Terhal (Quantum Inf. Comput., 2008)

Bounds on the quantum satisfibility threshold - Sergey Bravyi 001; Cristopher Moore; Alexander Russell (CoRR, 2009)

Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs. - Nikhil Bansal 001; Sergey Bravyi 001; Barbara M. Terhal (Quantum Inf. Comput., 2009)

Complexity of Stoquastic Frustration-Free Hamiltonians. - Sergey Bravyi 001; Barbara M. Terhal (SIAM J. Comput., 2009)

Bounds on the Quantum Satisfiability Threshold. - Sergey Bravyi 001; Cristopher Moore; Alexander Russell (ICS, 2010)

Stabilizer subsystem codes with spatially local generators. - Sergey Bravyi 001 (ITW, 2010)

Tradeoffs for reliable quantum information storage in 2D systems. - Sergey Bravyi 001; David Poulin; Barbara M. Terhal (Quantum Cryptography and Computing, 2010)

Quantum Algorithms for Testing Properties of Distributions. - Sergey Bravyi 001; Aram W. Harrow; Avinatan Hassidim (IEEE Trans. Inf. Theory, 2011)

Classical simulation of dissipative fermionic linear optics. - Sergey Bravyi 001; Robert König (Quantum Inf. Comput., 2012)

Subsystem surface codes with three-qubit check operators. - Sergey Bravyi 001; Guillaume Duclos-Cianci; David Poulin; Martin Suchara (Quantum Inf. Comput., 2013)

Homological product codes. - Sergey Bravyi 001; Matthew B. Hastings (STOC, 2014)

Monte Carlo simulation of stoquastic Hamiltonians. - Sergey Bravyi 001 (Quantum Inf. Comput., 2015)

Polynomial-time classical simulation of quantum ferromagnets. - Sergey Bravyi 001; David Gosset (CoRR, 2016)

Quantum advantage with shallow circuits. - Sergey Bravyi 001; David Gosset; Robert König (CoRR, 2017)

Quantum Advantage with Noisy Shallow Circuits in 3D. - Sergey Bravyi 001; David Gosset; Robert König; Marco Tomamichel (FOCS, 2019)

Classical algorithms for quantum mean values. - Sergey Bravyi 001; David Gosset; Ramis Movassagh (CoRR, 2019)

Simulation of quantum circuits by low-rank stabilizer decompositions. - Sergey Bravyi 001; Dan E. Browne; Padraic Calpin; Earl T. Campbell; David Gosset; Mark Howard (Quantum, 2019)

Quantum advantage for computations with limited space. - Dmitri Maslov; Jin-Sung Kim; Sergey Bravyi 001; Theodore J. Yoder; Sarah Sheldon (CoRR, 2020)

6-qubit Optimal Clifford Circuits. - Sergey Bravyi 001; Joseph A. Latone; Dmitri Maslov (CoRR, 2020)

On the complexity of quantum partition functions. - Sergey Bravyi 001; Anirban Chowdhury; David Gosset; Pawel Wocjan (CoRR, 2021)

Clifford Circuit Optimization with Templates and Symbolic Pauli Gates. - Sergey Bravyi 001; Ruslan Shaydulin; Shaohan Hu; Dmitri Maslov (Quantum, 2021)

Hadamard-Free Circuits Expose the Structure of the Clifford Group. - Sergey Bravyi 001; Dmitri Maslov (IEEE Trans. Inf. Theory, 2021)

The Parametrized Complexity of Quantum Verification. - Srinivasan Arunachalam; Sergey Bravyi 001; Chinmay Nirkhe; Bryan O'Gorman (TQC, 2022)

The Parameterized Complexity of Quantum Verification. - Srinivasan Arunachalam; Sergey Bravyi 001; Chinmay Nirkhe; Bryan O'Gorman (CoRR, 2022)

Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions. - Sergey Bravyi 001; Dmitri Maslov; Yun Seong Nam (CoRR, 2022)

Hybrid quantum-classical algorithms for approximate graph coloring. - Sergey Bravyi 001; Alexander Kliesch; Robert König; Eugene Tang (Quantum, 2022)

Efficient Ancilla-Free Reversible and Quantum Circuits for the Hidden Weighted Bit Function. - Sergey Bravyi 001; Theodore J. Yoder; Dmitri Maslov (IEEE Trans. Computers, 2022)

Optimal Algorithms for Learning Quantum Phase States. - Srinivasan Arunachalam; Sergey Bravyi 001; Arkopal Dutt; Theodore J. Yoder (TQC, 2023)

Quantum complexity of the Kronecker coefficients. - Sergey Bravyi 001; Anirban Chowdhury; David Gosset; Vojtech Havlícek; Guanyu Zhu (CoRR, 2023)

Trotter error bounds and dynamic multi-product formulas for Hamiltonian simulation. - Sergiy Zhuk; Niall Robertson; Sergey Bravyi 001 (CoRR, 2023)

A rapidly mixing Markov chain from any gapped quantum many-body system. - Sergey Bravyi 001; Giuseppe Carleo; David Gosset; Yinchen Liu (Quantum, 2023)

Classical Simulation of Peaked Shallow Quantum Circuits. - Sergey Bravyi 001; David Gosset; Yinchen Liu (STOC, 2024)

Fast classical simulation of Harvard/QuEra IQP circuits. - Dmitri Maslov; Sergey Bravyi 001; Felix Tripier; Andrii Maksymov; Joseph A. Latone (CoRR, 2024)

A note on polynomial-time tolerant testing stabilizer states. - Srinivasan Arunachalam; Sergey Bravyi 001; Arkopal Dutt (CoRR, 2024)

High-threshold and low-overhead fault-tolerant quantum memory. - Sergey Bravyi 001; Andrew W. Cross; Jay M. Gambetta; Dmitri Maslov; Patrick Rall; Theodore J. Yoder (Nat., 2024)

Generating k EPR-pairs from an n-party resource state. - Sergey Bravyi 001; Yash Sharma; Mario Szegedy; Ronald de Wolf (Quantum, 2024)