Benchmarking of universal qutrit gates

• URL: http://arxiv.org/abs/2312.17418v2
• Date: Mon, 29 Jan 2024 19:09:04 GMT
• Title: Benchmarking of universal qutrit gates
• Authors: David Amaro-Alcal\'a, Barry C. Sanders, Hubert de Guise
• Abstract summary: We introduce a characterisation scheme for a universal qutrit gate set. Motivated by the rising interest in qutrit systems, we apply our criteria to characterise a scheme to the performance of a qutrit T gate.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a characterisation scheme for a universal qutrit gate set. Motivated by the rising interest in qutrit systems, we apply our criteria to establish that our hyperdihedral group underpins a scheme to characterise the performance of a qutrit T gate. Our resulting qutrit scheme is feasible, as it requires resources and data analysis techniques similar to resources employed for qutrit Clifford randomised benchmarking. Combining our T gate benchmarking procedure for qutrits with known qutrit Clifford-gate benchmarking enables complete characterisation of a universal qutrit gate set.

Related papers

• Qudit non-Clifford interleaved benchmarking [0.0]
  We introduce a scheme to characterise a qudit T gate that has different noise than a set of Clifford gates. By restricting to the qubit case, we recover the dihedral benchmarking scheme.
  arXiv  Detail & Related papers  (2024-07-20T18:52:57Z)
• Randomised benchmarking for universal qudit gates [0.0]
  We establish a scalable scheme for characterising diagonal non-Clifford gates for single- and multi-qudit systems. By employing cyclic operators and a qudit T gate, we generalise the dihedral benchmarking scheme for single- and multi-qudit circuits.
  arXiv  Detail & Related papers  (2024-07-15T02:16:02Z)
• How to Prune Your Language Model: Recovering Accuracy on the "Sparsity May Cry'' Benchmark [60.72725673114168]
  We revisit the question of accurate BERT-pruning during fine-tuning on downstream datasets. We propose a set of general guidelines for successful pruning, even on the challenging SMC benchmark.
  arXiv  Detail & Related papers  (2023-12-21T03:11:30Z)
• Learning Classifiers of Prototypes and Reciprocal Points for Universal Domain Adaptation [79.62038105814658]
  Universal Domain aims to transfer the knowledge between datasets by handling two shifts: domain-shift and categoryshift. Main challenge is correctly distinguishing the unknown target samples while adapting the distribution of known class knowledge from source to target. Most existing methods approach this problem by first training the target adapted known and then relying on the single threshold to distinguish unknown target samples.
  arXiv  Detail & Related papers  (2022-12-16T09:01:57Z)
• Demonstrating scalable randomized benchmarking of universal gate sets [0.0]
  We introduce and demonstrate a technique for scalable Randomized (RB) of many universal and continuously parameterized gate sets. We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed. We demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor.
  arXiv  Detail & Related papers  (2022-07-15T03:41:21Z)
• Three-fold way of entanglement dynamics in monitored quantum circuits [68.8204255655161]
  We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles. We obtain insights into the interplay between the local entanglement generation by the gates and the entanglement reduction by the measurements.
  arXiv  Detail & Related papers  (2022-01-28T17:21:15Z)
• Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
  This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM) We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
  arXiv  Detail & Related papers  (2021-05-11T03:39:08Z)
• Improving Problem Identification via Automated Log Clustering using Dimensionality Reduction [0.8122270502556374]
  We consider the problem of automatically grouping logs of runs that failed for the same underlying reasons, so that they can be treated more effectively. We ask: Does an approach developed to identify problems in system logs generalize to identifying problems in continuous deployment logs? We also ask: How does the criterion used for merging clusters in the clustering algorithm affect quality?
  arXiv  Detail & Related papers  (2020-09-07T17:26:18Z)
• Characterization of Control in a Superconducting Qutrit Using Randomized Benchmarking [0.0]
  We characterize control of a qutrit implemented in the lowest three energy levels of a capacitively-shunted flux-biased superconducting circuit. We find that errors are due to decoherence primarily and have a significant contribution from level shifts.
  arXiv  Detail & Related papers  (2020-09-01T17:44:35Z)
• Refined Gate: A Simple and Effective Gating Mechanism for Recurrent Units [68.30422112784355]
  We propose a new gating mechanism within general gated recurrent neural networks to handle this issue. The proposed gates directly short connect the extracted input features to the outputs of vanilla gates. We verify the proposed gating mechanism on three popular types of gated RNNs including LSTM, GRU and MGU.
  arXiv  Detail & Related papers  (2020-02-26T07:51:38Z)
• Target-Embedding Autoencoders for Supervised Representation Learning [111.07204912245841]
  This paper analyzes a framework for improving generalization in a purely supervised setting, where the target space is high-dimensional. We motivate and formalize the general framework of target-embedding autoencoders (TEA) for supervised prediction, learning intermediate latent representations jointly optimized to be both predictable from features as well as predictive of targets.
  arXiv  Detail & Related papers  (2020-01-23T02:37:10Z)

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.