Modeling and simulating the noisy behavior of near-term quantum computers

K Georgopoulos, C Emary, P Zuliani - Physical Review A, 2021 - APS
Noise dominates every aspect of near-term quantum computers, rendering it exceedingly
difficult to carry out even small computations. In this paper we are concerned with the …

Simulating Gaussian boson sampling quantum computers

AS Dellios, MD Reid, PD Drummond - AAPPS Bulletin, 2023 - Springer
A growing cohort of experimental linear photonic networks implementing Gaussian boson
sampling (GBS) have now claimed quantum advantage. However, many open questions …

Verifiable measurement-based quantum random sampling with trapped ions

M Ringbauer, M Hinsche, T Feldker… - Nature …, 2025 - nature.com
Quantum computers are now on the brink of outperforming their classical counterparts. One
way to demonstrate the advantage of quantum computation is through quantum random …

Pseudochaotic Many-Body Dynamics as a Pseudorandom State Generator

W Lee, H Kwon, GY Cho - arxiv preprint arxiv:2410.21268, 2024 - arxiv.org
We introduce a new class of quantum many-body dynamics in quantum simulations,
namely'pseudochaotic dynamics,'which generates computationally indistinguishable states …

The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims

G Kalai - arxiv preprint arxiv:2008.05188, 2020 - arxiv.org
My 2018 lecture at the ICA workshop in Singapore dealt with quantum computation as a
meeting point of the laws of computation and the laws of quantum mechanics. We described …

[PDF][PDF] Google's 2019 Quantum Supremacy Claims: Data, Documentation, and Discussion

G Kalai, Y Rinott, T Shoham - Quantum Physics; …, 2023 - gilkalai.wordpress.com
Abstract In October 2019, Nature published a paper [3] describing an experimental work that
took place at Google. The paper claims to demonstrate quantum (computational) supremacy …

[PDF][PDF] Verifiable measurement-based quantum random sampling with trapped ions

J Eisert, M Ringbauer, M Hinsche, T Feldker… - 2024 - assets-eu.researchsquare.com
Quantum computers are now on the brink of outperforming their classical counterparts. One
way to demonstrate the advantage of quantum computation is through quantum random …

Non-Randomness of Google's Quantum Supremacy Benchmark

S Oh, S Kais - arxiv preprint arxiv:2110.06046, 2021 - arxiv.org
The first achievement of quantum supremacy has been claimed recently by Google for the
random quantum circuit benchmark with 53 superconducting qubits. Here, we analyze the …