Benchmarking an 11-qubit quantum computer

Wright, Kenneth; Beck, Kristin M.; Debnath, Shantanu; Amini, Jason M.; Nam, Yoonsu; Grzesiak, Nikodem; Chen, Jwo-Sy; Pisenti, Neal C.; Chmielewski, Mika; Collins, Coleman; Hudek, Kai; Mizrahi, Jonathan; Wong-Campos, J. D.; Allen, Stewart; Apisdorf, Joel; Solomon, Phil; Williams, M.; Ducore, Andrew M.; Blinov, Aleksey; Kreikemeier, Sarah M.; Chaplin, V.; Keesan, Matthew; Monroe, C.; Kim, J.

doi:10.1038/s41467-019-13534-2

Cited by 511 publications

(365 citation statements)

References 36 publications

Supporting

Mentioning

359

Contrasting

Unclassified

Order By: Relevance

“…We first performed SRB-lite with sequences of qutrit-Clifford gates [7,21,35,49,91, 147] each with 33-36 randomizations (results plotted in Fig. 3a).…”

Section: Resultsmentioning

confidence: 99%

“…Nevertheless, the goal of the setup is to determine a quantitative measure of the entangling gate's performance. This is a common setup for many trappedion experiments that are trying to demonstrate new entangling gates or high-fidelity performance [4,5,7].…”

Section: Subspace Randomized Benchmarkingmentioning

confidence: 99%

“…While the quantity had solid theoretical motivations, experimentalists lacked a simple method for its measurement for two or more qubits. In practice, experimentalists were stuck choosing between comprehensive but resource-intensive process tomography [3] and convenient but less descriptive Bell-state tomography [4][5][6][7].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Subspace benchmarking high-fidelity entangling operations with trapped ions

Baldwin

Bjork

Gaebler

et al. 2020

Phys. Rev. Research

View full text Add to dashboard Cite

We present a new and simplified two-qubit randomized benchmarking procedure that operates only in the symmetric subspace of a pair of qubits and is well suited for benchmarking trapped-ion systems. By performing benchmarking only in the symmetric subspace, we drastically reduce the experimental complexity, number of gates required, and run time. The protocol is demonstrated on trapped ions using collective single-qubit rotations and the Mølmer-Sørenson (MS) interaction to estimate an entangling gate error of 2(1) × 10 −3 . We analyze the expected errors in the MS gate and find that population remains mostly in the symmetric subspace. The errors that mix symmetric and anti-symmetric subspaces appear as leakage and we characterize them by combining our protocol with recently proposed leakage benchmarking. Generalizations and limitations of the protocol are also discussed. III. Subspace RB -Our constuction of SRB and howsubspace leakage is considered.IV. Extracting information from SRB -Analysis of how different errors are manifested in SRB.V. Experimental platform -A description of the SRB demonstration.VI. Results and discussion -Estimates of the subspace and leakage errors.VII. Generalized subspace RB -Extensions to other systems.arXiv:1911.00085v2 [quant-ph]

show abstract

“…We first performed SRB-lite with sequences of qutrit-Clifford gates [7,21,35,49,91, 147] each with 33-36 randomizations (results plotted in Fig. 3a).…”

Section: Resultsmentioning

confidence: 99%

Section: Subspace Randomized Benchmarkingmentioning

confidence: 99%

See 1 more Smart Citation

Subspace benchmarking high-fidelity entangling operations with trapped ions

Baldwin

Bjork

Gaebler

et al. 2020

Phys. Rev. Research

View full text Add to dashboard Cite

show abstract

“…Multi-qubit entangling gates are the most demanding operations, which can be generated via radiation-induced coupling between the qubit states (internal electronic states of the atomic ions) and the collective vibrational motion of the Coulomb crystal 19 . Impressive results have been achieved using linear qubit registers, including entanglement of 14-qubits 20 , 20-qubit quantum simulations 21 , multi-species entanglement 22 , remote entanglement of ions in two setups 23 , demonstration of Groovers algorithm 24 and an 11-qubit trapped ion quantum computer 25 .…”

Section: Introductionmentioning

confidence: 99%

Shuttling-based trapped-ion quantum information processing

Kaushal

Lekitsch

Stahl

et al. 2020

AVS Quantum Science

104

View full text Add to dashboard Cite

Moving trapped-ion qubits in a microstructured array of radiofrequency traps offers a route towards realizing scalable quantum processing nodes. Establishing such nodes, providing sufficient functionality to represent a building block for emerging quantum technologies, e.g. a quantum computer or quantum repeater, remains a formidable technological challenge. In this review, we present a holistic view on such an architecture, including the relevant components, their characterization and their impact on the overall system performance. We present a hardware architecture based on a uniform linear segmented multilayer trap, controlled by a custom-made fast multi-channel arbitrary waveform generator. The latter allows for conducting a set of different ion shuttling operations at sufficient speed and quality. We describe the relevant parameters and performance specifications for microstructured ion traps, waveform generators and additional circuitry, along with suitable measurement schemes to verify the system performance. Furthermore, a set of different basic shuttling operations for dynamic qubit register reconfiguration is described and characterized in detail.arXiv:1912.04712v1 [quant-ph]

show abstract

“…In 2019, the ion quantum computers demonstrated an impressive boost with realizations of several quantum algorithms with up to 11 qubits [10][11][12][13][14]. Hybrid classicalquantum algorithms have even been realized with up to 20 qubits [15].…”

Section: Introductionmentioning

confidence: 99%

Properties of phonon modes of an ion-trap quantum computer in the Aubry phase

2020

View full text Add to dashboard Cite

We study analytically and numerically the properties of phonon modes in an ion quantum computer. The ion chain is placed in a harmonic trap with an additional periodic potential which dimensionless amplitude K determines three main phases available for quantum computations: at zero K we have the case of Cirac-Zoller quantum computer, below a certain critical amplitude K < Kc the ions are in the Kolmogorov-Arnold-Moser (KAM) phase, with delocalized phonon modes and free chain sliding, and above the critical amplitude K > Kc ions are in the pinned Aubry phase with a finite frequency gap protecting quantum gates from temperature and other external fluctuations. For the Aubry phase, in contrast to the Cirac-Zoller and KAM phases, the phonon gap remains independent of the number of ions placed in the trap keeping a fixed ion density around the trap center. We show that in the Aubry phase the phonon modes are much better localized comparing to the Cirac-Zoller and KAM cases. Thus in the Aubry phase the recoil pulses lead to local oscillations of ions while in other two phases they spread rapidly over the whole ion chains making them rather sensible to external fluctuations. We argue that the properties of localized phonon modes and phonon gap in the Aubry phase provide advantages for the ion quantum computations in this phase with a large number of ions.

show abstract

Benchmarking an 11-qubit quantum computer

Cited by 511 publications

References 36 publications

Subspace benchmarking high-fidelity entangling operations with trapped ions

Subspace benchmarking high-fidelity entangling operations with trapped ions

Shuttling-based trapped-ion quantum information processing

Properties of phonon modes of an ion-trap quantum computer in the Aubry phase

Contact Info

Product

Resources

About