Qudit non-Clifford interleaved benchmarking

• URL: http://arxiv.org/abs/2407.14963v2
• Date: Sun, 25 Aug 2024 21:05:00 GMT
• Title: Qudit non-Clifford interleaved benchmarking
• Authors: David Amaro-Alcalá, Barry C. Sanders, Hubert de Guise,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We introduce a scheme to characterise a qudit T gate that has different noise than a set of Clifford gates. We developed our scheme through representation theory and ring theory to generalise non-Clifford interleaved benchmarking to qudit systems. By restricting to the qubit case, we recover the dihedral benchmarking scheme. Our characterisation scheme provides experimental physicists a practical method for characterising universal qudit gate sets and advances randomised benchmarking research by providing the characterisation of a complete qudit library.

Related papers

• 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)
• Benchmarking of universal qutrit gates [0.0]
  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.
  arXiv  Detail & Related papers  (2023-12-29T01:21:55Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• 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)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• 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)
• Randomized Benchmarking with Stabilizer Verification and Gate Synthesis [0.0]
  We modify the standard Clifford randomized benchmarking (RB) and interleaved RB schemes targeting them to hardware limitations. We also develop a technique for characterising a variety of non-Clifford gates, by combining tools from gate synthesis with interleaved RB.
  arXiv  Detail & Related papers  (2021-02-25T17:54:47Z)
• 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)
• Orbital MCMC [82.54438698903775]
  We propose two practical algorithms for constructing periodic orbits from any diffeomorphism. We also perform an empirical study demonstrating the practical advantages of both kernels.
  arXiv  Detail & Related papers  (2020-10-15T22:25:52Z)
• Joint Contrastive Learning with Infinite Possibilities [114.45811348666898]
  This paper explores useful modifications of the recent development in contrastive learning via novel probabilistic modeling. We derive a particular form of contrastive loss named Joint Contrastive Learning (JCL)
  arXiv  Detail & Related papers  (2020-09-30T16:24:21Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)

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.