Related papers: Always On Non-Nearest-Neighbor Coupling in Scalabl…
A simple Mathematica code based on the differential realization of hard-core boson operators for finding exact solutions of the periodic-N spin-1/2 systems with or beyond nearest neighbor interactions is proposed, which can easily be used…
The last decades have seen a burst of experimental platforms reaching the so-called strong-coupling regime, where quantum coherent effects dominate over incoherent processes such as dissipation and thermalization. This has allowed us to…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
The presence of non-local and long-range interactions in quantum systems induces several peculiar features in their equilibrium and out-of-equilibrium behavior. In current experimental platforms control parameters such as interaction range,…
We propose and analyze a setup based on (solid-state) qubits coupled to a common multi-mode transmission line, which allows for coherent spin-spin interactions over macroscopic on-chip distances, without any ground-state cooling…
We show how the spin independent scattering of two initially distant qubits, say, in distinct traps or in remote sites of a lattice, can be used to implement an entangling quantum gate between them. The scattering takes place under 1D…
We propose a scheme for implementing quantum gates and entanglement between spin qubits in the outer dots of a triple-dot system with an empty central dot. The voltage applied to the central dot can be tuned to realize the gate. Our scheme…
Quantum computers are expected to contribute more efficient and accurate ways of modeling economic processes. Quantum hardware is currently available at a relatively small scale, but effective algorithms are limited by the number of logic…
The spin gap of a one-dimensional repulsive Hubbard model is numerically calculated with the density matrix renormalization group, with a special emphasis on the effect of a next-nearest neighbor hopping (t') and the nearest-neighbor…
The scalability of solid state quantum computation relies on the ability of connecting the qubits to the macroscopic world. Quantum chains can be used as quantum wires to keep regions of external control at a distance. However even in the…
Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory…
For a one-dimensional chain of four nuclear spins (1/2) and taking into account first and second neighbor interactions among the spin system, we make the numerical simulation of Shor prime factorization algorithm of the integer number N=4…
We present a new approach to scalable quantum computing--a ``qubus computer''--which realises qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be ``static'' matter qubits…
In this paper, we explore the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds for scalable, fault-tolerant quantum computation. To circumvent the traditionally low thresholds of small…
For the efficient implementation of quantum algorithms, practical ways to generate many-body entanglement are a basic requirement. Specifically, coupling multiple qubit pairs at once can be advantageous and can lead to multi-qubit…
Because of their long coherence times and potential for scalability, semiconductor quantum-dot spin qubits hold great promise for quantum information processing. However, maintaining high connectivity between quantum-dot spin qubits, which…
Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method…
In principle a 1D array of nearest-neighbour linked qubits is compatible with fault tolerant quantum computing. However such a restricted topology necessitates a large overhead for shuffling qubits and consequently the fault tolerance…
We explore the role of electron correlation in quasi one dimensional quantum wires as the range of the interaction potential is changed and their thickness is varied by performing exact quantum Monte Carlo simulations at various electronic…
We prove a general relation between adaptive and non-adaptive strategies in the quantum setting, i.e., between strategies where the adversary can or cannot adaptively base its action on some auxiliary quantum side information. Our relation…