Related papers: Improving quantum gate performance through neighbo…
There is currently a significant need for robust and efficient methods for characterizing quantum devices. While there has been significant progress in this direction, there remains a crucial need to precisely determine the strength and…
In this paper, we demonstrate that optimal control algorithms can be used to speed up the implementation of modules of quantum algorithms or quantum simulations in networks of coupled qubits. The gain is most prominent in realistic cases,…
This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…
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…
The performance requirements for fault-tolerant quantum computing are very stringent. Qubits must be manipulated, coupled, and measured with error rates well below 1%. For semiconductor implementations, silicon quantum dot spin qubits have…
We propose a two-qubit collisional phase gate that can be implemented with available atom chip technology, and present a detailed theoretical analysis of its performance. The gate is based on earlier phase gate schemes, but uses a qubit…
Optimal control can be used to significantly improve multi-qubit gates in quantum information processing hardware architectures based on superconducting circuit quantum electrodynamics. We apply this approach not only to dispersive gates of…
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography.…
We consider how to forecast progress in the domain of quantum computing. For this purpose we collect a dataset of quantum computer systems to date, scored on their physical qubits and gate error rate, and we define an index combining both…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA…
Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical…
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…
Fault-tolerant quantum computing requires gates which function correctly despite the presence of errors, and are scalable if the error probability-per-gate is below a threshold value. To date, no method has been described for calculating…
The ability to engineer high-fidelity gates on quantum processors in the presence of systematic errors remains the primary barrier to achieving quantum advantage. Quantum optimal control methods have proven effective in experimentally…
Assuming an array that consists of two parallel lines of qubits and that permits only nearest neighbor interactions, we construct physical and logical circuitry to enable universal fault tolerant quantum computation under the [[7,1,3]]…
This work studies the feasibility of optimal control of high-fidelity quantum gates in a model of interacting two-level particles. One particle (the qubit) serves as the quantum information processor, whose evolution is controlled by a…
Fault tolerant protocol assumes the application of error correction after every quantum gate. However, correcting errors is costly in terms of time and number of qubits. Here we demonstrate that quantum error correction can be applied…
The quantum approximate optimization algorithm (QAOA) is a promising quantum-classical hybrid technique to solve combinatorial optimization problems in near-term gate-based noisy quantum devices. In QAOA, the objective is a function of the…
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse that may…