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 …
Unbiasing fermionic quantum Monte Carlo with a quantum computer
Interacting many-electron problems pose some of the greatest computational challenges in
science, with essential applications across many fields. The solutions to these problems will …
science, with essential applications across many fields. The solutions to these problems will …
Quantum computing for chemistry and physics applications from a Monte Carlo perspective
G Mazzola - The Journal of Chemical Physics, 2024 - pubs.aip.org
This Perspective focuses on the several overlaps between quantum algorithms and Monte
Carlo methods in the domains of physics and chemistry. We will analyze the challenges and …
Carlo methods in the domains of physics and chemistry. We will analyze the challenges and …
[HTML][HTML] Achieving quantum supremacy with sparse and noisy commuting quantum computations
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-
time) has been shown to be hard to simulate classically, assuming certain complexity …
time) has been shown to be hard to simulate classically, assuming certain complexity …
Quantifying quantum speedups: Improved classical simulation from tighter magic monotones
Consumption of magic states promotes the stabilizer model of computation to universal
quantum computation. Here, we propose three different classical algorithms for simulating …
quantum computation. Here, we propose three different classical algorithms for simulating …
Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture
The Quantum Singular Value Transformation (QSVT) is a recent technique that gives a
unified framework to describe most quantum algorithms discovered so far, and may lead to …
unified framework to describe most quantum algorithms discovered so far, and may lead to …
Architectures for quantum simulation showing a quantum speedup
One of the main aims in the field of quantum simulation is to achieve a quantum speedup,
often referred to as “quantum computational supremacy,” referring to the experimental …
often referred to as “quantum computational supremacy,” referring to the experimental …
Efficient quantum walk on a quantum processor
The random walk formalism is used across a wide range of applications, from modelling
share prices to predicting population genetics. Likewise, quantum walks have shown much …
share prices to predicting population genetics. Likewise, quantum walks have shown much …
Anticoncentration theorems for schemes showing a quantum speedup
One of the main milestones in quantum information science is to realise quantum devices
that exhibit an exponential computational advantage over classical ones without being …
that exhibit an exponential computational advantage over classical ones without being …
On the expressivity of embedding quantum kernels
One of the most natural connections between quantum and classical machine learning has
been established in the context of kernel methods. Kernel methods rely on kernels, which …
been established in the context of kernel methods. Kernel methods rely on kernels, which …