activity
20162025
most citedEventually Entanglement Breaking Maps

33 citations · 55 across the 8 of their papers we have counts for

collaborators

11 papers

quant-ph2025

On the Addressability Problem on CSS Codes

Jérôme Guyot, Samuel Jaques

Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations. This study focuses on t…

quant-ph2023★ 8 cited

QRAM: A Survey and Critique

Samuel Jaques, Arthur G. Rattew

Quantum random-access memory (QRAM) is a mechanism to access data (quantum or classical) based on addresses which are themselves a quantum state. QRAM has a long and controversial…

quant-ph2021

Leveraging state sparsity for more efficient quantum simulations

Samuel Jaques, Thomas Häner

High-performance techniques to simulate quantum programs on classical hardware rely on exponentially large vectors to represent quantum states. When simulating quantum algorithms,…

quant-ph2020

Quantum Period Finding against Symmetric Primitives in Practice

Xavier Bonnetain, Samuel Jaques

We present the first complete implementation of the offline Simon's algorithm, and estimate its cost to attack the MAC Chaskey, the block cipher PRINCE and the NIST lightweight can…

quant-ph2020

Offloading Quantum Computation by Superposition Masking

Samuel Jaques, Craig Gidney

Error correction will add so much overhead to large quantum computations that we suspect the most efficient algorithms will use a classical co-processor to do as much work as possi…

quant-ph2020

Improved quantum circuits for elliptic curve discrete logarithms

Thomas Häner, Samuel Jaques, Michael Naehrig +2

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups…