Enhancing qubit readout with Bayesian Learning
- URL: http://arxiv.org/abs/2302.07725v3
- Date: Fri, 17 Nov 2023 11:51:42 GMT
- Title: Enhancing qubit readout with Bayesian Learning
- Authors: F. Cosco and N. Lo Gullo
- Abstract summary: We introduce an efficient and accurate readout measurement scheme for single and multi-qubit states.
We benchmark our protocol on a quantum device with five superconducting qubits.
Our method shows a substantial reduction of the readout error and promises advantages for near-term and future quantum devices.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce an efficient and accurate readout measurement scheme for single
and multi-qubit states. Our method uses Bayesian inference to build an
assignment probability distribution for each qubit state based on a reference
characterization of the detector response functions. This allows us to account
for system imperfections and thermal noise within the assignment of the
computational basis. We benchmark our protocol on a quantum device with five
superconducting qubits, testing initial state preparation for single and
two-qubit states and an application of the Bernstein-Vazirani algorithm
executed on five qubits. Our method shows a substantial reduction of the
readout error and promises advantages for near-term and future quantum devices.
Related papers
- Bayesian mitigation of measurement errors in multi-qubit experiments [0.0]
We introduce an implementation of Bayesian measurement error mitigation tailored for multiqubit experiments on near-term quantum devices.
Our approach leverages complete information from the readout signal, which is available before any binary state assignment of the qubits.
We benchmark our protocol on actual quantum computers with superconducting qubits, where the readout signal encodes the measurement information in the IQ clouds before qubit state assignment.
arXiv Detail & Related papers (2024-08-01T18:41:49Z) - System Characterization of Dispersive Readout in Superconducting Qubits [37.940693612514984]
We introduce a single protocol to measure the dispersive shift, resonator linewidth, and drive power used in the dispersive readout of superconducting qubits.
We find that the resonator linewidth is poorly controlled with a factor of 2 between the maximum and minimum measured values.
We also introduce a protocol for measuring the readout system efficiency using the same power levels as are used in typical qubit readout.
arXiv Detail & Related papers (2024-02-01T08:15:16Z) - Optimal Qubit Reuse for Near-Term Quantum Computers [0.18188255328029254]
Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse.
We introduce a formal model for qubit reuse optimization that delivers provably optimal solutions.
We show improvements in the number of qubits and swap gate insertions, estimated success probability, and Hellinger fidelity of the investigated quantum circuits.
arXiv Detail & Related papers (2023-07-31T23:15:45Z) - 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) - Graph test of controllability in qubit arrays: A systematic way to
determine the minimum number of external controls [62.997667081978825]
We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits.
We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
arXiv Detail & Related papers (2022-12-09T12:59:44Z) - Suppressing quantum circuit errors due to system variability [0.0]
We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present day noisy quantum computing platforms.
We show that it is possible to recover on average nearly of missing fidelity using better qubit selection via efficient to compute cost functions.
arXiv Detail & Related papers (2022-09-30T15:00:38Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Fault-tolerant parity readout on a shuttling-based trapped-ion quantum
computer [64.47265213752996]
We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme.
We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%.
The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
arXiv Detail & Related papers (2021-07-13T20:08:04Z) - Single-Qubit Fidelity Assessment of Quantum Annealing Hardware [10.728339674268788]
This work proposes a Quantum Annealing Single-qubit Assessment protocol for quantifying the performance of individual qubits.
The proposed protocol scales to large quantum annealers with thousands of qubits and provides unique insights into the distribution of qubit properties.
arXiv Detail & Related papers (2021-04-07T18:12:05Z) - Entanglement purification by counting and locating errors with
entangling measurements [62.997667081978825]
We consider entanglement purification protocols for multiple copies of qubit states.
We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
arXiv Detail & Related papers (2020-11-13T19:02:33Z) - Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization.
We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
arXiv Detail & Related papers (2020-05-14T16:00:34Z)
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.