相关论文: A Random Matrix Model of Adiabatic Quantum Computi…
Quantum algorithms have been developed for efficiently solving linear algebra tasks. However, they generally require deep circuits and hence universal fault-tolerant quantum computers. In this work, we propose variational algorithms for…
We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of "typical"…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…
Given the Hamiltonian, the evaluation of unitary operators has been at the heart of many quantum algorithms. Motivated by existing deterministic and random methods, we present a hybrid approach, where Hamiltonians with large amplitude are…
We investigate spectral fluctuations in multilayer networks within the random matrix theory (RMT) framework to characterize universal and non-universal features. The adjacency matrix of a multilayer network exhibits a block structure, with…
The ground state susceptibility of a system consisting of three flux-qubits was measured in the complete three dimensional flux space around the common degeneracy point of the qubits. The system's Hamiltonian could be completely…
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic…
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…
Surface hopping algorithms, as an important class of quantum dynamics simulation algorithms for non-adiabatic dynamics, are typically performed in the adiabatic representation, which can break down in the presence of ill-defined adiabatic…
We introduce quantum algorithms able to sample equilibrium water solvent molecules configurations within proteins thanks to analog quantum computing. To do so, we combine a quantum placement strategy to the 3D Reference Interaction Site…
We introduce a framework for mapping NP-Hard problems to adiabatic quantum computing (AQC) architectures that are heavily restricted in both connectivity and dynamic range of couplings, for which minor-embedding -- the standard problem…
Optimization problems such as the NP-complete 3-SAT provide an important benchmark for the difficult task of finding ground-states in strongly correlated many-body systems with rugged energy landscapes. The study of random 3-SAT problems as…
Quantum annealers like those from D-Wave Systems implement adiabatic quantum computing to solve optimization problems, but their analog nature and limited control functionalities present challenges to correcting or mitigating errors. As…
The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We present an alternative for quantum simulation of FHMs based on an…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
In quantum chaos, the spectral statistics generally follows the predictions of Random Matrix Theory (RMT). A notable exception is given by scar states, that enhance probability density around unstable periodic orbits of the classical…
We study both classical and quantum algorithms to solve a hard optimization problem, namely 3-XORSAT on 3-regular random graphs. By introducing a new quasi-greedy algorithm that is not allowed to jump over large energy barriers, we show…
Constructing an accurate approximation to nonadiabatic rate theory which is valid for arbitrary values of the electronic coupling has been a long-standing challenge in theoretical chemistry. Ring-polymer instanton theories offer a very…
We review methods for coherently controlling Rydberg quantum states of atomic ensembles using Adiabatic Rapid Passage and Stimulated Raman Adiabatic Passage. These methods are commonly used for population inversion in simple two-level and…