Computational advantage of quantum random sampling
Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …
advantage of quantum computers over classical computers. Recently the first large-scale …
Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
Today's experimental noisy quantum processors can compete with and surpass all known
algorithms on state-of-the-art supercomputers for the computational benchmark task of …
algorithms on state-of-the-art supercomputers for the computational benchmark task of …
Shallow shadows: Expectation estimation using low-depth random Clifford circuits
We provide practical and powerful schemes for learning properties of a quantum state using
a small number of measurements. Specifically, we present a randomized measurement …
a small number of measurements. Specifically, we present a randomized measurement …
Phase transition in random circuit sampling
Undesired coupling to the surrounding environment destroys long-range correlations on
quantum processors and hinders the coherent evolution in the nominally available …
quantum processors and hinders the coherent evolution in the nominally available …
A polynomial-time classical algorithm for noisy random circuit sampling
We give a polynomial time classical algorithm for sampling from the output distribution of a
noisy random quantum circuit in the regime of anti-concentration to within inverse …
noisy random quantum circuit in the regime of anti-concentration to within inverse …
Maximum Entropy Principle in Deep Thermalization and in Hilbert-Space Ergodicity
We report universal statistical properties displayed by ensembles of pure states that
naturally emerge in quantum many-body systems. Specifically, two classes of state …
naturally emerge in quantum many-body systems. Specifically, two classes of state …
Random unitaries in extremely low depth
We prove that random quantum circuits on any geometry, including a 1D line, can form
approximate unitary designs over $ n $ qubits in $\log n $ depth. In a similar manner, we …
approximate unitary designs over $ n $ qubits in $\log n $ depth. In a similar manner, we …
Dynamical Magic Transitions in Monitored Clifford+ Circuits
The classical simulation of highly entangling quantum dynamics is conjectured to be
generically hard. Thus, recently discovered measurement-induced transitions between …
generically hard. Thus, recently discovered measurement-induced transitions between …
Quantum convolutional neural networks are (effectively) classically simulable
Quantum Convolutional Neural Networks (QCNNs) are widely regarded as a promising
model for Quantum Machine Learning (QML). In this work we tie their heuristic success to …
model for Quantum Machine Learning (QML). In this work we tie their heuristic success to …
Limitations of linear cross-entropy as a measure for quantum advantage
Demonstrating quantum advantage requires experimental implementation of a
computational task that is hard to achieve using state-of-the-art classical systems. One …
computational task that is hard to achieve using state-of-the-art classical systems. One …