Related papers: Tighter Lower Bounds on Quantum Annealing Times

Experiments on disordered alloys suggest that spin glasses can be brought into low-energy states faster by annealing quantum fluctuations than by conventional thermal annealing. Due to the importance of spin glasses as a paradigmatic…

One of the current major challenges surrounding the use of quantum annealers for solving practical optimization problems is their inability to encode even moderately sized problems---the main reason for this being the rigid layout of their…

Hamiltonian simulations are key subroutines in adiabatic quantum computation, quantum control, and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. In contrast to time-independent Hamiltonian…

This paper extends work done to date on quantum computation by associating potentials with different types of computation steps. Quantum Turing machine Hamiltonians, generalized to include potentials, correspond to sums over tight binding…

We address the question: Given an arbitrary initial state and a general physical interaction what is the minimum time for reaching a target entangled state? We show that the minimum time is inversely proportional to the quantum mechanical…

In the computational model of quantum annealing, the size of the minimum gap between the ground state and the first excited state of the system is of particular importance, since it is inversely proportional to the running time of the…

Standard variational methods tend to obtain upper bounds on the ground state energy of quantum many-body systems. Here we study a complementary method that determines lower bounds on the ground state energy in a systematic fashion, scales…

A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an antiferromagnetic Ising chain. We demonstrate analytically and numerically (for up to N=1024 spins) that our approach leads to a significant…

Periodically-driven systems are ubiquitous in science and technology. In quantum dynamics, even a small number of periodically-driven spins leads to complicated dynamics. Hence, it is of interest to understand what constraints such dynamics…

The simulation of quantum systems has been a key aim of quantum technologies for decades, and the generalisation to open systems is necessary to include physically realistic systems. We introduce an approach for quantum simulations of open…

Measurement-based quantum computation is different from other approaches for quantum computation, in that everything needs to be done is only local measurement on a certain entangled state. It thus uses entanglement as the resource that…

We study the entanglement of tripartite quantum states and provide analytical lower bound of concurrence in terms of the concurrence of sub-states. The lower bound may improve all the existing lower bounds of concurrence. The approach is…

Annealing is the process of gradually lowering the temperature of a system to guide it towards its lowest energy states. In an accompanying paper [Luo et al. Phys. Rev. E 108, L052105 (2023)], we derived a general bound on annealing…

Probing the lowest energy configuration of a complex system by quantum annealing was recently found to be more effective than its classical, thermal counterpart. Comparing classical and quantum Monte Carlo annealing protocols on the random…

Annealing algorithms such as simulated annealing and population annealing are widely used both for sampling the Gibbs distribution and solving optimization problems (i.e. finding ground states). For both statistical mechanics and…

Classical and quantum annealing are two heuristic optimization methods that search for an optimal solution by slowly decreasing thermal or quantum fluctuations. Optimizing annealing schedules is important both for performance and fair…

We study the Ising Hamiltonian with a transverse field term to simulate the quantum annealing. Using shortcuts to adiabaticity, we design the time dependence of the Hamiltonian. The dynamical invariant is obtained by the mean-field ansatz,…

The continuation of Misner space into the Euclidean region is seen to imply the topological restriction that the period of the closed spatial direction becomes time-dependent. This restriction results in a modified Lorentzian Misner space…

We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of $N$ spins. Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with time-independent,…

Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…