Qutrit randomized benchmarking
- URL: http://arxiv.org/abs/2008.09134v1
- Date: Thu, 20 Aug 2020 18:00:57 GMT
- Title: Qutrit randomized benchmarking
- Authors: A. Morvan, V. V. Ramasesh, M. S. Blok, J.M. Kreikebaum, K. O'Brien, L.
Chen, B. K. Mitchell, R. K. Naik, D. I. Santiago, and I. Siddiqi
- Abstract summary: Ternary quantum processors offer significant computational advantages over conventional qubit technologies.
To evaluate and compare the performance of such emerging quantum hardware it is essential to have robust benchmarking methods.
We demonstrate extensions of industry standard Randomized Benchmarking protocols, developed and used extensively for qubits.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Ternary quantum processors offer significant computational advantages over
conventional qubit technologies, leveraging the encoding and processing of
quantum information in qutrits (three-level systems). To evaluate and compare
the performance of such emerging quantum hardware it is essential to have
robust benchmarking methods suitable for a higher-dimensional Hilbert space. We
demonstrate extensions of industry standard Randomized Benchmarking (RB)
protocols, developed and used extensively for qubits, suitable for ternary
quantum logic. Using a superconducting five-qutrit processor, we find a
single-qutrit gate infidelity as low as $2.38 \times 10^{-3}$. Through
interleaved RB, we find that this qutrit gate error is largely limited by the
native (qubit-like) gate fidelity, and employ simultaneous RB to fully
characterize cross-talk errors. Finally, we apply cycle benchmarking to a
two-qutrit CSUM gate and obtain a two-qutrit process fidelity of $0.82$. Our
results demonstrate a RB-based tool to characterize the obtain overall
performance of a qutrit processor, and a general approach to diagnose control
errors in future qudit hardware.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Comparisons among the Performances of Randomized-framed Benchmarking
Protocols under T1, T2 and Coherent Error Models [11.286152850251684]
The current quantum computer, i.e. noisy intermediate-scale quantum (NISQ) computer encounters a bottleneck in how to deal with the noisy situation of the quantum machine.
It is still urgently required to construct more efficient and reliable benchmarking protocols.
arXiv Detail & Related papers (2023-09-27T08:25:00Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance.
Here we report on a strategy that can overcome such problems.
We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
arXiv Detail & Related papers (2023-08-04T13:39:46Z) - Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
We numerically simulate and characterize the operation of various quantum processors.
We identify and assess quantum complexity by comparing the performance of each device against benchmark lines.
We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
arXiv Detail & Related papers (2023-04-10T23:01:10Z) - Scalable fast benchmarking for individual quantum gates with local
twirling [1.7995166939620801]
We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates.
We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
arXiv Detail & Related papers (2022-03-19T13:01:14Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Matchgate benchmarking: Scalable benchmarking of a continuous family of
many-qubit gates [1.228572041576991]
We propose a method to reliably and efficiently extract the fidelity of many-qubit quantum circuits composed of continuously parametrized two-qubit gates called matchgates.
This method, which we call matchgate benchmarking, relies on advanced techniques from randomized benchmarking as well as insights from the representation theory of matchgate circuits.
arXiv Detail & Related papers (2020-11-25T22:15:27Z) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z) - High-fidelity, high-scalability two-qubit gate scheme for
superconducting qubits [16.01171409402694]
We experimentally demonstrate a new two-qubit gate scheme that exploits fixed-frequency qubits and a tunable coupler in a superconducting quantum circuit.
The scheme requires less control lines, reduces crosstalk effect, simplifies calibration procedures, yet produces a controlled-Z gate in 30ns with a high fidelity of 99.5%.
Our demonstration paves the way for large-scale implementation of high-fidelity quantum operations.
arXiv Detail & Related papers (2020-06-21T17:55:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.