Related papers: Always On Non-Nearest-Neighbor Coupling in Scalabl…
We have in mind a register of qubits for an quantum information system, and consider its decoherence in an idealized but typical situation. Spontaneous decay and other couplings to the far environment considered as the world outside the…
We present the quantum simulation of the frustrated quantum spin-$\frac{1}{2}$ antiferromagnetic Heisenberg spin chain with competing nearest-neighbor $(J_1)$ and next-nearest-neighbor $(J_2)$ exchange interactions in the real…
General spin-1/2 chains with symmetric nearest-neighbor interaction are studied. We rigorously prove that all spin models in this class, except for known integrable systems, are non-integrable in the sense that they possess no nontrivial…
Full connectivity of qubits is necessary for most quantum algorithms, which is difficult to directly implement on Noisy Intermediate-Scale Quantum processors. However, inserting swap gate to enable the two-qubit gates between uncoupled…
We propose the use of dipolar spin chains to enable long-range quantum logic between distant qubits. In our approach, an effective interaction between remote qubits is achieved by adiabatically following the ground state of the dipolar…
Distributed quantum computation is often proposed to increase the scalability of quantum hardware, as it reduces cooperative noise and requisite connectivity by sharing quantum information between distant quantum devices. However, such…
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing…
We show how to implement quantum computation on a system with an intrinsic Hamiltonian by controlling a limited subset of spins. Our primary result is an efficient control sequence on a nearest-neighbor XY spin chain through control of a…
We use a disordered anti-ferromagnetic spin-1/2 chain with anisotropic exchange coupling to model an array of interacting qubits. All qubits have the same level spacing, except two, which are called the defects of the chain. The level…
Most protocols for Quantum Information Processing consist of a series of quantum gates, which are applied sequentially. In contrast, interactions, for example between matter and fields, as well as measurements such as homodyne detection of…
We analyze, in general terms, the evolution of energy levels in quantum mechanics, as a function of a coupling parameter, and demonstrate the possibility of level crossings in systems described by irreducible matrices. In long-range…
We report the first simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain in which selective excitations of spins is provided by the gradient of the external magnetic field…
We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device with limited connectivity, and the other is a…
We investigate the theoretical limits of the effect of the quantum interaction distance on the speed of exact quantum addition circuits. For this study, we exploit graph embedding for quantum circuit analysis. We study a logical mapping of…
Capacitively coupled semiconductor spin qubits hold promise as the building blocks of a scalable quantum computing architecture with long-range coupling between distant qubits. However, the two-qubit gate fidelities achieved in experiments…
Variational quantum algorithms are among the most promising approaches for simulating interacting quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. However, the practical success of variational quantum…
A quantum computing simulation provides the opportunity to explore the behaviors of quantum circuits, study the properties of quantum gates, and develop quantum computing algorithms. Simulating quantum circuits requires geometric time and…
We realize Surface Code quantum memories for nearest-neighbor qubits with always-on Ising interactions. This is done by utilizing multi-qubit gates that mimic the functionality of several gates. The previously proposed Surface Code memories…
We propose a scalable neutral atom quantum computer with an on-demand interaction through a selective two-qubit gate operation. Atoms are trapped by a lattice of near field Fresnel diffraction lights so that each trap captures a single…
Strongly correlated quantum systems give rise to many exotic physical phenomena, including high-temperature superconductivity. Simulating these systems on quantum computers may avoid the prohibitively high computational cost incurred in…