Related papers: Basic Elements for Simulations of Standard Model P…
Quantum annealing provides a powerful platform for simulating magnetic materials and realizing statistical physics models, presenting a compelling alternative to classical Monte Carlo methods. We demonstrate that quantum annealers can…
With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor…
The transversely confined propagating light modes of a nano-photonic optical waveguide or nanofiber can mediate effectively infinite-range forces. We show that for a linear chain of particles trapped within the waveguide's evanescent field,…
Over the recent years, the relatively young field of quantum simulation of lattice gauge theories - aiming at implementing simulators of gauge theories with quantum platforms, has gone through a rapid development process. It is now of…
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum…
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with capabilities exceeding classical computers. A quantum…
In the evaluation of quantum annealers, metrics based on ground state success rates have two major drawbacks. First, evaluation requires computation time for both quantum and classical processors that grows exponentially with problem size.…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
$SU(N_c)$ gauge theories in the strong coupling limit can be described by integer variables representing monomers, dimers and baryon loops. We demonstrate how the D-wave quantum annealer can perform importance sampling on $U(N_c)$ gauge…
Macroscopic ensembles of radiating dipoles are ubiquitous in the physical and natural sciences. In the classical limit the dipoles can be described as damped-driven oscillators, which are able to spontaneously synchronize and collectively…
We propose an algorithm for computing real-time observables using a quantum processor while avoiding the need to prepare the full quantum state. This reduction in quantum resources is achieved by classically sampling configurations in…
Numerical simulations have become an important tool to understand and predict non-perturbative phenomena in particle physics. In this article we attempt to present a general overview over the field. First, the basic concepts of lattice…
In this thesis, we focus on the problem of validating and benchmarking quantum annealers. To this end, we propose two algorithms for solving real-world problems and test how they perform on the current generation of quantum annealers. The…
We develop a time-dependent, grid-based framework for simulating infrared spectra that is specifically designed for quantum computers. The proposed circuit employs a probabilistic strategy for applying the non-unitary dipole operator and an…
In this work, we explore graph partitioning (GP) using quantum annealing on the D-Wave 2X machine. Motivated by a recently proposed graph-based electronic structure theory applied to quantum molecular dynamics (QMD) simulations, graph…
Quantum computers promise a qualitative speedup in solving a broad spectrum of practical optimization problems. The latter can be mapped onto the task of finding low-energy states of spin glasses, which is known to be exceedingly difficult.…
The D-Wave quantum annealers make it possible to obtain high quality solutions of NP-hard problems by mapping a problem in a QUBO (quadratic unconstrained binary optimization) or Ising form to the physical qubit connectivity structure on…
In this work, we develop a new quantum algorithm to solve a combinatorial problem with significant practical relevance occurring in clutch manufacturing. It is demonstrated how quantum optimization can play a role in real industrial…
Lattice gauge theories are fundamental to such distinct fields as particle physics, condensed matter, and quantum information science. Their local symmetries enforce the charge conservation observed in the laws of physics. Impressive…
The advantage of simulating lattice field theory with quantum computers is hamstrung by the limited resources that induce large errors from finite volume and sizable lattice spacings. Previous work has shown how classical simulations near…