Related papers: Spin networks on adiabatic quantum computer
The first proof of the quantum adiabatic theorem was given as early as 1928. Today, this theorem is increasingly applied in a many-body context, e.g. in quantum annealing and in studies of topological properties of matter. In this setup,…
We present a proposal for an adiabatic quantum pump based on a graphene monolayer patterned by electrostatic gates and operated in the low-energy Dirac regime. The setup under investigation works in the presence of inhomogeneous spin-orbit…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
From available data, we show strong positive spatial correlations in the qubits of a D-Wave 2000Q quantum annealing chip that are connected to qubits outside their own unit cell. Then, by simulating the dynamics of three different spin…
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…
With the discovery of Majorana quasiparticles in semiconductor-superconductor hybrid structures, topologically protected qubits have emerged as a promising contender for quantum information processing. While the construction of a universal…
Implementing holonomic quantum computation is a challenging task as it requires complicated interaction among multilevel systems. Here we propose to implement nonadiabatic holonomic quantum computation based on dressed-state qubits in…
Perturbed Hamming weight problems serve as examples of optimization instances for which the adiabatic algorithm provably out performs classical simulated annealing. In this work we study the efficiency of the adiabatic algorithm for solving…
We show that techniques of spatial adiabatic passage can be used to realise an electron interferometer in a geometry analogous to a conventional Aharonov-Bohm ring, with transport of the particle through the device modulated using coherent…
We reveal universal dynamical scaling behavior across adiabatic quantum phase transitions (QPTs) in networks ranging from traditional spatial systems (Ising model) to fully connected ones (Dicke and Lipkin-Meshkov-Glick models). Our…
Adiabatic quantum transistors allow quantum logic gates to be performed by applying a large field to a quantum many-body system prepared in its ground state, without the need for local control. The basic operation of such a device can be…
Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren plateaus render variational algorithms ineffective on large…
We present a 2-local quantum algorithm for graph isomorphism GI based on an adiabatic protocol. By exploiting continuous-time quantum-walks, we are able to avoid a mere diffusion over all possible configurations and to significantly reduce…
Quantum computers have the potential to expand the utility of lattice gauge theory to investigate non-perturbative particle physics phenomena that cannot be accessed using a standard Monte Carlo method due to the sign problem. Thanks to the…
For reliable and consistent quantum information processing carried out on a quantum network, the network structure must be fully known and a desired initial state must be accurately prepared on it. In this paper, for a class of spin…
We use the recently introduced U(N) framework for loop quantum gravity to study the dynamics of spin network states on the simplest class of graphs: two vertices linked with an arbitrary number N of edges. Such graphs represent two regions,…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We briefly review various computational methods for the solution of optimization problems. First, several classical methods such as Metropolis algorithm and simulated annealing are discussed. We continue with a description of quantum…
A scheme based on Coherent Tunneling by Adiabatic Passage (CTAP) of exchange-only spin qubit quantum states in a linearly arranged double quantum dot chain is demonstrated. Logical states for the qubit are defined by adopting the spin state…
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…