Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

Suppressing errors is the central challenge for useful quantum computing, requiring
quantum error correction (QEC),,,–for large-scale processing. However, the overhead in the …

We propose a fault-tolerant scheme for generating long-range entanglement at the ends of a
rectangular array of qubits of length R with a square cross-section of m= O (log 2 R) qubits. It …

We study classes of constant-depth circuits with gates that compute restricted polynomial
threshold functions, recently introduced by [Kum23] as a family that strictly generalizes …

Quantum physical unclonable functions, or QPUFs, are rapidly emerging as theoretical
hardware solutions to provide secure cryptographic functionalities such as key-exchange …

Realizing computationally complex quantum circuits in the presence of noise and
imperfections is a challenging task. While fault-tolerant quantum computing provides a route …

A quantum system coupled to a bath at some fixed, finite temperature converges to its Gibbs
state. This thermalization process defines a natural, physically-motivated model of quantum …

Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust
quantum advantage and fully fault-tolerant quantum computation, we propose a scheme to …

A fundamental goal of quantum computing is to demonstrate computational advantage over
classical computers. Shallow quantum circuits play a central role in this effort as the field …