Related papers: Nested composite NOT gates for quantum computation
We propose a method to construct composite two-qubit gates with narrowband profiles with respect to the spin-spin coupling. The composite sequences are selective to the variations in the amplitude and duration of the spin-spin coupling, and…
We demonstrate how using two-qubit composite rotations a high fidelity controlled-NOT (CNOT) gate can be constructed, even when the strength of the interaction between qubits is not accurately known. We focus on the exchange interaction…
We show that all geometric quantum gates (GQG's in short), which are quantum gates only with geometric phases, are robust against control field strength errors. As examples of this observation, we show (1) how robust composite rf-pulses in…
A crucial building block for quantum information processing with trapped ions is a controlled-NOT quantum gate. In this paper, two different sequences of laser pulses implementing such a gate operation are analyzed using quantum process…
Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or…
We introduce a novel control method for robust quantum information processing suited for quantum integrated photonics. We utilize off-resonant detunings as control parameters to derive a new family of composite pulses for high-fidelity…
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…
Non-Gaussian operations are essential for most bosonic quantum technologies. Yet, realizable non-Gaussian gates are rather limited in type and generally suffer from accuracy-duration trade-offs. In this work, we propose to use quantum…
We discuss the implementation of arbitrary precision composite pulses developed using the methods of Brown et al. [Phys. Rev. A 70 (2004) 052318]. We give explicit results for pulse sequences designed to tackle both the simple case of pulse…
We study the performance of composite pulses in the presence of time-varying control noise on a single qubit. These protocols, originally devised only to correct for static, systematic errors, are shown to be robust to time-dependent…
Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and…
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-tolerantly map between different encoded representations of a…
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…
We present a general systematic approach to design robust and high-fidelity quantum logic gates with Raman qubits using the technique of composite pulses. We use two mathematical tools -- the Morris-Shore and Majorana decompositions -- to…
Composite pulse sequences, which produce arbitrary pre-defined rotations of a qubit on the Bloch sphere, are presented. The composite sequences contain up to 17 pulses and can compensate up to eight orders of experimental errors in the…
We present a general method to quickly generate high-fidelity control pulses for any continuously-parameterized set of quantum gates after calibrating a small number of reference pulses. We find that interpolating between optimized control…
Reducing the circuit depth of quantum circuits is a crucial bottleneck to enabling quantum technology. This depth is inversely proportional to the number of available quantum gates that have been synthesised. Moreover, quantum gate…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimising the number of gates is known as gate-synthesis. The approximation error is a form of coherent…
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…