Related papers: Randomised benchmarking for universal qudit gates

Randomised benchmarking for universal qudit gates

URL: http://arxiv.org/abs/2407.10396v2
Date: Thu, 1 Aug 2024 02:57:31 GMT
Title: Randomised benchmarking for universal qudit gates
Authors: David Amaro-Alcalá, Barry C. Sanders, Hubert de Guise,
Abstract summary: 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.
Score: 0.0
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
Abstract: We aim to establish a scalable scheme for characterising diagonal non-Clifford gates for single- and multi-qudit systems; $d$ is a prime-power integer. By employing cyclic operators and a qudit T gate, we generalise the dihedral benchmarking scheme for single- and multi-qudit circuits. Our results establish a path for experimentally benchmarking qudit systems and are of theoretical and experimental interest because our scheme is optimal insofar as it does not require preparation of the full qudit Clifford gate set to characterise a non-Clifford gate. Moreover, combined with Clifford randomised benchmarking, our scheme is useful to characterise the generators of a universal gate set.

Related papers

Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes [51.205673783866146]
We propose and simulate a set of fault-tolerant and constant-depth logical gates on 2D toric codes. This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full Clifford group.
arXiv Detail & Related papers (2024-11-27T12:17:56Z)
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)
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)
Robustness of a universal gate set implementation in transmon systems via Chopped Random Basis optimal control [50.591267188664666]
We numerically study the implementation of a universal two-qubit gate set, composed of CNOT, Hadamard, phase and $pi/8$ gates, for transmon-based systems. The control signals to implement such gates are obtained using the Chopped Random Basis optimal control technique, with a target gate infidelity of $10-2$.
arXiv Detail & Related papers (2022-07-27T10:55:15Z)
Faster Born probability estimation via gate merging and frame optimisation [3.9198548406564604]
Outcome probabilities of any quantum circuit can be estimated using Monte Carlo sampling. We propose two classical sub-routines: circuit gate optimisation and frame optimisation. We numerically demonstrate that our methods provide improved scaling in the negativity overhead for all tested cases of random circuits.
arXiv Detail & Related papers (2022-02-24T14:18:34Z)
Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z)
Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z)
Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
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)

This list is automatically generated from the titles and abstracts of the papers in this site.