Benchmarking an 11-qubit quantum computer

@article{Wright2019BenchmarkingA1,
  title={Benchmarking an 11-qubit quantum computer},
  author={Kenneth Wright and Kristin M. Beck and Shantanu Debnath and Jason M. Amini and Yun Seong Nam and Nikodem Grzesiak and J.-S. Chen and Neal C. Pisenti and Mika Chmielewski and Coleman Collins and Kai M. Hudek and Jonathan Mizrahi and Jaime David Wong-Campos and Stewart Allen and Joel Apisdorf and Phil Solomon and M. J. Williams and Andrew M. Ducore and Aleksey Blinov and Sarah M. Kreikemeier and Vandiver Chaplin and Matthew J. Keesan and Christopher R. Monroe and J. Kim},
  journal={Nature Communications},
  year={2019},
  volume={10}
}
The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate… 

Characterizing large-scale quantum computers via cycle benchmarking

Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the

Optimal calibration of gates in trapped-ion quantum computers

This work develops a method to determine a fixed number (budget) of quantum gates that, when calibrated, will maximize the fidelity of a batch of input quantum programs, and develops heuristics that are scalable and faster than a randomized method for synthetic benchmark circuits generated based on real-world use cases.

Single-Qubit Cross Platform Comparison of Quantum Computing Hardware

As a variety of quantum computing models and platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance. Despite being

Demonstration of Shor Encoding on a Trapped-Ion Quantum Computer

Fault-tolerant quantum error correction (QEC) is crucial for unlocking the true power of quantum computers. QEC codes use multiple physical qubits to encode a logical qubit, which is protected

Efficient, stabilized two-qubit gates on a trapped-ion quantum computer

A new gate-optimizing principle is presented according to which negligible amounts of gate fidelity are traded for substantial savings in power, which, in turn, can be trade for substantial increases in gate speed and/or qubit connectivity.

Demonstration of algorithmic quantum speedup

This work implements the single-shot Bernstein-Vazirani algorithm, which solves the problem of identifying a hidden bitstring that changes after every oracle query, utilizing two different 27 -qubit IBM Quantum (IBMQ) superconducting processors.

Quantum simulation and computing with Rydberg-interacting qubits

Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a competitive physical platform for quantum simulation and computing, where high-fidelity state preparation and

Efficient learning of quantum noise

The results pave the way for noise metrology in next-generation quantum devices, calibration in the presence of crosstalk, bespoke quantum error-correcting codes 10 and customized fault-tolerance protocols 11 that can greatly reduce the overhead in a quantum computation.

Trapped-Ion Quantum Computer with Robust Entangling Gates and Quantum Coherent Feedback

Quantum computers are expected to achieve a significant speed-up over classical computers in solving a range of computational problems. Chains of ions held in a linear Paul trap are a promising

Hardware-Conscious Optimization of the Quantum Toffoli Gate

This paper reviews and expands both analytical and numerical methodology for optimizing quantum circuits at this abstraction level and uses these methods to produce optimized implementations of the Toffoli gate, a fundamental building block of several quantum algorithms with near-term applications in quantum compilation and machine learning.
...

References

SHOWING 1-10 OF 46 REFERENCES

Characterizing large-scale quantum computers via cycle benchmarking

Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the

Demonstration of a small programmable quantum computer with atomic qubits

A five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates, which provides the flexibility to implement a variety of algorithms without altering the hardware.

Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing

The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.

Superconducting quantum circuits at the surface code threshold for fault tolerance

The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.

Experimental comparison of two quantum computing architectures

It is shown that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits, and suggested that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

Randomized Benchmarking of Quantum Gates

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

A programmable three-qubit superconducting processor with all-to-all connectivity

This work presents a programmable three-qubit processor, nicknamed "trimon", with strong all-to-all coupling and access to native three-Qubit gates, and implements three- qubit version of various algorithms, namely Deutsch-Jozsa, Bernstein-Vazirani, Grover's search and the quantum Fourier transform.

High-Speed, Low-Crosstalk Detection of a Trapped $^{171}$Yb$^+$ Ion Ancilla Qubit using Superconducting Nanowire Single Photon Detectors

Qubits used in quantum computing tend to suffer from errors, either from the qubit interacting with the environment, or from imperfect control when quantum logic gates are applied. Fault-tolerant

Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer

An exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer that demonstrates an exponential improvement in both classical and quantum resources over the current state of the art.

Realization of a scalable Shor algorithm

The realization of a scalable Shor algorithm, as proposed by Kitaev, is presented, which has been realized scalably within an ion-trap quantum computer and returns the correct factors with a confidence level exceeding 99%.