Non-Exponential Behaviour in Logical Randomized Benchmarking
- URL: http://arxiv.org/abs/2212.05488v1
- Date: Sun, 11 Dec 2022 12:30:27 GMT
- Title: Non-Exponential Behaviour in Logical Randomized Benchmarking
- Authors: Athena Ceasura, Pavithran Iyer, Joel J. Wallman, Hakop Pashayan
- Abstract summary: We construct a gate and time-independent noise model that results in the output of a logical randomized benchmarking protocol.
We show that the presence of machinery associated with the implementation of quantum error correction can facilitate non-exponential decay.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We construct a gate and time-independent noise model that results in the
output of a logical randomized benchmarking protocol oscillating rather than
decaying exponentially. To illustrate our idea, we first construct an example
in standard randomized benchmarking where we assume the existence of ``hidden''
qubits, permitting a choice of representation of the Clifford group that
contains multiplicities. We use the multiplicities to, with each gate
application, update a hidden memory of the gate history that we use to
circumvent theorems which guarantee the output decays exponentially. In our
focal setting of logical randomized benchmarking, we show that the presence of
machinery associated with the implementation of quantum error correction can
facilitate non-exponential decay. Since, in logical randomized benchmarking,
the role of the hidden qubits is assigned to the syndrome qubits used in error
correction and these are strongly coupled to the logical qubits via a decoder.
Related papers
- Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - Exponential Quantum Error Mitigation of BQP Computations using Verification [0.7673339435080445]
We present a modular error mitigation protocol for running quantum computations on a quantum computer.
Our framework interleaves standard computation rounds alongside test rounds for error-detection.
We introduce a post-selection technique called basketing to address time-dependent noise behaviours.
arXiv Detail & Related papers (2023-06-07T11:35:21Z) - Witnessing entanglement in trapped-ion quantum error correction under
realistic noise [41.94295877935867]
Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits.
We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms.
We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
arXiv Detail & Related papers (2022-12-14T20:00:36Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - Partial randomized benchmarking [0.0]
In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability.
We analyze such simplified, partial twirling and demonstrate that, unlike for the standard randomized benchmarking, the measured decay of fidelity is a linear combination of exponentials with different decay rates.
arXiv Detail & Related papers (2021-11-07T22:15:11Z) - Logical-qubit operations in an error-detecting surface code [0.0]
We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles.
For each type of operation, we observe higher performance for fault-tolerant variants over non-fault-tolerant variants.
arXiv Detail & Related papers (2021-02-25T18:40:02Z) - Relaxation times do not capture logical qubit dynamics [50.04886706729045]
We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits.
This work will help to guide and benchmark experimental implementations of logical qubits.
arXiv Detail & Related papers (2020-12-14T19:51:19Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - On the robustness of the hybrid qubit computational gates through
simulated randomized benchmarking protocols [0.0]
Noise characterization can be achieved by exploiting different techniques, such as randomization.
A scalable and robust algorithm able to benchmark the full set of Clifford gates is called randomized benchmarking.
In this study, we simulated randomized benchmarking protocols in a semiconducting all-electrical three-electron double-quantum dot qubit.
arXiv Detail & Related papers (2020-11-03T09:35:39Z) - Coherent randomized benchmarking [68.8204255655161]
We show that superpositions of different random sequences rather than independent samples are used.
We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
arXiv Detail & Related papers (2020-10-26T18:00:34Z) - Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values.
We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions.
For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
arXiv Detail & Related papers (2020-08-19T16:04: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.