相关论文: A Random Matrix Model of Adiabatic Quantum Computi…

We study an architecture for implementing adiabatic quantum computation with trapped neutral atoms. Ground state atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism, thereby providing the requisite…

I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a…

Since it was first applied to the study of nuclear interactions by Wigner and Dyson, almost 60 years ago, Random Matrix Theory (RMT) has developed into a field of its own within applied mathematics, and is now essential to many parts of…

Adiabatic Quantum Computing relies on the quantum adiabatic theorem, which states that a quantum system evolves along its ground state with time if the governing Hamiltonian varies infinitely slowly. However, practical limitations force…

A typical goal of a quantum simulation is to find the energy levels and eigenstates of a given Hamiltonian. This can be realized by adiabatically varying the system control parameters to steer an initial eigenstate into the eigenstate of…

The superadiabatic quantum driving, producing a perfect adiabatic transfer on a given Hamitonian by introducing an additional Hamiltonian, is theoretically analysed for transfers within a three-level system. Our starting point is the…

We consider the adiabatic quantum algorithm for systems with "no sign problem", such as the transverse field Ising mode, and analyze the equilibration time for quantum Monte Carlo (QMC) on these systems. We ask: if the spectral gap is only…

Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required…

It recently has been found that methods of the statistical theories of spectra can be a useful tool in the analysis of spectra far from levels of Hamiltonian systems. Several examples originate from areas, such as quantitative linguistics…

The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…

Harmonization methods such as ComBat and its variants are widely used to mitigate diffusion MRI (dMRI) site-specific biases. However, ComBat assumes that subject distributions exhibit a Gaussian profile. In practice, patients with…

In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…

Quantum computing promises significant improvements of computation capabilities in various fields such as machine learning and complex optimization problems. Recent technological advancements suggest that the adiabatic quantum computing…

We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in [E. Farhi, et al., arXiv:quant-ph/0208135]. The algorithm is applied to a random binary optimization problem (a version…

Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…

We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the…

Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…

Quantum computation by the adiabatic theorem requires a slowly varying Hamiltonian with respect to the spectral gap. We show that the Landau-Zener-St\"uckelberg oscillation phenomenon, that naturally occurs in quantum two level systems…

Adiabatic Rapid Passage (ARP) is a powerful technique for efficient transfer of population between quantum states. In the lab, the efficiency of ARP is often limited by noise on either the energies of the states or the frequency of the…

The most general and versatile defining feature of quantum chaotic systems is that they possess an energy spectrum with correlations universally described by random matrix theory (RMT). This feature can be exhibited by systems with a well…