Sergey Bravyi

Orcid: 0000-0002-4032-470X

Affiliations:
  • IBM T. J. Watson Research Center, Yorktown Heights, NY, USA


According to our database1, Sergey Bravyi authored at least 39 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
High-threshold and low-overhead fault-tolerant quantum memory.
Nat., 2024

A note on polynomial-time tolerant testing stabilizer states.
CoRR, 2024

Fast classical simulation of Harvard/QuEra IQP circuits.
CoRR, 2024

Classical Simulation of Peaked Shallow Quantum Circuits.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
A rapidly mixing Markov chain from any gapped quantum many-body system.
Quantum, November, 2023

Trotter error bounds and dynamic multi-product formulas for Hamiltonian simulation.
CoRR, 2023

Quantum complexity of the Kronecker coefficients.
CoRR, 2023

Optimal Algorithms for Learning Quantum Phase States.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

2022
Efficient Ancilla-Free Reversible and Quantum Circuits for the Hidden Weighted Bit Function.
IEEE Trans. Computers, 2022

Hybrid quantum-classical algorithms for approximate graph coloring.
Quantum, 2022

Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions.
CoRR, 2022

The Parameterized Complexity of Quantum Verification.
CoRR, 2022

The Parametrized Complexity of Quantum Verification.
Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021
Hadamard-Free Circuits Expose the Structure of the Clifford Group.
IEEE Trans. Inf. Theory, 2021

Clifford Circuit Optimization with Templates and Symbolic Pauli Gates.
Quantum, 2021

On the complexity of quantum partition functions.
CoRR, 2021

2020
6-qubit Optimal Clifford Circuits.
CoRR, 2020

Quantum advantage for computations with limited space.
CoRR, 2020

2019
Classical algorithms for quantum mean values.
CoRR, 2019

Quantum Advantage with Noisy Shallow Circuits in 3D.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
Quantum advantage with shallow circuits.
CoRR, 2017

2016
Polynomial-time classical simulation of quantum ferromagnets.
CoRR, 2016

2015
Monte Carlo simulation of stoquastic Hamiltonians.
Quantum Inf. Comput., 2015

2014
Homological product codes.
Proceedings of the Symposium on Theory of Computing, 2014

2013
Subsystem surface codes with three-qubit check operators.
Quantum Inf. Comput., 2013

2012
Classical simulation of dissipative fermionic linear optics.
Quantum Inf. Comput., 2012

2011
Quantum Algorithms for Testing Properties of Distributions.
IEEE Trans. Inf. Theory, 2011

2010
Tradeoffs for reliable quantum information storage in 2D systems.
Proceedings of the Quantum Cryptography and Computing, 2010

Stabilizer subsystem codes with spatially local generators.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Bounds on the Quantum Satisfiability Threshold.
Proceedings of the Innovations in Computer Science, 2010

2009
Complexity of Stoquastic Frustration-Free Hamiltonians.
SIAM J. Comput., 2009

Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs.
Quantum Inf. Comput., 2009

Bounds on the quantum satisfibility threshold
CoRR, 2009

2008
The complexity of stoquastic local Hamiltonian problems.
Quantum Inf. Comput., 2008

2006
Merlin-Arthur Games and Stoquastic Complexity
CoRR, 2006

2005
Commutative version of the local Hamiltonian problem and common eigenspace problem.
Quantum Inf. Comput., 2005

Lagrangian representation for fermionic linear optics.
Quantum Inf. Comput., 2005

2004
Unextendible Product Bases and Locally Unconvertible Bound Entangled States.
Quantum Inf. Process., 2004

Requirements for copatibility between local and multipartite quantum states.
Quantum Inf. Comput., 2004


  Loading...