activity
20062026
most citedConstruction of a Large Class of Deterministic Sensing Matrices that Satisfy a Statistical Isometry Property

280 citations · 1.9k across the 78 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

quant-ph2019★ 247 cited

Quantum Computer Systems for Scientific Discovery

Yuri Alexeev, Dave Bacon, Kenneth R. Brown +21

The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considere…

quant-ph2019★ 53 cited

On Optimality of CSS Codes for Transversal

Narayanan Rengaswamy, Robert Calderbank, Michael Newman +1

In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that impleme…

quant-ph2019★ 20 cited

Logical Clifford Synthesis for Stabilizer Codes

Narayanan Rengaswamy, Robert Calderbank, Swanand Kadhe +1

Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated int…

cs.IT2019★ 9 cited

Kerdock Codes Determine Unitary 2-Designs

Trung Can, Narayanan Rengaswamy, Robert Calderbank +1

The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length over . We show that exponentiating these $\mathbb…

quant-ph2019★ 26 cited

Unifying the Clifford Hierarchy via Symmetric Matrices over Rings

Narayanan Rengaswamy, Robert Calderbank, Henry D. Pfister

The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access…