Related papers: Quantum optimization within lattice gauge theory m…
Quantum-classical hybrid algorithms offer a promising strategy for tackling computationally challenging problems, such as the maximum independent set (MIS) problem that plays a crucial role in areas like network design and data analysis.…
Quantum annealers are specialized quantum computers for solving combinatorial optimization problems using special characteristics of quantum computing (QC), such as superposition, entanglement, and quantum tunneling. Theoretically, quantum…
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about…
We consider a range of unconventional modifications to Quantum Annealing (QA), applied to an artificial trial problem with continuously tunable difficulty. In this problem, inspired by "transverse field chaos" in larger systems, classical…
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. The idea is tested by the two models, the transverse Ising model and the traveling salesman…
Quantum annealing approximately solves combinatorial optimization problems by leveraging the principles of adiabatic quantum systems. In this approach, the system's Hamiltonian evolves from an initial general state to a problem-specific…
We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for…
Gauge theories establish the standard model of particle physics, and lattice gauge theory (LGT) calculations employing Markov Chain Monte Carlo (MCMC) methods have been pivotal in our understanding of fundamental interactions. The present…
Recently, quantum simulation of low-dimensional lattice gauge theories (LGTs) has attracted many interests, which may improve our understanding of strongly correlated quantum many-body systems. Here, we propose an implementation to…
Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evolution to determine the global minimum of a given objective…
Quantum annealing (QA) refers to an optimization process that uses quantum fluctuations to find the global minimum of a rugged energy landscape with many local minima. Conceptually, QA is often framed in the context of the disordered…
We review recent suggestions to quantum simulate scalar electrodynamics (the lattice Abelian Higgs model) in $1+1$ dimensions with rectangular arrays of Rydberg atoms. We show that platforms made publicly available recently allow empirical…
The quantum phase transition of the one-dimensional long-range transverse-field Ising model is explored by combining the quantum Monte Carlo method and stochastic parameter optimization, specifically achieved by tuning correlation ratios so…
Simulating lattice gauge theories on quantum computers presents unique challenges that drive the development of novel theoretical frameworks. The orbifold lattice approach offers a scalable method for simulating SU($N$) gauge theories in…
Quantum annealing is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. Quantum annealing in the transverse field Ising model, implemented on D-Wave…
We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this…
Gauge theories are the most successful theories for describing nature at its fundamental level, but obtaining analytical or numerical solutions often remains a challenge. We propose an experimental quantum simulation scheme to study ground…
A topological $\theta$-term in gauge theories, including quantum chromodynamics in 3+1 dimensions, gives rise to a sign problem that makes classical Monte Carlo simulations impractical. Quantum simulations are not subject to such sign…
The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and…
We analyze the performance of simulated quantum annealing (SQA) on an optimization problem for which simulated classical annealing (SA) is provably inefficient because of a high energy barrier. We present evidence that SQA can pass through…