Related papers: Qudit non-Clifford interleaved benchmarking

Related papers

Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary. We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
arXiv Detail & Related papers (2025-04-22T16:10:34Z)
When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits [0.0]
We show that for a broad class of error models these concerns are unwarranted. We show that for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates.
arXiv Detail & Related papers (2025-03-07T21:18:59Z)
Alchemy: Amplifying Theorem-Proving Capability through Symbolic Mutation [71.32761934724867]
This work proposes Alchemy, a framework for data synthesis that constructs formal theorems through symbolic mutation. For each candidate theorem in Mathlib, we identify all invocable theorems that can be used to rewrite or apply to it. As a result, our method increases the number of theorems in Mathlib by an order of magnitude, from 110k to 6M.
arXiv Detail & Related papers (2024-10-21T08:04:21Z)
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.