Related papers: Hybrid benchmarking of arbitrary quantum gates
We consider a generalization of the standard Metropolis algorithm acceptance/rejection decision rule and numerically explore its properties using auxiliary field quantum Monte Carlo. The generalization involves a free parameter which, given…
We show that the minimum experimental effort to characterize the proper functioning of a quantum device scales as 2^n for n qubits and requires classical computational resources ~ n^2 2^{3n}. This represents an exponential reduction…
Monte Carlo methods, Variational Inference, and their combinations play a pivotal role in sampling from intractable probability distributions. However, current studies lack a unified evaluation framework, relying on disparate performance…
Correlated sampling has wide-ranging applications in Monte Carlo calculations. When branching random walks are involved, as commonly found in many algorithms in quantum physics and electronic structure, population control is typically not…
Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a…
Quantum computing for the biological sciences is an area of rapidly growing interest, but specific industrial applications remain elusive. Quantum Markov chain Monte Carlo has been proposed as a method for accelerating a broad class of…
Mid-circuit measurements are a key component in many quantum information computing protocols, including quantum error correction, fault-tolerant logical operations, and measurement based quantum computing. As such, techniques to quickly and…
Quantum machine learning has the potential to provide powerful algorithms for artificial intelligence. The pursuit of quantum advantage in quantum machine learning is an active area of research. For current noisy, intermediate-scale quantum…
Neutral atoms are a promising platform for scalable quantum computing, however prior demonstration of high fidelity gates or low-loss readout methods have employed restricted numbers of qubits. Using randomized benchmarking of…
In this study, we propose quantum annealing-enhanced Markov Chain Monte Carlo (QAEMCMC), where QA is integrated into the MCMC subroutine. QA efficiently explores low-energy configurations and overcomes local minima, enabling the generation…
A review of the Loop Algorithm, its generalizations, and its relation to some other Monte Carlo techniques is given. The loop algorithm is a Quantum Monte Carlo procedure which employs nonlocal changes of worldline configurations,…
Quantum information processing shows advantages in many tasks, including quantum communication and computation, comparing to its classical counterpart. The essence of quantum processing lies on the fundamental difference between classical…
Quantum algorithms present a quadratically improved complexity over classical ones for certain sampling tasks. For instance, the Quantum Amplitude Estimation (QAE) algorithm promises to speedup the estimation of the mean of certain…
We review an experimental technique used to correct state preparation and measurement errors on gate-based quantum computers, and discuss its rigorous justification. Within a specific biased quantum measurement model, we prove that nonideal…
Not all quantum protocols require entanglement to outperform their classical alternatives. The nonclassical correlations that lead to this quantum advantage are conjectured to be captured by quantum discord. Here we demonstrate that discord…
The information obtained from the operation of a quantum gate on only two complementary sets of input states is sufficient to estimate the quantum process fidelity of the gate. In the case of entangling gates, these conditions can be used…
Sampling tasks are a natural class of problems for quantum computers due to the probabilistic nature of the Born rule. Sampling from useful distributions on noisy quantum hardware remains a challenging problem. A recent paper [Layden, D. et…
Several proposed quantum computer models include measurement processes, in order to implement nonlocal gates and create necessary entanglement resources during the computation. We introduce a scheme in which the measurements can be delayed…
We study a method, Extra Chance Generalized Hybrid Monte Carlo, to avoid rejections in the Hybrid Monte Carlo method and related algorithms. In the spirit of delayed rejection, whenever a rejection would occur, extra work is done to find a…
Most near-term quantum information processing devices will not be capable of implementing quantum error correction and the associated logical quantum gate set. Instead, quantum circuits will be implemented directly using the physical native…