default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Bravyi 0001
Person information
- affiliation: IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Sergey Bravyi, Andrew W. Cross
, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, Theodore J. Yoder:
High-threshold and low-overhead fault-tolerant quantum memory. Nat. 627(8005): 778-782 (2024)- [c8]Sergey Bravyi, David Gosset, Yinchen Liu:
Classical Simulation of Peaked Shallow Quantum Circuits. STOC 2024: 561-572 - [i19]Dmitri Maslov, Sergey Bravyi, Felix Tripier, Andrii Maksymov, Joseph A. Latone:
Fast classical simulation of Harvard/QuEra IQP circuits. CoRR abs/2402.03211 (2024) - 2023
- [j16]Sergey Bravyi, Giuseppe Carleo, David Gosset, Yinchen Liu:
A rapidly mixing Markov chain from any gapped quantum many-body system. Quantum 7: 1173 (2023) - [c7]Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder:
Optimal Algorithms for Learning Quantum Phase States. TQC 2023: 3:1-3:24 - [i18]Sergey Bravyi, Anirban Chowdhury, David Gosset, Vojtech Havlícek, Guanyu Zhu:
Quantum complexity of the Kronecker coefficients. CoRR abs/2302.11454 (2023) - [i17]Sergiy Zhuk, Niall Robertson, Sergey Bravyi:
Trotter error bounds and dynamic multi-product formulas for Hamiltonian simulation. CoRR abs/2306.12569 (2023) - [i16]Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, Theodore J. Yoder:
High-threshold and low-overhead fault-tolerant quantum memory. CoRR abs/2308.07915 (2023) - 2022
- [j15]Sergey Bravyi, Alexander Kliesch, Robert König, Eugene Tang:
Hybrid quantum-classical algorithms for approximate graph coloring. Quantum 6: 678 (2022) - [j14]Sergey Bravyi, Theodore J. Yoder, Dmitri Maslov:
Efficient Ancilla-Free Reversible and Quantum Circuits for the Hidden Weighted Bit Function. IEEE Trans. Computers 71(5): 1170-1180 (2022) - [c6]Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parametrized Complexity of Quantum Verification. TQC 2022: 3:1-3:18 - [i15]Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parameterized Complexity of Quantum Verification. CoRR abs/2202.08119 (2022) - [i14]Sergey Bravyi, Dmitri Maslov, Yun Seong Nam:
Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions. CoRR abs/2207.08691 (2022) - [i13]Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, Theodore J. Yoder:
Optimal algorithms for learning quantum phase states. CoRR abs/2208.07851 (2022) - 2021
- [j13]Sergey Bravyi, Ruslan Shaydulin, Shaohan Hu, Dmitri Maslov:
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates. Quantum 5: 580 (2021) - [j12]Sergey Bravyi, Dmitri Maslov:
Hadamard-Free Circuits Expose the Structure of the Clifford Group. IEEE Trans. Inf. Theory 67(7): 4546-4563 (2021) - [i12]Sergey Bravyi, Ruslan Shaydulin, Shaohan Hu, Dmitri Maslov:
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates. CoRR abs/2105.02291 (2021) - [i11]Sergey Bravyi, Anirban Chowdhury, David Gosset, Pawel Wocjan:
On the complexity of quantum partition functions. CoRR abs/2110.15466 (2021) - 2020
- [i10]Sergey Bravyi, Dmitri Maslov:
Hadamard-free circuits expose the structure of the Clifford group. CoRR abs/2003.09412 (2020) - [i9]Sergey Bravyi, Theodore J. Yoder, Dmitri Maslov:
Efficient ancilla-free reversible and quantum circuits for the Hidden Weighted Bit function. CoRR abs/2007.05469 (2020) - [i8]Dmitri Maslov, Jin-Sung Kim, Sergey Bravyi, Theodore J. Yoder, Sarah Sheldon:
Quantum advantage for computations with limited space. CoRR abs/2008.06478 (2020) - [i7]Sergey Bravyi, Joseph A. Latone, Dmitri Maslov:
6-qubit Optimal Clifford Circuits. CoRR abs/2012.06074 (2020)
2010 – 2019
- 2019
- [c5]Sergey Bravyi, David Gosset, Robert König, Marco Tomamichel:
Quantum Advantage with Noisy Shallow Circuits in 3D. FOCS 2019: 995-999 - [i6]Sergey Bravyi, David Gosset, Ramis Movassagh:
Classical algorithms for quantum mean values. CoRR abs/1909.11485 (2019) - 2017
- [i5]Sergey Bravyi, David Gosset, Robert König:
Quantum advantage with shallow circuits. CoRR abs/1704.00690 (2017) - 2016
- [i4]Sergey Bravyi, David Gosset:
Polynomial-time classical simulation of quantum ferromagnets. CoRR abs/1612.05602 (2016) - 2015
- [j11]Sergey Bravyi:
Monte Carlo simulation of stoquastic Hamiltonians. Quantum Inf. Comput. 15(13&14): 1122-1140 (2015) - 2014
- [c4]Sergey Bravyi, Matthew B. Hastings:
Homological product codes. STOC 2014: 273-282 - 2013
- [j10]Sergey Bravyi, Guillaume Duclos-Cianci, David Poulin, Martin Suchara:
Subsystem surface codes with three-qubit check operators. Quantum Inf. Comput. 13(11-12): 963-985 (2013) - 2012
- [j9]Sergey Bravyi, Robert König:
Classical simulation of dissipative fermionic linear optics. Quantum Inf. Comput. 12(11-12): 925-943 (2012) - 2011
- [j8]Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim:
Quantum Algorithms for Testing Properties of Distributions. IEEE Trans. Inf. Theory 57(6): 3971-3981 (2011) - 2010
- [c3]Sergey Bravyi, Cristopher Moore, Alexander Russell:
Bounds on the Quantum Satisfiability Threshold. ICS 2010: 482-489 - [c2]Sergey Bravyi:
Stabilizer subsystem codes with spatially local generators. ITW 2010: 1-5 - [c1]Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim:
Quantum Algorithms for Testing Properties of Distributions. STACS 2010: 131-142 - [p1]Sergey Bravyi, David Poulin, Barbara M. Terhal:
Tradeoffs for reliable quantum information storage in 2D systems. Quantum Cryptography and Computing 2010: 125-137
2000 – 2009
- 2009
- [j7]Nikhil Bansal, Sergey Bravyi, Barbara M. Terhal:
Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs. Quantum Inf. Comput. 9(7&8): 701-720 (2009) - [j6]Sergey Bravyi, Barbara M. Terhal:
Complexity of Stoquastic Frustration-Free Hamiltonians. SIAM J. Comput. 39(4): 1462-1485 (2009) - [i3]Sergey Bravyi, Cristopher Moore, Alexander Russell:
Bounds on the quantum satisfibility threshold. CoRR abs/0907.1297 (2009) - [i2]Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim:
Quantum algorithms for testing properties of distributions. CoRR abs/0907.3920 (2009) - 2008
- [j5]Sergey Bravyi, David P. DiVincenzo, Roberto Oliveira, Barbara M. Terhal:
The complexity of stoquastic local Hamiltonian problems. Quantum Inf. Comput. 8(5): 361-385 (2008) - 2006
- [i1]Sergey Bravyi, Arvid J. Bessen, Barbara M. Terhal:
Merlin-Arthur Games and Stoquastic Complexity. CoRR abs/quant-ph/0611021 (2006) - 2005
- [j4]Sergey Bravyi, Mikhail N. Vyalyi:
Commutative version of the local Hamiltonian problem and common eigenspace problem. Quantum Inf. Comput. 5(3): 187-215 (2005) - [j3]Sergey Bravyi:
Lagrangian representation for fermionic linear optics. Quantum Inf. Comput. 5(3): 216-238 (2005) - 2004
- [j2]Sergey Bravyi:
Requirements for copatibility between local and multipartite quantum states. Quantum Inf. Comput. 4(1): 12-26 (2004) - [j1]S. B. Bravyi:
Unextendible Product Bases and Locally Unconvertible Bound Entangled States. Quantum Inf. Process. 3(6): 309-329 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-21 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
