Sergey Bravyi

According to our database, Sergey Bravyi authored at least 37 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

High-threshold and low-overhead fault-tolerant quantum memory.

Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, Theodore J. Yoder

Nat., 2024

Fast classical simulation of Harvard/QuEra IQP circuits.

Dmitri Maslov, Sergey Bravyi, Felix Tripier, Andrii Maksymov, Joseph A. Latone

CoRR, 2024

2023

A rapidly mixing Markov chain from any gapped quantum many-body system.

Sergey Bravyi, Giuseppe Carleo, David Gosset, Yinchen Liu

Quantum, November, 2023

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

Sergiy Zhuk, Niall Robertson, Sergey Bravyi

CoRR, 2023

Quantum complexity of the Kronecker coefficients.

Sergey Bravyi, Anirban Chowdhury, David Gosset, Vojtech Havlícek, Guanyu Zhu

CoRR, 2023

Optimal Algorithms for Learning Quantum Phase States.

Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder

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.

Sergey Bravyi, Theodore J. Yoder, Dmitri Maslov

IEEE Trans. Computers, 2022

Hybrid quantum-classical algorithms for approximate graph coloring.

Sergey Bravyi, Alexander Kliesch, Robert König, Eugene Tang

Quantum, 2022

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

Sergey Bravyi, Dmitri Maslov, Yun Seong Nam

CoRR, 2022

The Parameterized Complexity of Quantum Verification.

Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman

CoRR, 2022

The Parametrized Complexity of Quantum Verification.

Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman

Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2021

Hadamard-Free Circuits Expose the Structure of the Clifford Group.

Sergey Bravyi, Dmitri Maslov

IEEE Trans. Inf. Theory, 2021

Clifford Circuit Optimization with Templates and Symbolic Pauli Gates.

Sergey Bravyi, Ruslan Shaydulin, Shaohan Hu, Dmitri Maslov

Quantum, 2021

On the complexity of quantum partition functions.

Sergey Bravyi, Anirban Chowdhury, David Gosset, Pawel Wocjan

CoRR, 2021

2020

6-qubit Optimal Clifford Circuits.

Sergey Bravyi, Joseph A. Latone, Dmitri Maslov

CoRR, 2020

Quantum advantage for computations with limited space.

Dmitri Maslov, Jin-Sung Kim, Sergey Bravyi, Theodore J. Yoder, Sarah Sheldon

CoRR, 2020

2019

Classical algorithms for quantum mean values.

Sergey Bravyi, David Gosset, Ramis Movassagh

CoRR, 2019

Quantum Advantage with Noisy Shallow Circuits in 3D.

Sergey Bravyi, David Gosset, Robert König, Marco Tomamichel

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017

Quantum advantage with shallow circuits.

Sergey Bravyi, David Gosset, Robert König

CoRR, 2017

2016

Polynomial-time classical simulation of quantum ferromagnets.

Sergey Bravyi, David Gosset

CoRR, 2016

2015

Monte Carlo simulation of stoquastic Hamiltonians.

Sergey Bravyi

Quantum Inf. Comput., 2015

2014

Homological product codes.

Sergey Bravyi, Matthew B. Hastings

Proceedings of the Symposium on Theory of Computing, 2014

2013

Subsystem surface codes with three-qubit check operators.

Sergey Bravyi, Guillaume Duclos-Cianci, David Poulin, Martin Suchara

Quantum Inf. Comput., 2013

2012

Classical simulation of dissipative fermionic linear optics.

Sergey Bravyi, Robert König

Quantum Inf. Comput., 2012

2011

Quantum Algorithms for Testing Properties of Distributions.

Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim

IEEE Trans. Inf. Theory, 2011

2010

Tradeoffs for reliable quantum information storage in 2D systems.

Sergey Bravyi, David Poulin, Barbara M. Terhal

Proceedings of the Quantum Cryptography and Computing, 2010

Stabilizer subsystem codes with spatially local generators.

Sergey Bravyi

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Bounds on the Quantum Satisfiability Threshold.

Sergey Bravyi, Cristopher Moore, Alexander Russell

Proceedings of the Innovations in Computer Science, 2010

2009

Complexity of Stoquastic Frustration-Free Hamiltonians.

Sergey Bravyi, Barbara M. Terhal

SIAM J. Comput., 2009

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

Nikhil Bansal, Sergey Bravyi, Barbara M. Terhal

Quantum Inf. Comput., 2009

Bounds on the quantum satisfibility threshold

Sergey Bravyi, Cristopher Moore, Alexander Russell

CoRR, 2009

2008

The complexity of stoquastic local Hamiltonian problems.

Sergey Bravyi, David P. DiVincenzo, Roberto Oliveira, Barbara M. Terhal

Quantum Inf. Comput., 2008

2006

Merlin-Arthur Games and Stoquastic Complexity

Sergey Bravyi, Arvid J. Bessen, Barbara M. Terhal

CoRR, 2006

2005

Commutative version of the local Hamiltonian problem and common eigenspace problem.

Sergey Bravyi, Mikhail N. Vyalyi

Quantum Inf. Comput., 2005

Lagrangian representation for fermionic linear optics.

Sergey Bravyi

Quantum Inf. Comput., 2005

2004

Unextendible Product Bases and Locally Unconvertible Bound Entangled States.

S. B. Bravyi

Quantum Inf. Process., 2004

Requirements for copatibility between local and multipartite quantum states.

Sergey Bravyi

Quantum Inf. Comput., 2004