Multiplexed qubit readout quality metric beyond assignment fidelity
- URL: http://arxiv.org/abs/2502.08589v1
- Date: Wed, 12 Feb 2025 17:21:38 GMT
- Title: Multiplexed qubit readout quality metric beyond assignment fidelity
- Authors: Andras Di Giovanni, Adrian Skasberg Aasen, Jürgen Lisenfeld, Martin Gärttner, Hannes Rotzinger, Alexey V. Ustinov,
- Abstract summary: We use detector tomography to fully characterize multi-qubit readout of superconducting transmon qubits.
The impact of different readout parameters on the rate of information extraction is studied using quantum state reconstruction as a proxy.
We find the most effective allocation of a fixed shot budget between detector tomography and state reconstruction in single- and two-qubit experiments.
- Score: 0.0
- License:
- Abstract: The accurate measurement of quantum two-level objects (qubits) is crucial for developing quantum computing hardware. Over the last decade, the measure of choice for benchmarking readout routines for superconducting qubits has been assignment fidelity. However, this method only focuses on the preparation of computational basis states and therefore does not provide a complete characterization of the readout. Here, we expand the focus to the use of detector tomography to fully characterize multi-qubit readout of superconducting transmon qubits. The impact of different readout parameters on the rate of information extraction is studied using quantum state reconstruction infidelity as a proxy. The results are then compared with assignment fidelities, showing good agreement for separable two-qubit states. We therefore propose the rate of infidelity convergence as an alternative and more comprehensive benchmark for single- and multi-qubit readout optimization. We find the most effective allocation of a fixed shot budget between detector tomography and state reconstruction in single- and two-qubit experiments. To address the growing interest in three-qubit gates, we perform three-qubit quantum state tomography that goes beyond conventional readout error mitigation methods and find a factor of 30 reduction in quantum infidelity. Our results demonstrate that neither quantum nor classical qubit readout correlations are induced even by very high levels of readout noise. Consequently, correlation coefficients can serve as a valuable tool in qubit readout optimization.
Related papers
- Readout error mitigated quantum state tomography tested on superconducting qubits [0.0]
We test the ability of readout error mitigation to correct realistic noise found in systems composed of quantum two-level objects (qubits)
By treating readout error mitigation in the context of state tomography the method becomes largely readout mode-, architecture-, noise source-, and quantum state-independent.
We identify noise sources for which readout error mitigation worked well, and observed decreases in readout by a factor of up to 30.
arXiv Detail & Related papers (2023-12-07T10:54:17Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic
Control of the Dispersive Shift: Experiment and Theory [47.00474212574662]
A superconducting qubit is coupled to a large-bandwidth readout resonator.
We show a beyond-state-of-the-art two-state-readout error of only 0.25,%$ in 100 ns integration time.
The presented results are expected to further boost the performance of new and existing algorithms and protocols.
arXiv Detail & Related papers (2023-07-15T10:30:10Z) - Benchmarking multi-qubit gates -- I: Metrological aspects [0.0]
benchmarking hardware errors in quantum computers has drawn significant attention lately.
Existing benchmarks for digital quantum computers involve averaging the global fidelity over a large set of quantum circuits.
We develop a new figure-of-merit suitable for multi-qubit quantum gates based on the reduced Choi matrix.
arXiv Detail & Related papers (2022-10-09T19:36:21Z) - Transmon qubit readout fidelity at the threshold for quantum error
correction without a quantum-limited amplifier [1.8412219563671723]
High-fidelity and rapid readout of a qubit state is key to quantum computing and communication.
We present a readout scheme for superconducting qubits that combines two microwave techniques.
We demonstrate 99.5% assignment fidelity for two-state readout and 96.9% for three-state readout.
arXiv Detail & Related papers (2022-08-11T15:29:38Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Experimental violations of Leggett-Garg's inequalities on a quantum
computer [77.34726150561087]
We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems.
Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
arXiv Detail & Related papers (2021-09-06T14:35:15Z) - 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) - Robust quantum classifier with minimal overhead [0.8057006406834467]
Several quantum algorithms for binary classification based on the kernel method have been proposed.
These algorithms rely on estimating an expectation value, which in turn requires an expensive quantum data encoding procedure to be repeated many times.
We show that the kernel-based binary classification can be performed with a single-qubit measurement regardless of the number and the dimension of the data.
arXiv Detail & Related papers (2021-04-16T14:51:00Z) - 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)
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.