REVIEW 5 cited by
Computational advantage of quantum random sampling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the boundary of what can be simulated on existing classical hardware. In this article, we comprehensively review the theoretical underpinning of quantum random sampling in terms of computational complexity and verifiability, as well as the practical aspects of its experimental implementation using superconducting and photonic devices and its classical simulation. We discuss in detail open questions in the field and provide perspectives for the road ahead, including potential applications of quantum random sampling.
Forward citations
Cited by 5 Pith papers
-
Efficient simulation of noisy IQP circuits with amplitude-damping noise
A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.
-
Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms
Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).
-
Quantum-inspired dynamical models on quantum and classical annealers
A parallel-in-time encoding turns quantum dynamical propagators into QUBO instances for direct benchmarking of quantum annealers against classical solvers on models from single-qubit rotations to PT-symmetric systems.
-
Quantum latent distributions in deep generative models
Quantum latent distributions from boson samplers are shown in theory to expand the output distribution class of invertible Lipschitz generators, and in GAN benchmarks on QM9 to beat Gaussian, Bernoulli, and distinguis...
-
Strategic Plan for Neutral Atom Quantum Computation
If qubit-count growth (~1.8x/yr) and gate-error reduction (~0.62x/yr) continue, neutral-atom quantum computers could reach practical quantum advantage within a decade, this roadmap projects.
Discussion (0). Sign in to comment.