Related papers: Hamiltonian quantum computing with superconducting…
We derive an effective Hamiltonian that describes a cross-Kerr type interaction in a system involving a two-level trapped ion coupled to the quantized field inside a cavity. We assume a large detuning between the ion and field (dispersive…
Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models.…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
We introduce a novel quantum control method for superconducting transmon qubits that substantially outperforms conventional techniques in precision and robustness against coherent errors. Our approach leverages composite pulses (CP) to…
Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…
Quantum dot hybrid qubits formed from three electrons in double quantum dots represent a promising compromise between high speed and simple fabrication for solid state implementations of single qubit and two qubits quantum logic ports. We…
Quantum computing has garnered significant interest for its potential to solve certain computational problems much faster than the best-known classical algorithms. A fully functional and scalable quantum computer could transform various…
Skyrmions in frustrated magnets have the helicity degree of freedom, where two different configurations of Bloch-type skyrmions are energetically favored by the magnetic dipole-dipole interaction and characterized by opposite helicities. A…
We present an experimentally feasible scheme to implement holonomic quantum computation in the ultrastrong-coupling regime of light-matter interaction. The large anharmonicity and the Z2 symmetry of the quantum Rabi model allow us to build…
We solve the problem of an interacting quantum dot embedded in a Josephson junction between two superconductors with finite charging energy described by the transmon (Cooper pair box) Hamiltonian. The approach is based on the flat-band…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
It is argued that the Aharonov-Casher set up could be used as the basic building block for quantum computation. We demonstrate explicitly in this scenario one- and two-qubit phase shift gates that are fault tolerant to deformations of the…
The increasingly complex quantum electronic circuits with a number of coupled quantum degrees of freedom will become intractable to be simulated on classical computers, and requires quantum computers for an efficient simulation. In turn, it…
We study the quantum operation of coupled superconducting flux qubits under a microwave irradiation. The flux qubits can be described as magnetic dipole moments in the limit of weak microwave field amplitude consistent with usual…
We argue that the analog nature of quantum computing makes the usual design approach of constructing complicated logical operations from many simple gates inappropriate. Instead, we propose to design multi-spin quantum gates in which the…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
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…
We show how to construct a universal set of quantum logic gates using control over exchange interactions and single- and two-spin measurements only. Single-spin unitary operations are teleported instead of being executed directly, thus…
Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defining the simulation needs to be compiled into one that complies with hardware limitations such as qubit…