Computational advantage of quantum random sampling

D Hangleiter, J Eisert - Reviews of Modern Physics, 2023 - APS
Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

Logical quantum processor based on reconfigurable atom arrays

D Bluvstein, SJ Evered, AA Geim, SH Li, H Zhou… - Nature, 2024 - nature.com
Suppressing errors is the central challenge for useful quantum computing, requiring
quantum error correction (QEC),,,–for large-scale processing. However, the overhead in the …

Prospects for quantum enhancement with diabatic quantum annealing

EJ Crosson, DA Lidar - Nature Reviews Physics, 2021 - nature.com
Optimization, sampling and machine learning are topics of broad interest that have inspired
significant developments and new approaches in quantum computing. One such approach …

Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial

AA Mele - Quantum, 2024 - quantum-journal.org
The Haar measure plays a vital role in quantum information, but its study often requires a
deep understanding of representation theory, posing a challenge for beginners. This tutorial …

On the complexity and verification of quantum random circuit sampling

A Bouland, B Fefferman, C Nirkhe, U Vazirani - Nature Physics, 2019 - nature.com
A critical milestone on the path to useful quantum computers is the demonstration of a
quantum computation that is prohibitively hard for classical computers—a task referred to as …

Theory of quantum system certification

M Kliesch, I Roth - PRX quantum, 2021 - APS
The precise control of complex quantum systems promises numerous technological
applications including digital quantum computing. The complexity of such devices renders …

Quantum computational advantage via high-dimensional Gaussian boson sampling

A Deshpande, A Mehta, T Vincent, N Quesada… - Science …, 2022 - science.org
Photonics is a promising platform for demonstrating a quantum computational advantage
(QCA) by outperforming the most powerful classical supercomputers on a well-defined …

The hardness of random quantum circuits

R Movassagh - Nature Physics, 2023 - nature.com
As Moore's law reaches its limits, quantum computers are emerging that hold promise to
dramatically outperform classical computers. It is now possible to build quantum processors …

Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates

AW Harrow, S Mehraban - Communications in Mathematical Physics, 2023 - Springer
We prove that poly (t)· n 1/D-depth local random quantum circuits with two qudit nearest-
neighbor gates on a D-dimensional lattice with n qudits are approximate t-designs in various …

Tight bounds on the convergence of noisy random circuits to the uniform distribution

A Deshpande, P Niroula, O Shtanko, AV Gorshkov… - PRX Quantum, 2022 - APS
We study the properties of output distributions of noisy random circuits. We obtain upper and
lower bounds on the expected distance of the output distribution from the “useless” uniform …