collaborators

6 papers

quant-ph2026

Fault-tolerant execution of error-corrected quantum algorithms

Michael A. Perlin, Zichang He, Anthony Alexiades Armenakas +9

Scaling up quantum algorithms to tackle high-impact problems in science and industry requires quantum error correction and fault tolerance. While progress has been made in experime…

quant-ph2026

Computing with many encoded logical qubits beyond break-even

Shival Dasu, Matthew DeCross, Andrew Y. Guo +42

High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementi…

quant-ph2025

Certified randomness amplification by dynamically probing remote random quantum states

Minzhao Liu, Pradeep Niroula, Matthew DeCross +49

Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into n…

quant-ph2025

Measuring Correlation and Entanglement between Molecular Orbitals on a Trapped-Ion Quantum Computer

Gabriel Greene-Diniz, Chris N. Self, Michal Krompiec +4

Quantifying correlation and entanglement between molecular orbitals can elucidate the role of quantum effects in strongly correlated reaction processes. However, accurately storing…

quant-ph2025

Estimating the Jones polynomial for Ising anyons on noisy quantum computers

Chris N. Self, Sofyan Iblisdir, Gavin K. Brennen +1

The evaluation of the Jones polynomial at roots of unity is a paradigmatic problem for quantum computers. In this work we present experimental results obtained from existing noisy…

quant-ph2025

End-to-End Quantum Algorithms for the Jones Polynomial

Tuomas Laakkonen, Enrico Rinaldi, Chris N. Self +6

We present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any inp…