Related papers: Spin networks on adiabatic quantum computer
We discuss a tensor network method for constructing the adiabatic gauge potential -- the generator of adiabatic transformations -- as a matrix product operator, which allows us to adiabatically transport matrix product states. Adiabatic…
Quantum information processing is likely to have far-reaching impact in the field of artificial intelligence. While the race to build an error-corrected quantum computer is ongoing, noisy, intermediate-scale quantum (NISQ) devices provide…
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 evolution of spin network states in loop quantum gravity can be described by introducing a time variable, defined by the surfaces of constant value of an auxiliary scalar field. We regulate the Hamiltonian, generating such an evolution,…
Quantum computing and quantum communication are remarkable examples of new information processing technologies that arise from the coherent manipulation of spins in nanostructures. We review our theoretical proposal for using electron spins…
As an ensemble scheme of solid-state NMR quantum computers the extension of Kane's many-qubits silicon scheme based on the array of 31 P donor atoms are spaced lengthwise of the strip gates is considered. The possible planar topology of…
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…
Quantum neuromorphic computing physically implements neural networks in brain-inspired quantum hardware to speed up their computation. In this perspective article, we show that this emerging paradigm could make the best use of the existing…
We prove that adiabatic computation is equivalent to standard quantum computation even when the adiabatic quantum system is restricted to be a set of particles on a one-dimensional chain. We give a construction that uses a 2-local…
In this paper, the scheme of quantum computing based on Stark chirped rapid adiabatic passage (SCRAP) technique [L. F. Wei et al., Phys. Rev. Lett. 100, 113601 (2008)] is extensively applied to implement the quantum-state manipulations in…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…
We consider a network whose nodes are electromagnetic cavities, each coupled to a single three-level atom. The nodes are connected by optical fibers. Each atom is addressed by a control laser, which along with the cavity field drives atomic…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
It is shown that anisotropic spin chains with gapped bulk excitations and magnetically ordered ground states offer a promising platform for quantum computation, which bridges the conventional single-spin-based qubit concept with recently…
In this paper a formalism for studying the dynamics of quantum systems coupled to classical spin environments is reviewed. The theory is based on generalized antisymmetric brackets and naturally predicts open-path off-diagonal geometric…
We investigate theoretically systems of ions in segmented linear Paul traps for the quantum simulation of quantum spin models with tunable interactions. The scheme is entirely general and can be applied to the realization of arbitrary…
We present a comprehensive review of past research into adiabatic quantum computation and then propose a scalable architecture for an adiabatic quantum computer that can treat NP-hard problems without requiring local coherent operations.…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
Considering the unique energy level structure of the one-axis twisting Hamiltonian in combination with standard rotations, we propose the implementation of a rapid adiabatic passage scheme on the Dicke state basis. The method permits to…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…