439 citations · 2.4k across the 33 of their papers we have counts for
34 papers
High-threshold and low-overhead fault-tolerant quantum memory
Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta +3
Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement…
Encoding a magic state with beyond break-even fidelity
Riddhi S. Gupta, Neereja Sundaresan, Thomas Alexander +10
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded…
The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems
Rahul Sarkar, Theodore J. Yoder
Qudits with local dimension can have unique structure and uses that qubits () cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and…
Homomorphic Logical Measurements
Shilin Huang, Tomas Jochym-O'Connor, Theodore J. Yoder
Shor and Steane ancilla are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations. On large quantum low-densi…
Optimal algorithms for learning quantum phase states
Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt +1
We analyze the complexity of learning -qubit quantum phase states. A degree- phase state is defined as a superposition of all basis vectors with amplitudes proporti…
Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
Neereja Sundaresan, Theodore J. Yoder, Youngseok Kim +7
Quantum error correction offers a promising path for performing quantum computations with low errors. Although a fully fault-tolerant execution of a quantum algorithm remains unrea…