相关论文: Hamiltonians for Quantum Computing

The quantum approximate optimization algorithm (QAOA) applies two Hamiltonians to a quantum system in alternation. The original goal of the algorithm was to drive the system close to the ground state of one of the Hamiltonians. This paper…

Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear…

The author analyzes quantum computation with the hybrid qubit (HQ) that is encoded using the three-electron configuration of a double quantum dot. All gate operations are controlled with electric signals, while the qubit remains at an…

The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…

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…

Many coherence transfer experiments in Nuclear Magnetic Resonance Spectroscopy, involving network of coupled spins, use temporary spin-decoupling to produce desired effective Hamiltonians. In this paper, we show that significant time can be…

We discuss a possibility of implementing a universal quantum XOR gate, by using two coupled quantum dots subjected to external magnetic fields that are parallel and slightly different. We consider this system in two different field…

We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…

Several topics on the implementation of spin qubits in quantum dots are reviewed. We first provide an introduction to the standard model of quantum computing and the basic criteria for its realization. Other alternative formulations such as…

In the past few years there has been a tumultuous activity aimed at introducing novel conceptual schemes for quantum computing. The approach proposed in (Marzuoli A and Rasetti M 2002, 2005a) relies on the (re)coupling theory of SU(2)…

We experimentally assess the suitability of transmon qubits with fixed frequencies and fixed interactions for the realization of analogue quantum simulations of spin systems. We test a set of necessary criteria for this goal on a commercial…

Developing Hamiltonian models for quantum processors with many qubits on the same chip is crucial for advancing quantum computing technologies. Stray couplings between qubits lead to errors in gate operations. This study underscores the…

How to implement multi-qubit gates is an important problem in quantum information processing. Based on cross phase modulation, we present an approach to realizing a family of multi-qubit gates that deterministically operate on single…

We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…

We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and…

A proposal for a magnetic quantum processor that consists of individual molecular spins coupled to superconducting coplanar resonators and transmission lines is carefully examined. We derive a simple magnetic quantum electrodynamics…

The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the CNOT gate can be realized easily. It can be shown that, e.g., with the XY interaction more than one two-qubit…

Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…

Quantum computers could perform certain tasks which no classical computer can perform in acceptable times. Josephson junction circuits can serve as building blocks of quantum computers. We discuss and compare two designs, which employ…

We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…