Related papers: Simple Pulses for Universal Quantum Computation wi…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
Universal computation of a quantum system consisting of superpositions of well-separated coherent states of multiple harmonic oscillators can be achieved by three families of adiabatic holonomic gates. The first gate consists of moving a…
In this paper we apply the canonical decomposition of two qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the CNOT, swap, square root of swap and controlled Z…
The implementation of holonomic quantum computation is meaningful. We can effectively resist local and collective noise in the process of physical implementation by using the advantage of non-Abelian geometric phase. In this paper, we set…
Ultra fast and accurate quantum operations are required in many modern scientific areas - for instance quantum information, quantum metrology and magnetometry. However the accuracy is limited if the Rabi frequency is comparable with the…
The physical implementation of the quantum Control-Not gate for a two-spin system is investigated numerically. The concept of a generalized quantum Control-Not gate, with arbitrary phase shift, is introduced. It is shown that a resonant…
In gate-defined semiconductor spin qubits, the highly tunable Heisenberg exchange interaction is leveraged to implement fermionic two-qubit gates such as CZ and SWAP. However, the broader family of fermionic simulation (fSim) gates remains…
We propose a setup for universal and electrically controlled quantum information processing with hole spins in Ge/Si core/shell nanowire quantum dots (NW QDs). Single-qubit gates can be driven through electric-dipole-induced spin resonance,…
Quantum computation requires coherently controlling the evolutions of qubits. Usually, these manipulations are implemented by precisely designing the durations (such as the $\pi$-pulses) of the Rabi oscillations and tunable interbit…
Two-qubit logical gates are proposed on the basis of two atoms trapped in a cavity setup. Losses in the interaction by spontaneous transitions are efficiently suppressed by employing adiabatic transitions and the Zeno effect. Dynamical and…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
Accurate and efficient implementation of parallel quantum gates is crucial for scalable quantum information processing. However, the unavoidable crosstalk between qubits in current noisy processors impedes the achievement of high gate…
We present a novel scheme for universal quantum computation based on spinless interacting bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional Bose-Hubbard model. Arbitrary X and Z rotations are…
The geometric aspects of quantum mechanics are underlined most prominently by the concept of geometric phases, which are acquired whenever a quantum system evolves along a closed path in Hilbert space. The geometric phase is determined only…
We describe and discuss a solid state proposal for quantum computation with mobile spin qubits in one-dimensional systems, based on recent advances in spintronics. Static electric fields are used to implement a universal set of quantum…
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native…
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qubit basis-changing gate -- commonly chosen to be the…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…