相关论文: Always On Non-Nearest-Neighbor Coupling in Scalabl…
Going beyond short-range interactions, we explore the role of long-range interactions in the extended XY model for transferring quantum states through evolution. In particular, employing a spin-1/2 chain with interactions decaying as a…
The possibility of using strongly and continuously interacting spins for quantum computation has recently been discussed. Here we present a simple optical scheme that achieves this goal while avoiding the drawbacks of earlier proposals. We…
We present a simple 2d local circuit that implements all-to-all interactions via perturbative gadgets. We find an analytic relation between the values $J_{ij}$ of the desired interaction and the parameters of the 2d circuit, as well as the…
Recent quantum technologies and quantum error-correcting codes emphasize the requirement for arranging interacting qubits in a nearest-neighbor (NN) configuration while mapping a quantum circuit onto a given hardware device, in order to…
It is well understood that a two-dimensional grid of locally-interacting qubits is a promising platform for achieving fault tolerant quantum computing. However in the near-future, it may prove less challenging to develop lower dimensional…
This paper presents a comprehensive study on the scalability challenges and opportunities in quantum communication networks, with the goal of determining parameters that impact networks most as well as the trends that appear when scaling…
Quantum computer is extensively used in solving financial problems. Quantum amplitude estimation, an algorithm that aims to estimate the amplitude of a given quantum state, can be utilized to determine the expectation value of bonds as the…
We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by…
We demonstrate that weighted graph states (WGS) generated via variable-range interacting Ising spin systems where the interaction strength decays with distance as a power law, characterized by the fall-off rate, can successfully implement…
We present a generalization of the recently proposed variational cluster perturbation theory to extended Hubbard models at half filling with repulsive nearest neighbor interaction. The method takes into account short-range correlations…
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…
We present the study of a quantum Controlled-Controlled-Not gate, implemented in a chain of three nuclear spins weakly Ising interacting between all of them, that is, taking into account first and second neighbor spin interactions. This…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
The construction of robust and scalable quantum gates is a uniquely hard problem in the field of quantum computing. Real-world quantum computers suffer from many forms of noise, characterized by the decoherence and relaxation times of a…
We theoretically investigate cross-talk in hyperfine gate control of donor-qubit quantum computer architectures, in particular the Kane proposal. By numerically solving the Poisson and Schr\"{o}dinger equations for the gated donor system,…
The utility of near-term quantum computers and simulators is likely to rely upon software-hardware co-design, with error-aware algorithms and protocols optimized for the platforms they are run on. Here, we show how knowledge of noise in a…
Studies of competing orders in 1D magnetic chains have attracted considerable attention in recent years, as the presence of long-range Heisenberg interactions is found to allow interesting quantum phase transitions. We investigate here the…
Quantum computing offers a promising route for tackling hard optimization problems by encoding them as Ising models. However, sparse qubit connectivity requires the use of minor-embedding, mapping logical qubits onto chains of physical…
A strongly coupled spin chain can mediate long-distance effective couplings or entanglement between remote qubits, and can be used as a quantum data bus. We study how the fidelity of a spin-1/2 Heisenberg chain as a spin bus is affected by…
We detect correlations in qubit-energy fluctuations of non-neighboring qubits defined in isotopically purified Si/SiGe quantum dots. At low frequencies (where the noise is strongest), the correlation coefficient reaches 10% for a…