Related papers: Analytic solutions for quantum logic gates and mod…
Quantum error correction provides a path to large-scale quantum computers, but is built on challenging assumptions about the characteristics of the underlying errors. In particular, the mathematical assumption of independent errors in…
We present a scheme for implementing high-fidelity quantum logic gates using the quantum walk of a few interacting bosons on a one-dimensional lattice. The gate operation is carried out by a single compact lattice described by a…
Systematic control errors remain a primary obstacle to realizing high-fidelity single-qubit gates. We introduce composite pulse sequences that implement X and Hadamard gates while simultaneously compensating amplitude (Rabi-frequency),…
A successful quantum error correction protocol would allow quantum computers to run algorithms without suffering from the effects of noise. However, fully fault-tolerant quantum error correction is too resource intensive for existing…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
Recently Levy has shown that quantum computation can be performed using an ABAB.. chain of spin-1/2 systems with nearest-neighbor Heisenberg interactions. Levy notes that all necessary elementary computational `gates' can be achieved by…
We address the problem of constructing dynamically corrected gates for non-Markovian open quantum systems in settings where limitations on the available control inputs and/or the presence of control noise make existing analytical approaches…
Nuclear spins were among the first physical platforms to be considered for quantum information processing, because of their exceptional quantum coherence and atomic-scale footprint. However, their full potential for quantum computing has…
High-fidelity two-qubit entangling gates are essential building blocks for fault-tolerant quantum computers. Over the past decade, tremendous efforts have been made to develop scalable high-fidelity two-qubit gates with superconducting…
Nearly all modern solid-state quantum processors approach quantum computation with a set of discrete qubit operations (gates) that can achieve universal quantum control with only a handful of primitive gates. In principle, this approach is…
Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases.…
We study numerically the effects of static imperfections and residual couplings between qubits for the quantum phase estimation algorithm with two qubits. We show that the success probability of the algorithm is affected significantly more…
Digital quantum simulation is a promising application of quantum computers, where quantum dynamics is simulated by using quantum gate operations. Many techniques for decomposing a time-evolution operator of quantum dynamics into simulatable…
The prospect of building quantum circuits using advanced semiconductor manufacturing positions quantum dots as an attractive platform for quantum information processing. Extensive studies on various materials have led to demonstrations of…
Semiconductor spin qubits offer a unique opportunity for scalable quantum computation by leveraging classical transistor technology. Hole spin qubits benefit from fast all-electrical qubit control and sweet spots to counteract charge and…
The central challenge in building a quantum computer is error correction. Unlike classical bits, which are susceptible to only one type of error, quantum bits ("qubits") are susceptible to two types of error, corresponding to flips of the…
Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider…
The accurate implementation of quantum gates is essential for the realisation of quantum algorithms and digital quantum simulations. This accuracy may be increased on noisy hardware through the variational optimisation of gates, however the…