Restricted Randomized Benchmarking with Universal Gates of Fixed Sequence Length
- URL: http://arxiv.org/abs/2405.05215v1
- Date: Wed, 8 May 2024 17:07:56 GMT
- Title: Restricted Randomized Benchmarking with Universal Gates of Fixed Sequence Length
- Authors: Mohsen Mehrani, Kasra Masoudi, Rawad Mezher, Elham Kashefi, Debasis Sadhukhan,
- Abstract summary: We introduce a version of the RB protocol that creates Haar-randomness using a directly accessible universal gate set of equal sequence length.
This makes our protocol highly resource efficient and practical for small qubit numbers.
- Score: 0.5825410941577593
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The standard randomized benchmarking protocol requires access to often complex operations that are not always directly accessible. Compiler optimization does not always ensure equal sequence length of the directly accessible universal gates for each random operation. We introduce a version of the RB protocol that creates Haar-randomness using a directly accessible universal gate set of equal sequence length rather than relying upon a t-design or even an approximate one. This makes our protocol highly resource efficient and practical for small qubit numbers. We exemplify our protocol for creating Haar-randomness in the case of single and two qubits. Benchmarking our result with the standard RB protocol, allows us to calculate the overestimation of the average gate fidelity as compared to the standard technique. We augment our findings with a noise analysis which demonstrates that our method could be an effective tool for building accurate models of experimental noise.
Related papers
- One-Dimensional Deep Image Prior for Curve Fitting of S-Parameters from
Electromagnetic Solvers [57.441926088870325]
Deep Image Prior (DIP) is a technique that optimized the weights of a randomly-d convolutional neural network to fit a signal from noisy or under-determined measurements.
Relative to publicly available implementations of Vector Fitting (VF), our method shows superior performance on nearly all test examples.
arXiv Detail & Related papers (2023-06-06T20:28:37Z) - Randomized benchmarking with random quantum circuits [1.3406858660972554]
We derive guarantees for gates from arbitrary compact groups under experimentally plausible assumptions.
We show that many relevant filtered RB schemes can be realized with random quantum circuits in linear depth.
We show filtered RB to be sample-efficient for several relevant groups, including protocols addressing higher-order cross-talk.
arXiv Detail & Related papers (2022-12-12T19:00:19Z) - Non-Exponential Behaviour in Logical Randomized Benchmarking [0.0]
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.
arXiv Detail & Related papers (2022-12-11T12:30:27Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - A framework for randomized benchmarking over compact groups [0.6091702876917279]
characterization of experimental systems is an essential step in developing and improving quantum hardware.
A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to measure error rates in quantum systems.
A general framework for RB was proposed, which encompassed most of the known RB protocols and overcame the limitation on error models in previous works.
In this work we generalize the RB framework to continuous groups of gates and show that as long as the noise level is reasonably small, the output can be approximated as a linear combination of matrix exponential decays.
arXiv Detail & Related papers (2021-11-19T18:43:47Z) - Sampling Strategy Optimization for Randomized Benchmarking [4.7362989868031855]
benchmarking (RB) is a widely used method for estimating the average fidelity of gates implemented on a quantum computing device.
We propose a method for fully optimizing an RB configuration so that the confidence interval of the estimated fidelity is minimized.
arXiv Detail & Related papers (2021-09-16T01:14:13Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN)
In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent.
This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
arXiv Detail & Related papers (2021-03-17T21:49:53Z) - Lossless Compression of Efficient Private Local Randomizers [55.657133416044104]
Locally Differentially Private (LDP) Reports are commonly used for collection of statistics and machine learning in the federated setting.
In many cases the best known LDP algorithms require sending prohibitively large messages from the client device to the server.
This has led to significant efforts on reducing the communication cost of LDP algorithms.
arXiv Detail & Related papers (2021-02-24T07:04:30Z) - 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)
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.